Skip to main content

A Remedy of Zhu-Lee-Deng’s Public Key Cryptosystem

  • Chapter
Progress on Cryptography

Part of the book series: The International Series in Engineering and Computer Science ((SECS,volume 769))

  • 199 Accesses

Abstract

In 1998 Cramer and Shoup published a remarkable public key encryption scheme and we mentioned that the scheme involves a large sizes of secret keys. This leaves an interesting problem whether one can reduce the key sizes of the original Cramer and Shoup’s scheme [4]. We made the first step to present a variation by defining the keys of Cramer-Shoup’s test function as c = gx and d = gy in 1999 [9]. Unfortunately, the variation scheme was subsequently broken by Borst, Preneel and Vandewalle in 2000 [2]. Lucky enough, we are able to provide a remedy of Zhu-Lee-Deng’s scheme in this short paper.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. F. Bao. Robert. H. Deng, H. Zhu. Variations of Diffie-Hellman problem. ICICS 2003, Springer-Verlag, 2003.

    Google Scholar 

  2. J. Borst, B. Preneel, J. Vandewalle. Comments on Variation of Cramer-Shoup public key scheme. Electronics Letters. Page(s): 32. Volume: 36, Issue: 1, Year: 6 Jan 2000.

    Article  Google Scholar 

  3. M. Bellare and P. Rogaway: Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. ACM Conference on Computer and Communications Security 1993: 62–73.

    Google Scholar 

  4. R. Cramer and V. Shoup. A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. In Crypto’ 98, LNCS 1462, pages 13–25, Springer-Verlag, Berlin, 1998.

    Google Scholar 

  5. D. Dolev, C. Dwork, M. Naor: Nonmalleable Cryptography. SIAM J. Comput. 30(2): 391–437 (2000)

    Article  MathSciNet  Google Scholar 

  6. S. Goldwasser, S. Micali. Probabilistic encryption. Journal of computer system and science. Vol.28, 270–299, 1984.

    MathSciNet  Google Scholar 

  7. M. Naor, M. Yung. Public key cryptosystem secure against chosen cipher-text attacks. 22nd Annual ACM Symposium on the theory of computing, 1990, 427–437.

    Google Scholar 

  8. C. Rackoff, D. Simon. Non-interactive zero-knowledge proof of knowledge and chosen cipher-text attacks. Cryptology-Crypto’91. 433–444, Springer-Verlag, 1992.

    Google Scholar 

  9. H. Zhu; Lee Chan; X. Deng. Variation of Cramer-Shoup public key scheme, Page(s): 1150, Electronics Letters Volume: 35, Issue: 14, Year: 8 Jul 1999.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Kluwer Academic Publishers

About this chapter

Cite this chapter

Zhu, H., Liao, Y. (2004). A Remedy of Zhu-Lee-Deng’s Public Key Cryptosystem. In: Chen, K. (eds) Progress on Cryptography. The International Series in Engineering and Computer Science, vol 769. Springer, Boston, MA. https://doi.org/10.1007/1-4020-7987-7_26

Download citation

  • DOI: https://doi.org/10.1007/1-4020-7987-7_26

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4020-7986-3

  • Online ISBN: 978-1-4020-7987-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics