Skip to main content
SpringerLink
Log in
Book cover

IMA International Conference on Cryptography and Coding

Cryptography and Coding 2003: Cryptography and Coding pp 152–166Cite as

A General Construction of IND-CCA2 Secure Public Key Encryption

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2898))

Abstract

We propose a general construction for public key encryption schemes that are IND-CCA2 secure in the random oracle model. We show that the scheme proposed in [1,2] fits our general framework and moreover that our method of analysis leads to a more efficient security reduction.

This work was done during a stay of the two authors at BRICS in Aarhus, Denmark. The stay was supported by the Marie-Curie fellowship scheme of the European Union. Both authors wish to thank BRICS and the EU for making this visit possible.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baek, J., Lee, B., Kim, K.: Provably secure length-saving public-key encryption scheme under the computational Diffie-Hellman assumption. Electronics and Telecommunications Research Institute (ETRI) Journal 22(4), 25–31 (2000)

    Google Scholar 

  2. Baek, J., Lee, B., Kim, K.: Secure Length-Saving El Gamal Encryption Under the Computational Diffie-Hellman Assumption. In: Clark, A., Boyd, C., Dawson, E.P. (eds.) ACISP 2000. LNCS, vol. 1841, pp. 49–58. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A Concrete Security Treatment of Symmetric Encryption. In: 38th Annual Symposium on Foundations of Computer Science, pp. 394–403. IEEE Computer Science Press, Los Alamitos (1997)

    Chapter  Google Scholar 

  4. Bellare, M., Rogaway, P.: Optimal Asymmetric Encryption - How to Encrypt with RSA. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 92–111. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  5. Bellare, M., Rogaway, P.: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In: Proceedings of the First ACM Conference on Computer and Communications Security, pp. 62–73 (1993)

    Google Scholar 

  6. Bellare, M., Rogaway, P.: The Exact Security of Digital Signatures - How to sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399–416. Springer, Heidelberg (1996)

    Google Scholar 

  7. Boneh, D.: The Decisional Diffie-Hellman Problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 48–63. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  8. Canetti, R., Goldreich, O., Halevi, S.: The Random Oracle Methodology, Revisited. In: Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing - STOC 1998, pp. 209–218. ACM, New York (1998)

    Chapter  Google Scholar 

  9. Catalano, D., Gennaro, R., Howgrave-Graham, N., Nguyen, P.Q.: Paillier’s Cryptosystem Revisited. In: Proceedings of the 8th ACM Conference on Computer and Communications Security (2001)

    Google Scholar 

  10. Catalano, D., Nguyen, P.Q., Stern, J.: The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 299–310. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

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

    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 (to appear)

    Google Scholar 

  13. Diffie, W., Hellman, M.E.: New Directions in Cryptography. IEEE Transactions on Information Theory IT-22(6), 644–654 (1976)

    Article  MathSciNet  Google Scholar 

  14. ElGamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory IT-31, 469–472 (1985)

    Article  MathSciNet  Google Scholar 

  15. 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 

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

    Article  MATH  MathSciNet  Google Scholar 

  17. Naor, M., Yung, M.: Public-key Cryptosystems Provably Secure Against Chosen Ciphertext Attack. In: Proceedings of 22nd ACM Symposium on Theory of Computing, pp. 427–437. ACM Press, New York (1990)

    Google Scholar 

  18. Pointcheval, D.: New Public Key Cryptosystems based on the Dependent-RSA Problems. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 239–254. Springer, Heidelberg (1999)

    Google Scholar 

  19. Rabin, M.O.: Digitalized signatures and public key cryptosystems as intractable as factorization. MIT/LCS/TR-212, Technical Report MIT (1979)

    Google Scholar 

  20. 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 

  21. Rivest, R.L., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21(1), 120–126 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  22. Tsiounis, Y., Yung, M.: On the Security of El Gamal Based Encryption. In: Imai, H., Zheng, Y. (eds.) PKC 1998. LNCS, vol. 1431, pp. 117–134. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl Mathematik & Informatik, Fakultät für Mathematik, Ruhr-Universität Bochum, Germany

    Eike Kiltz

  2. Department of Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, Bristol, BS8 1UB, UK

    John Malone-Lee

Authors
  1. Eike Kiltz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John Malone-Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Security Group, Royal Holloway, University of London, TW20 0EX, Egham, Surrey, U.K.

    Kenneth G. Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kiltz, E., Malone-Lee, J. (2003). A General Construction of IND-CCA2 Secure Public Key Encryption. In: Paterson, K.G. (eds) Cryptography and Coding. Cryptography and Coding 2003. Lecture Notes in Computer Science, vol 2898. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40974-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-40974-8_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20663-7

  • Online ISBN: 978-3-540-40974-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation