Skip to main content

The Analysis of Zheng-Seberry Scheme

  • Conference paper
  • First Online:
Book cover Information Security and Privacy (ACISP 2002)

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

Included in the following conference series:

Abstract

The Zheng-Seberry (ZS) encryption scheme was published in 1993 and was one of the first practical schemes that was considered secure against a chosen ciphertext adversary. This paper shows some problems that the semantic security of the one-way hash variant of the ZS scheme is insecure on some special circumstances. Attempts to modify the ZS scheme resulted on an El-Gamal variant that is provably secure in the random oracle model.

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

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. M. Bellare, A. Desai, D. Pointcheval and P. Rogaway, Relations among notions of security for public-key encryption schemes CRYPTO’98. LNCS 1462, pg 26–45. Springer-Verlag, California, 1998.

    Google Scholar 

  2. M. Bellare and P. Rogaway, Optimal asymmetric encryption-how to encrypt with RSA EUROCRYTP’94. LNCS 950, pg 92–111. Springer-Verlag, 1994.

    Google Scholar 

  3. D. Boneh, The decision Diffie-Hellman problem, Third Algorithmic Number Theory Symposium (ANTS)LNCS 1423, Springer-Verlag, 1998..

    Google Scholar 

  4. R. Cramer and V. Shoup, A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack, CRYPTO’98. LNCS 1462, pg 13–25. Springer-Verlag, California, 1998.

    Google Scholar 

  5. T. El Gamal, A public key cryptosystem and signature schme based on discrete logarithms, IEEE Trans. Inform. Theory, 31:469–472, 1985.

    Article  MathSciNet  MATH  Google Scholar 

  6. V. Shoup, Using hash functions as a hedge against chosen ciphertext attack EUROCRYPT’00. LNCS 1807, pg 275–288. Springer-Verlag, 2000.

    Google Scholar 

  7. Y. Tsiounis and M. Yung, ”On the security of El-Gamal based encryption, PKC’98. LNCS 1431, Spinger-Verlag, Japan, 1998.

    Google Scholar 

  8. Y. Zheng, Improved public key crypto systems secure against chosen ciphertext attacks, Technical Report 94-1, University of Wollongong, 1994.

    Google Scholar 

  9. Y. Zheng and J. Seberry, Immunizing public key cryptosystems against chosen ciphertext attacks, IEEE Journal on Selected Areas in Communications, 1993. 11(5): p. 715–724.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Soldera, D., Seberry, J., Qu, C. (2002). The Analysis of Zheng-Seberry Scheme. In: Batten, L., Seberry, J. (eds) Information Security and Privacy. ACISP 2002. Lecture Notes in Computer Science, vol 2384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45450-0_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45450-0_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43861-8

  • Online ISBN: 978-3-540-45450-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics