Abstract
We address the question of whether or not semantically secure public-key encryption primitives imply the existence of chosen ciphertext attack (CCA) secure primitives. We show a black-box separation, following the methodology introduced by Impagliazzo and Rudich [23], for a large non-trivial class of constructions. In particular, we show that if the proposed CCA construction’s decryption algorithm does not query the semantically secure primitive’s encryption algorithm, then the proposed construction cannot be CCA secure.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case/average-case equivalence. In: ACM (ed.) Proceedings of the twenty-ninth annual ACM Symposium on the Theory of Computing, El Paso, Texas, May 4–6, 1997, pp. 284–293. ACM, New York (1997), ACM order no. 508970
Barak, B.: How to go beyond the black-box simulation barrier. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, Silver Spring, USA, 2001, pp. 106–115. IEEE Computer Society Press, Los Alamitos (2001)
Barak, B.: Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In: FOCS, pp. 345–355. IEEE Computer Society Press, Los Alamitos (2002)
Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, Springer, Heidelberg (1998)
Bellare, M., Goldreich, O., Petrank, E.: Uniform generation of np-witnesses using an np-oracle. Electronic Colloquium on Computational Complexity (ECCC) 5(32) (1998)
Bellare, M., Halevi, S., Sahai, A., Vadhan, S.: Many-to-one trapdoor functions and their relation to public-key cryptosystems. Cryptology ePrint Archive, Report, 1998/019 (1998), http://eprint.iacr.org/
Bellare, M., Rogaway, P.: Optimal asymmetric encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 92–111. Springer, Heidelberg (1995)
Bellare, M., Sahai, A.: Non-malleable encryption: Equivalence between two notions, and an indistinguishability-based characterization. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 519–536. Springer, Heidelberg (1999)
Blum, M., Goldwasser, S.: An efficient probabilistic public-key encryption scheme which hides all partial information. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 19–22. Springer, Heidelberg (1985)
Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13–25. Springer, Heidelberg (1998)
Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography (extended abstract). In: Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, New Orleans, Louisiana, 6–8 May, ACM Press, New York (1991)
Elkind, E., Sahai, A.: A unified methodology for constructing publickey encryption schemes secure against adaptive chosen-ciphertext attack (2004)
Fujisaki, E., Okamoto, T.: How to enhance the security of public-key encryption at minimum cost. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol. 1560, pp. 53–68. Springer, Heidelberg (1999)
Gennaro, R., Trevisan, L.: Lower bounds on the efficiency of generic cryptographic constructions. In: 41st Annual Symposium on Foundations of Computer Science, pp. 305–313. IEEE Computer Society Press, Los Alamitos (2000)
Gennaro, R., Gertner, Y., Katz, J.: Lower bounds on the efficiency of encryption and digital signature schemes. In: Proceedings of the thirty-fifth ACM symposium on Theory of computing, pp. 417–425. ACM Press, New York (2003)
Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The relationship between public key encryption and oblivious transfer. In: IEEE (ed.) 41st Annual Symposium on Foundations of Computer Science, pp. 325–335. IEEE Computer Society Press, Los Alamitos (2000)
Gertner, Y., Malkin, T., Reingold, O.: On the impossibility of basing trapdoor functions on trapdoor predicates. In: IEEE (ed.) 42nd IEEE Symposium on Foundations of Computer Science, pp. 126–135. IEEE Computer Society Press, Los Alamitos (2001)
Gertner, Y., Malkin, T., Myers, S.: Towards a separation of semantic and cca security for public key encryption. Cryptology ePrint Archive (2006), http://eprint.iacr.org/
Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM 33(4), 792–807 (1986)
Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, Seattle, Washington, 15–17 May, ACM Press, New York (1989)
Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences 28(2), 270–299 (1984)
Hastad, J., Impagliazzo, R., Levin, L.A., Luby, M.: Construction of pseudorandom generator from any one-way function. SIAM Journal of Computing 28(4), 1364–1396 (1998)
Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 44–61. ACM Press, New York (1989)
Kahn, J., Saks, M., Smyth, C.: A dual version of reimer’s inequality and a proof of rudich’s conjecture. In: COCO ’00: Proceedings of the 15th Annual IEEE Conference on Computational Complexity, p. 98. IEEE Computer Society Press, Los Alamitos (2000)
Kim, J H, Simon, D.R., Tetali, P.: Limits on the efficiency of one-way permutation-based hash functions. In: 40th Annual Symposium on Foundations of Computer Science, pp. 535–542. IEEE Computer Society Press, Los Alamitos (1999)
Levin, L.A.: One-way functions and pseudorandom generators. In: ACM Symposium on Theory of Computing (STOC ’85), Baltimore, USA, May 1985, pp. 363–365. ACM Press, New York (1985)
Lindell: A simpler construction of CCA2-secure public-key encryption under general assumptions. In: Biham, E. (ed.) Advances in Cryptology – EUROCRPYT 2003. LNCS, vol. 2656, Springer, Heidelberg (2003)
Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing 17, 373–386 (1988)
Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: Awerbuch, B. (ed.) Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, Baltimore, MY, May 1990, pp. 427–437. ACM Press, New York (1990)
Pass, R., Shelat, A., Vaikuntanathan, V.: Construction of a non-malleable encryption scheme from any semantically secure one. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, Springer, Heidelberg (2006)
Rackoff, C., Simon, D R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 433–444. Springer, Heidelberg (1992)
Reingold, O., Trevisan, L., Vadhan, S P: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 1–20. Springer, Heidelberg (2004)
Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Awerbuch, B. (ed.) Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, Baltimore, MY, May 1990, pp. 387–394. ACM Press, New York (1990)
Rudich, S.: The use of interaction in public cryptosystems (extended abstract). In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 242–251. Springer, Heidelberg (1992)
Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: 40th Annual Symposium on Foundations of Computer Science, pp. 543–553. IEEE Computer Society Press, Los Alamitos (1999)
Simon, D.R.: Finding collisions on a one-way street: Can secure hash functions be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 334–345. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Gertner, Y., Malkin, T., Myers, S. (2007). Towards a Separation of Semantic and CCA Security for Public Key Encryption. In: Vadhan, S.P. (eds) Theory of Cryptography. TCC 2007. Lecture Notes in Computer Science, vol 4392. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70936-7_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-70936-7_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70935-0
Online ISBN: 978-3-540-70936-7
eBook Packages: Computer ScienceComputer Science (R0)