Abstract
Practical approaches to constructing public key cryptosystems secure against chosen ciphertext attacks were first initiated by Damgard and further extended by Zheng and Seberry. In this paper we first point out that in some cryptosystems proposed by Zheng and Seberry the method for adding authentication capability may fail just under known plaintext attacks. Next, we present a new method for immunizing public key cryptosystems against adaptively chosen ciphertext attacks. In the proposed immunization method, the deciphering algorithm first checks that the ciphertext is legitimate and then outputs the matching plaintext only when the check is successful. This is in contrast with the Zheng and Seberry’s methods, where the deciphering algorithm first recovers the plaintext and then outputs it only when the checking condition on it is satisfied. Such a ciphertext-based validity check will be particularly useful for an application to group-oriented cryptosystems, where almost all deciphering operations are performed by third parties, not by the actual receiver.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
W. Alexi, B. Chor, O. Goldreich and C.P. Schnorr, RSA and Rabin functions: certain parts are as hard as the whole, SIAM J. Computing vol.17 no.2 (1988), 194–208.
L. Blum, M. Blum and M. Shub, A simple unpredictable pseudo-random number generator, SIAM J. Computing vol.15 no. 2 (1986), 364–383.
M. Blum, P. Feldman and S. Micali, Non-interactive zero-knowledge proof systems and applications, Proc. 20th Annual ACM Symposium on Theory of Computing (STOC) (1988), 103–112.
M. Blum and S. Goldwasser, An efficient probabilistic public key encryption scheme which hides all partial information, Advances in Cryptology-Crypto’84, Lecture Notes in Computer Science vol.196, Springer-Verlag (1985), 289–299.
M. Blum and S. Micali, How to generate crypto graphically strong sequences of pseudo-random bits, SIAM J. Computing vol.13 no.4 (1984), 850–864.
J. Carter and M. Wegman, Universal classes of hash functions, J. Computer and System Sciences vol.18 (1979), 143–154.
I. Damgard, Towards practical public key systems secure against chosen ciphertext attacks, Advances in Cryptology-Crypto’91, LNCS vol.576, Springer-Verlag (1992), 445–456.
Y. Desmedt, Society and group oriented cryptography: a new concept, Advances in Cryptology-Crypto’87, LNCS vol.293, Springer-Verlag (1988), 120–127.
Z. Galil, S. Haber and M. Yung, Symmetric public key cryptosystems, submitted to J. Cryptology.
S. Goldwasser and S. Micali, Probabilistic encryption, J. Computer and System Sciences vol.28 no.2 (1984), 270–299.
R.R. Jueneman, S.M. Matyas and C.H. Meyer, Message authentication with manipulation detection codes, Proc. 1983 Symposium on Security and Privacy, IEEE Computer Society Press, 33–54.
D.L. Long and A. Wigderson, The discrete logarithm hides O(log n) bits, SIAM J. Computing vol.17 no.2 (1988), 363–372.
S. Micali, C. Rackoff and B. Sloan, The notion of security for probabilistic cryptosystems, SIAM J. Computing vol.17 no.2 (1988), 412–426.
S. Micali and C.P. Schnorr, Efficient, perfect polynomial random number generators, J. Cryptology vol.3 no.3 (1991), 157–172.
C. Mitchell, M. Walker and D. Rush, CCITT/ISO standard for secure message handling, IEEE J. Selected Areas on Commun. vol.7 no.4 (1989), 517–524.
M. Naor and M. Yung, Public key cryptosystems provably secure against chosen ciphertext attacks, Proc. 22th Annual ACM Symposium on Theory of Computing (STOC) (1990), 427–437.
R. Peralta, Simultaneous security of bits in the discrete log, Advances in Cryptology-Eurocrypt’85, LNCS vol.219, Springer-Verlag (1986), 62–72.
C. Rackoff and D. Simon, Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attacks, Advances in Cryptology-Crypto’91, LNCS vol.576, Springer-Verlag (1992), 433–444.
C.P. Schnorr, Efficient signature generation by smart cards, J. Cryptology vol.4 no.3 (1991), 161–174.
A proposed federal information processing standard for secure hash standard, Federal Register Announcement (Jan. 31, 1992), 3747–3749.
D.R. Stinson, Combinatorial techniques for universal hashing, submitted to J. Computer and System Sciences.
U.V. Vazirani and V.V. Vazirani, Efficient and secure pseudo-random number generation, Advances in Cryptology-Crypto’84, LNCS vol.196, Springer-Verlag (1985), 193–202.
M. Wegman and J. Carter, New hash functions and their use in authentication and set equality, J. Computer and System Sciences vol.22 (1981), 265–279.
A.C. Yao, Theory and applications of trapdoor functions, Proc. 23rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press (1982), 80–91.
Y. Zheng and J. Seberry, Practical approaches to attaining security against adoptively chosen ciphertext attacks, Proc. Crypto’92.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lim, C.H., Lee, P.J. (1994). Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks. In: Stinson, D.R. (eds) Advances in Cryptology — CRYPTO’ 93. CRYPTO 1993. Lecture Notes in Computer Science, vol 773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48329-2_36
Download citation
DOI: https://doi.org/10.1007/3-540-48329-2_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57766-9
Online ISBN: 978-3-540-48329-8
eBook Packages: Springer Book Archive