Skip to main content
placeholder image

Immunizing Public Key Cryptosystems Against Chosen Ciphertext Attacks

Journal Article


Abstract


  • This paper presents three methods for strengthening public key cryptosystems in such a way that they become secure against adaptively chosen ciphertext attacks. In an adaptively chosen ciphertext attack, an attacker can query the deciphering algorithm with any ciphertexts, except for the exact object ciphertext to be cryptanalyzed. The first strengthening method is based on the use of one-way hash functions, the second on the use of universal hash functions, and the third on the use of digital signature schemes. Each method is illustrated by an example of a public key cryptosystem based on the intractability of computing discrete logarithms in finite fields. Security of the three example cryptosystems is formally proved. Two other issues, namely, applications of the methods to public key cryptosystems based on other intractable problems and enhancement of information authentication capability to the cryptosystems, are also discussed. © 1993 IEEE

Publication Date


  • 1993

Citation


  • Zheng, Y., & Seberry, J. (1993). Immunizing Public Key Cryptosystems Against Chosen Ciphertext Attacks. IEEE Journal on Selected Areas in Communications, 11(5), 715-724. doi:10.1109/49.223871

Scopus Eid


  • 2-s2.0-0027614629

Web Of Science Accession Number


Start Page


  • 715

End Page


  • 724

Volume


  • 11

Issue


  • 5

Abstract


  • This paper presents three methods for strengthening public key cryptosystems in such a way that they become secure against adaptively chosen ciphertext attacks. In an adaptively chosen ciphertext attack, an attacker can query the deciphering algorithm with any ciphertexts, except for the exact object ciphertext to be cryptanalyzed. The first strengthening method is based on the use of one-way hash functions, the second on the use of universal hash functions, and the third on the use of digital signature schemes. Each method is illustrated by an example of a public key cryptosystem based on the intractability of computing discrete logarithms in finite fields. Security of the three example cryptosystems is formally proved. Two other issues, namely, applications of the methods to public key cryptosystems based on other intractable problems and enhancement of information authentication capability to the cryptosystems, are also discussed. © 1993 IEEE

Publication Date


  • 1993

Citation


  • Zheng, Y., & Seberry, J. (1993). Immunizing Public Key Cryptosystems Against Chosen Ciphertext Attacks. IEEE Journal on Selected Areas in Communications, 11(5), 715-724. doi:10.1109/49.223871

Scopus Eid


  • 2-s2.0-0027614629

Web Of Science Accession Number


Start Page


  • 715

End Page


  • 724

Volume


  • 11

Issue


  • 5