Practical Approaches to Attaining Security against Adaptively Chosen Ciphertext Attacks

作者: Yuliang Zheng , Jennifer Seberry

DOI: 10.1007/3-540-48071-4_20

关键词:

摘要: 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 attack, attacker can query the deciphering algorithm with any ciphertexts, except exact object to be cryptanalyzed. The first method is based on use of one-way hash functions, second universal functions and third digital signature schemes. Each illustrated by example cryptosystem intractability computing discrete logarithms finite fields. Two other issues, namely applications intractable problems enhancement information authentication capability cryptosystems, are also discussed.

参考文章(24)
Ivan Damgård, Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks international cryptology conference. pp. 445- 456 ,(1991) , 10.1007/3-540-46766-1_36
Manuel Blum, Shafi Goldwasser, An efficient probabilistic public key encryption scheme which hides all partial information international cryptology conference. pp. 289- 302 ,(1985) , 10.1007/3-540-39568-7_23
René Peralta, Simultaneous security of bits in the discrete log theory and application of cryptographic techniques. pp. 62- 72 ,(1986) , 10.1007/3-540-39805-8_8
Charles Rackoff, Daniel R. Simon, Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack international cryptology conference. pp. 433- 444 ,(1991) , 10.1007/3-540-46766-1_35
B. A. LaMacchia, A. M. Odlyzko, Computation of discrete logarithms in prime fields conference on theory and application of cryptography. ,vol. 1, pp. 47- 62 ,(1991) , 10.1007/BF00123958
S. Pohlig, M. Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) IEEE Transactions on Information Theory. ,vol. 24, pp. 106- 110 ,(1978) , 10.1109/TIT.1978.1055817
Mark N. Wegman, J.Lawrence Carter, New hash functions and their use in authentication and set equality Journal of Computer and System Sciences. ,vol. 22, pp. 265- 279 ,(1981) , 10.1016/0022-0000(81)90033-7
S. Micali, C. P. Schnorr, Efficient, perfect polynomial random number generators Journal of Cryptology. ,vol. 3, pp. 157- 172 ,(1991) , 10.1007/BF00196909
Neal Koblitz, Elliptic curve cryptosystems Mathematics of Computation. ,vol. 48, pp. 203- 209 ,(1987) , 10.1090/S0025-5718-1987-0866109-5
G.J. Simmons, A survey of information authentication Proceedings of the IEEE. ,vol. 76, pp. 603- 620 ,(1988) , 10.1109/5.4445