2015 | OriginalPaper | Buchkapitel
Public-Key Encryption Indistinguishable Under Plaintext-Checkable Attacks
verfasst von : Michel Abdalla, Fabrice Benhamouda, David Pointcheval
Erschienen in: Public-Key Cryptography -- PKC 2015
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Indistinguishability under adaptive chosen-ciphertext attack (
IND-CCA
) is now considered the
de facto
security notion for public-key encryption. However, the security guarantee that it offers is sometimes stronger than what is needed by certain applications. In this paper, we consider a weaker notion of security for public-key encryption, termed indistinguishability under plaintext-checking attacks (
IND-PCA
), in which the adversary is only given access to an oracle which says whether or not a given ciphertext encrypts a given message. After formalizing the
IND-PCA
notion, we then design a new public-key encryption scheme satisfying it. The new scheme is a more efficient variant of the Cramer-Shoup encryption scheme with shorter ciphertexts and its security is also based on the plain Decisional Diffie-Hellman (
DDH
) assumption. Additionally, the algebraic properties of the new scheme also allow for proving plaintext knowledge using Groth-Sahai non-interactive zero-knowledge proofs or smooth projective hash functions. Finally, in order to illustrate the usefulness of the new scheme, we further show that, for many password-based authenticated key exchange (
PAKE
) schemes in the Bellare-Pointcheval-Rogaway security model, one can safely replace the underlying
IND-CCA
encryption schemes with our new
IND-PCA
one. By doing so, we were able to reduce the overall communication complexity of these protocols and obtain the most efficient
PAKE
schemes to date based on the plain
DDH
assumption.