We present a construction of a CCA2-secure encryption scheme from a plaintext aware (sPA1), weakly simulatable public key encryption scheme. The notion of plaintext aware, weakly simulatable public key encryption has been considered previously by Myers, Sergi and shelat (SCN, 2012) and natural encryption schemes such as the Damgård Elgamal Scheme (Damgård, Crypto, 1991) and the Cramer-Shoup Lite Scheme (Cramer and Shoup, SIAM J. Comput., 2003) were shown to satisfy these properties. Recently, Myers, Sergi and shelat (SCN, 2012) defined an extension of non-malleable CCA1 security, called cNM-CCA1, and showed how to construct a cNM-CCA1-secure encryption scheme from a plaintext aware and weakly simulatable public key encryption scheme. Our work extends and improves on this result by showing that a full CCA2-secure encryption scheme can be constructed from the same assumptions. © 2014 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Dachman-Soled, D. (2014). A black-box construction of a CCA2 encryption scheme from a plaintext aware (sPA1) encryption scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8383 LNCS, pp. 37–55). Springer Verlag. https://doi.org/10.1007/978-3-642-54631-0_3
Mendeley helps you to discover research relevant for your work.