Efficient identification and signatures for smart cards
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Relations Among Notions of Security for Public-Key Encryption Schemes
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
New directions in cryptography
IEEE Transactions on Information Theory
A public key cryptosystem and a signature scheme based on discrete logarithms
IEEE Transactions on Information Theory
Immunizing public key cryptosystems against chosen ciphertext attacks
IEEE Journal on Selected Areas in Communications
| Hi-index | 7.29 |
In 1993, Zheng and Seberry proposed three methods for strengthening public key cryptosystems. These methods aimed to obtain schemes that are secure against adaptively chosen ciphertext attacks. One method was improving security by using digital signatures. Zheng and Seberry gave an example scheme that employs this method. However, they were not able to prove IND-CCA security of their cryptosystem. In this paper, we modify this cryptosystem by employing a Schnorr signature scheme and prove this new scheme to be IND-CCA secure in the random oracle model.