(Enter summary)
Abstract: )
Yuliang Zheng and Jennifer Seberry
?
The Centre for Computer Security Research
Department of Computer Science
University of Wollongong
Locked Bag 8844, Wollongong, NSW 2521
AUSTRALIA
E-mail: fyuliang,jennieg@cs.uow.edu.au
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... (Update)
Context of citations to this paper: More
.... practical cryptosystems intended to be secure against chosen ciphertext attack were proposed by Damgard [8] Zheng and Seberry [28], and Bellare and Rogaway [2, 3] The schemes in [28, 2, 3] are all known to be chosen ciphertext secure in the random hash function...
.... above have also been proposed, including variations involving di#erent kinds of hash functions and signature schemes (see, e.g. 5] and [25]) None has been rigorously analyzed, so there may still be unforeseen attacks. One partial exception to this is the work of [5] which...
Cited by: More
Design and Analysis of Practical Public-Key Encryption Schemes .. - Cramer, Shoup (2001)
(Correct)
Security of Signed ElGamal Encryption - Schnorr, Jakobsson (1999)
(Correct)
Secure Length-saving ElGamal Encryption under the.. - Baek, Lee, Kim (2000)
(Correct)
Similar documents (at the sentence level):
74.5%: Immunizing Public Key Cryptosystems - Against Chosen Ciphertext
(Correct)
Active bibliography (related documents): More All
0.7: Immunizing Public Key Cryptosystems against Chosen Ciphertext.. - Zheng, Seberry (1993)
(Correct)
0.3: A Practical Digital Multisignature Scheme Based on Discrete.. - Hardjono, al. (1993)
(Correct)
0.3: Another Method for Attaining Security Against Adaptively Chosen.. - Lim, Lee (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: HAVAL - A One-Way Hashing Algorithm with Variable Length.. - Zheng, Pieprzyk, Seberry (1993)
(Correct)
Related documents from co-citation: More All
22: Non-malleable cryptography
- Dolev, Dwork et al. - 1991
20: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols
- Bellare, Rogaway - 1993
15: Public-key cryptosystems provably secure against chosen ciphertext attack
- Naor, Yung - 1990
BibTeX entry: (Update)
YL Zheng, J Seberry, "Practical Approaches to Attaining Security against Adaptively Chosen Ciphertext Attacks", in Abstracts of Crypto 92 pp 7-1 - 7-10 http://citeseer.ist.psu.edu/zheng92practical.html More
@article{ zheng93practical,
author = "Yuliang Zheng and Jennifer Seberry",
title = "Practical Approaches to Attaining Security against Adaptively Chosen Ciphertext Attacks (Extended Abstract)",
journal = "Lecture Notes in Computer Science",
volume = "740",
pages = "292--304",
year = "1993",
url = "citeseer.ist.psu.edu/zheng92practical.html" }
Citations (may not include all citations):
601
A public key cryptosystem and a signature scheme based on di.. (context) - ElGamal - 1985 ACM DBLP
501
A digital signature scheme secure against adaptively chosen ..
- Goldwasser, Micali et al. - 1988
428
IEEE Transactions on Information Theory (context) - Diffie, Hellman et al. - 1976
404
Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
358
Universal classes of hash functions (context) - Carter, Wegman - 1979 DBLP
334
How to generate cryptographically strong sequences of pseudo.. (context) - Blum, Micali - 1984 ACM DBLP
326
Non-malleable cryptography
- Dolev, Dwork et al. - 1991 ACM
257
Elliptic curve cryptosystems (context) - Koblitz - 1987 ACM
191
New hash functions and their use in authentication and set e.. (context) - Wegman, Carter - 1981 DBLP
177
Public-key cryptosystems provably secure against chosen ciph..
- Naor, Yung - 1990 ACM DBLP
168
An improved algorithm for computing logarithms over GF (context) - Pohlig, Hellman - 1978
114
Non-interactive zero-knowledge proof of knowledge and chosen.. (context) - Rackoff, Simon - 1992
78
Hyperelliptic cryptosystems (context) - Koblitz - 1989 ACM DBLP
63
An efficient probabilistic public key encryption scheme whic.. (context) - Blum, Goldwasser - 1985
48
A survey of information authentication (context) - Simmons - 1988
40
Computation of discrete logarithms in prime fields
- LaMacchia, Odlyzko - 1991 ACM DBLP
23
Immunizing public key cryptosystems against chosen ciphertex..
- Zheng, Seberry - 1993 DBLP
22
Digitalized signatures as intractable as factorization (context) - Rabin - 1979
14
Non-interactive zero-knowledge proof systems and application.. (context) - Blum, Feldman et al. - 1988
14
Simultaneous security of bits in the discrete log (context) - Peralta - 1985 ACM DBLP
11
Combinatorial techniques for universal hashing (context) - Stinson - 1990 ACM DBLP
11
Towards practical public key systems secure against chosen c.. (context) - Damgard - 1992 ACM DBLP
8
perfect polynomial random number generators (context) - Micali, Schnorr - 1991 ACM
7
The discrete logarithm hides O (context) - Long, Wigderson - 1988
4
A practical non-malleable public key cryptosystem (context) - Zheng, Hardjono et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cryptography.com/resources/papers/crypto92/crypto92.html):
Massively Parallel Computation of Discrete Logarithms - Gordon, McCurley (1993)
(Correct)
Wallet Databases with Observers - Extend Ed
(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