The Analysis of Zheng-Seberry Scheme
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.
KeywordsHash Function Random Oracle Random Oracle Model Challenge Ciphertext Decryption Oracle
Unable to display preview. Download preview PDF.
- 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
- 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
- D. Boneh, The decision Diffie-Hellman problem, Third Algorithmic Number Theory Symposium (ANTS)LNCS 1423, Springer-Verlag, 1998..Google Scholar
- 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
- V. Shoup, Using hash functions as a hedge against chosen ciphertext attack EUROCRYPT’00. LNCS 1807, pg 275–288. Springer-Verlag, 2000.Google Scholar
- Y. Tsiounis and M. Yung, ”On the security of El-Gamal based encryption, PKC’98. LNCS 1431, Spinger-Verlag, Japan, 1998.Google Scholar
- Y. Zheng, Improved public key crypto systems secure against chosen ciphertext attacks, Technical Report 94-1, University of Wollongong, 1994.Google Scholar