Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts


Structure-preserving cryptography is a world where messages , signatures, ciphertexts and public keys are entirely made of elements of a group over which a bilinear map is efficiently computable. While structure-preserving signatures have received much attention the last 6 years, structure-preserving encryption schemes have undergone slower development. In particular, the best known structure-preserving cryptosystems with chosen-ciphertext (IND-CCA2) security either rely on symmetric pairings or require long ciphertexts comprised of hundreds of group elements or do not provide publicly verifiable ciphertexts. We provide a publicly verifiable construction based on the SXDH assumption in asymmetric bilinear groups e : G × G → GT , which features relatively short ciphertexts. For typical parameters, our ciphertext size amounts to less than 40 elements of G. As a second contribution, we provide a structure-preserving encryption scheme with perfectly randomizable ciphertexts and replayable chosen-ciphertext security. Our new RCCA-secure system significantly improves upon the best known system featuring similar properties in terms of ciphertext size.
Fichier principal
Vignette du fichier
SP-CCA-PKC_full-version.pdf (708.09 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01621022 , version 1 (22-10-2017)



Benoît Libert, Thomas Peters, Chen Qian. Structure-Preserving Chosen-Ciphertext Security with Shorter Verifiable Ciphertexts. PKC 2017 - Public Key Cryptography, Mar 2017, Amsterdam, Netherlands. pp.247 - 276, ⟨10.1007/BFb0054113⟩. ⟨hal-01621022⟩
650 View
259 Download



Gmail Facebook Twitter LinkedIn More