See this document in CiteSeerX!

Immunizing Public Key Cryptosystems  (Make Corrections)  
against Chosen Ciphertext Attacks Yuliang Zheng Jennifer Seberry Centre for...



  Home/Search   Context   Related

 
View or download:
uncc.edu/~yzheng/papers...jsac115.ps.Z
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  uncc.edu/~yzheng/papers/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

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... (Update)

Similar documents (at the sentence level):
45.7%:   Practical Approaches to Attaining Security against Adaptively .. - Zheng, Seberry (1992)   (Correct)

Active bibliography (related documents):   More   All
1.6:   Immunizing Public Key Cryptosystems against Chosen Ciphertext.. - Zheng, Seberry (1993)   (Correct)
0.8:   Another Method for Attaining Security Against Adaptively Chosen.. - Lim, Lee (1993)   (Correct)
0.4:   A Practical Digital Multisignature Scheme Based on Discrete.. - Hardjono, al. (1993)   (Correct)

Similar documents based on text:   More   All
0.5:   Improved Public Key Cryptosystems Secure against Chosen.. - Yuliang Zheng The (1994)   (Correct)
0.3:   Nonlinearity and Propagation Characteristics of Balanced.. - Seberry, Zhang, Zheng (1995)   (Correct)
0.3:   Systematic Generation of Cryptographically Robust S-boxes - Seberry, Zhang, Zheng (1993)   (Correct)

BibTeX entry:   (Update)

@misc{ ciphertext-immunizing,
  author = "Against Chosen Ciphertext",
  title = "Immunizing Public Key Cryptosystems",
  url = "citeseer.ist.psu.edu/641800.html" }
Citations (may not include all citations):
635   New directions in cryptography - Diffie, Hellman - 1976
601   A public key cryptosystem and a signature scheme based on di.. (context) - ElGamal - 1985
501   A digital signature scheme secure against adaptively chosen .. - Goldwasser, Micali et al. - 1988
358   Universal classes of hash functions (context) - Carter, Wegman - 1979
334   How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984
326   Non-malleable cryptography - Dolev, Dwork et al. - 1991
278   Probabilistic encryption (context) - Goldwasser, Micali - 1984
257   Elliptic curve cryptosystems (context) - Koblitz - 1987
241   Communication theory of secrecy systems (context) - Shannon - 1949
191   New hash functions and their use in authentication and set e.. (context) - Wegman, Carter - 1981
177   Public-key cryptosystems provably secure against chosen ciph.. - Naor, Yung - 1990
168   An improved algorithm for computing logarithms over GF (p) a.. (context) - Pohlig, Hellman - 1978
114   Non-interactive zero-knowledge proof of knowledge and chosen.. (context) - Rackoff, Simon - 1992
78   Hyperelliptic cryptosystems (context) - Koblitz - 1989
63   An efficient probabilistic public key encryption scheme whic.. (context) - Blum, Goldwasser - 1985
55   The notion of security for probabilistic cryptosystems (context) - Micali, Rackoff et al. - 1988
48   A survey of information authentication (context) - Simmons - 1988
40   Computation of discrete logarithms in prime fields - LaMacchia, Odlyzko - 1991
22   Digitalized signatures as intractable as factorization (context) - Rabin - 1979
14   Simultaneous security of bits in the discrete log (context) - Peralta - 1985
14   Non-interactive zero-knowledge proof systems and application.. (context) - Blum, Feldman et al. - 1988
11   Towards practical public key systems secure against chosen c.. (context) - Damgard - 1992
11   Combinatorial techniques for universal hashing (context) - Stinson - 1990
8   Cryptography (context) - Rivest - 1990
7   The discrete logarithm hides O(log n) bits (context) - Long, Wigderson - 1988
4   A practical non-malleable public key cryptosystem (context) - Zheng, Hardjono et al. - 1991
4   Theory and applications of trapdoor functions (extended abst.. (context) - Yao - 1982
3   Efficient, perfect polynomial random number generators (context) - Micali, Schnorr - 1991

Documents on the same site (http://www.sis.uncc.edu/~yzheng/papers/):   More
Structures of Cryptographic Functions with Strong.. - Seberry, Zhang, Zheng (1994)   (Correct)
Sibling Intractable Function Families and Their.. - Zheng, Hardjono.. (1992)   (Correct)
Signcryption and Its Applications in Efficient Public Key Solutions - Zheng (1997)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC