Skip to main content
SpringerLink
Log in

On the Impossibility of Strong Encryption Over \(\aleph_0\)

  • Conference paper
Coding and Cryptology (IWCC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5557))

Included in the following conference series:

Abstract

We give two impossibility results regarding strong encryption over an infinite enumerable domain. The first one relates to statistically secure one-time encryption. The second one relates to computationally secure encryption resisting adaptive chosen ciphertext attacks in streaming mode with bounded resources: memory, time delay or output length. Curiously, both impossibility results can be achieved with either finite or continuous domains. The latter result explains why known CCA-secure cryptosystem constructions require at least two passes to decrypt a message with bounded resources.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abe, M., Gennaro, R., Kurosawa, K., Shoup, V.: Tag-KEM/DEM: A New Framework for Hybrid Encryption and a New Analysis of Kurosawa-Desmedt KEM. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 128–146. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Abe, M., Gennaro, R., Kurosawa, K.: Tag-KEM/DEM: A New Framework for Hybrid Encryption. Journal of Cryptology 21(1), 97–130 (2008); Available at IACR ePrint Archive, http://eprint.iacr.org/2005/027

    Article  MathSciNet  MATH  Google Scholar 

  3. Bellare, M., Boldyreva, A., Knudsen, L., Namprempre, C.: On-line Ciphers and the Hash-CBC Constructios. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 292–309. Springer, Heidelberg (2001), http://www-cse.ucsd.edu/users/mihir/papers/olc.html

    Chapter  Google Scholar 

  4. Boldyreva, A., Taesombut, N.: On-line Encryption Schemes: New Security Notions and Constructions. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 1–14. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Boneh, D., Katz, J.: Improved Efficiency for CCA-Secure Cryptosystems Built using Identity-based Encryption. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 87–103. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Boneh, D., Canetti, R., Halevi, S., Katz, J.: Chosen-Ciphertext Security from Identity-based Encryption. SIAM Journal of Computing 36(5), 1301–1328 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  7. Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext Security from Identity-based Encryption. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 207–222. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Canetti, R., Krawczyk, H., Nielsen, J.B.: Relaxing Chosen-Ciphertext Security. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 565–582. Springer, Heidelberg (2003); Full version available at IACR ePrint Archive, http://eprint.iacr.org/2003/174

    Chapter  Google Scholar 

  9. Chor, B., Kushilevitz, E.: Secret Sharing over Infinite Domains (Extended Abstract). In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 299–306. Springer, Heidelberg (1990)

    Google Scholar 

  10. Chor, B., Kushilevitz, E.: Secret Sharing over Infinite Domains. Journal of Cryptology 6(2), 87–95 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  11. Cramer, R., Shoup, V.: Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 13–25. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  12. Cramer, R., Shoup, V.: Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack. SIAM Journal of Computing 33(1), 167–226 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Fouque, P.-A., Joux, A., Martinet, G., Valette, F.: Authenticated On-line Encryption. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 145–159. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Fouque, P.-A., Joux, A., Poupard, G.: Blockwise Adversarial Model for On-line Ciphers and Symmetric Encryption Schemes. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol. 3357, pp. 212–226. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Fouque, P.-A., Martinet, G., Poupard, G.: Practical Symmetric On-line Encryption. In: Johansson, T. (ed.) FSE 2003. LNCS, vol. 2887, pp. 362–375. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. 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)

    Chapter  Google Scholar 

  17. Fujisaki, E., Okamoto, T.: Secure Integration of Asymmetric and Symmetric Encryption Schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 537–554. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  18. Goldwasser, S., Micali, S.: Probabilistic Encryption. Journal of Computer and System Sciences 28, 270–299 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  19. Harnik, D., Naor, M.: On Everlasting Security in the Hybrid Bounded Storage Model. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 192–203. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  20. Hofheinz, D., Kiltz, E.: Secure Hybrid Encryption from Weakened Key Encapsulation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 553–571. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  21. Joux, A., Martinet, G., Valette, F.: Blockwise-Adaptive Attackers - Revisiting the (In)Security of Some Provably Secure Encryption Modes: CBC, GEM, IACBC. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 17–30. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  22. Katz, J., Yung, M.: Complete Characterization of Security Notions for Probabilistic Private-Key Encryption. In: Proceedings of ACM Syposium on the Theory of Computing (STOC 2000), pp. 245–254. ACM Press, New York (2000)

    Google Scholar 

  23. Katz, J., Yung, M.: Complete Characterization of Security Notions for Probabilistic Private-Key Encryption. Journal of Cryptology 19(1), 67–95 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  24. Kiltz, E., Malone-Lee, J.: A General Construction of IND-CCA2 Secure Public Key Encryption. In: Paterson, K.G. (ed.) Cryptography and Coding 2003. LNCS, vol. 2898, pp. 152–166. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  25. Kiltz, E., Vahlis, Y.: CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption. In: Malkin, T.G. (ed.) CT-RSA 2008. LNCS, vol. 4964, pp. 221–238. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  26. Maurer, U.: Conditionally-Perfect Secrecy and a Provably-Secure Randomized Cipher. Journal of Cryptology 5(1), 53–66 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  27. Naor, M., Yung, M.: Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. In: Proceedings of ACM Syposium on the Theory of Computing (STOC 1990), pp. 427–437. ACM Press, New York (1990)

    Google Scholar 

  28. Rackoff, C., Simon, D.: 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)

    Google Scholar 

  29. Tarski, A.: A Decision Method for Elementary Algebra and Geometry. University of California Press, Berkeley (1951)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Loughborough Uni, U.K.

    Raphael C. -W. Phan

  2. EPFL, Switzerland

    Serge Vaudenay

Authors
  1. Raphael C. -W. Phan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Serge Vaudenay
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. National Computer Systems, Center for Information Technology,, 73 Science Park Drive, S0511, Republic of Singapore

    Yeow Meng Chee  & San Ling  & 

  2. National University of Defense Technology, 411073, Changshu Hunan, China

    Chao Li

  3. National Computer Systems, Center for Information Technology, 73 Science Park Drive, S0511, Republic of Singapore

    Huaxiong Wang  & Chaoping Xing  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Phan, R.C.W., Vaudenay, S. (2009). On the Impossibility of Strong Encryption Over \(\aleph_0\) . In: Chee, Y.M., Li, C., Ling, S., Wang, H., Xing, C. (eds) Coding and Cryptology. IWCC 2009. Lecture Notes in Computer Science, vol 5557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01877-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01877-0_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01813-8

  • Online ISBN: 978-3-642-01877-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation