Ronald Cramer, Victor Shoup  Home/Search
Context Related
Links: ACM DBLP | inf.ethz.ch/personal/cramer/pap...cs.ps wisc.edu/~shoup/papers/cs.ps.Z shoup.net/papers/cs.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: inf.ethz.ch/personal/cramer/ (more) From: shoup.net/papers/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A new public key cryptosystem is proposed and analyzed. The scheme is quite practical, and is provably secure against adaptive chosen ciphertext attack under standard intractability assumptions. There appears to be no previous cryptosystem in the literature that enjoys both of these properties simultaneously. (Update)
Cited by: More
Earlier versions of of this work appear in [9] and [1].. - Dhies An Encryption (Correct)
A Note on Bounded Chosen Ciphertext Security from.. - Cramer, Hofheinz, Kiltz (2006) (Correct)
A Generic Construction of CCA-Secure Cryptosystems without .. - Goichiro Hanaoka And (Correct)
Similar documents (at the sentence level):
22.7%: A Practical Public Key Cryptosystem Provably Secure against.. - Cramer, Shoup (1998) (Correct)
7.5%: Design and Analysis of Practical Public-Key Encryption Schemes .. - Cramer, Shoup (2001) (Correct)
Active bibliography (related documents): More All
0.5: Why Chosen Ciphertext Security Matters - Shoup (1998) (Correct)
0.3: A Proposal for an ISO Standard for Public Key Encryption (version.. - Shoup (2001) (Correct)
0.3: A Proposal for an ISO Standard for Public Key Encryption - Shoup (2001) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
1.5: A New Public Key Encryption Scheme Provably Secure Against Adaptive .. - Zhu (2002) (Correct)
1.4: Securing Threshold Cryptosystems against Chosen Ciphertext Attack - Shoup, Gennaro (1997) (Correct)
1.3: A Variant of the Cramer-Shoup Cryptosystem for Groups of Unknown.. - Lucks (2002) (Correct)
Related documents from co-citation: More All
61: Non-malleable cryptography - Dolev, Dwork et al. - 1991
46: Relations Among Notions of Security for Public-Key Encryption Schemes (context) - Bellare, Desai et al. - 1998
39: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols - Bellare, Rogaway - 1993
BibTeX entry: (Update)
R. Cramer and V. Shoup, "A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack", Advances in Cryptology - CRYPTO'98 Proceedings, Lecture Notes in Computer Science Vol. 1462, H. Krawczyk, ed., Springer-Verlag, 1998, pp. 13--25. http://citeseer.ist.psu.edu/article/cramer98practical.html More
@article{ cramer98practical,
author = "Ronald Cramer and Victor Shoup",
title = "A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack",
journal = "Lecture Notes in Computer Science",
volume = "1462",
pages = "13--??",
year = "1998",
url = "citeseer.ist.psu.edu/article/cramer98practical.html" }
Citations (may not include all citations):659 Random oracles are practical: a paradigm for designing effic.. - Bellare, Rogaway - 1993 DBLP
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
326 Non-malleable cryptography - Dolev, Dwork et al. - 1991 ACM
208 Universal one-way hash functions and their cryptographic app.. - Naor, Yung - 1989 ACM DBLP
186 A public key cryptosystem and signature scheme based on disc.. (context) - Gamal - 1985
177 Public-key cryptosystems provably secure against chosen ciph.. - Naor, Yung - 1990 ACM DBLP
165 Optimal asymmetric encryption - Bellare, Rogaway - 1994 DBLP
131 Optimistic fair exchange of digital signatures - Asokan, Shoup et al. - 1998
124 Lower bounds for discrete logarithms and related problems - Shoup - 1997 DBLP
120 A modular approach to the design and analysis of authenticat.. (context) - Bellare, Canetti et al. - 1998
114 Noninteractive zero-knowledge proof of knowledge and chosen .. (context) - Rackoff, Simon - 1991
65 Securing threshold cryptosystems against chosen ciphertext a.. - Shoup, Gennaro - 1998 DBLP
55 Number-theoretic constructions of efficient pseudo-random fu.. - Naor, Reingold - 1997 ACM DBLP
55 Hardness of computing the most significant bits of secret ke.. (context) - Boneh, Venkatesan - 1996 ACM DBLP
45 Collision-resistant hashing: towards making UOWHFs practical (context) - Bellare, Rogaway - 1997 DBLP
28 The random oracle model (context) - Canetti, Goldreich et al. - 1998
27 Practical approaches to attaining security against adaptivel.. - Zheng, Seberry - 1992
20 Another method for attaining security against adaptively cho.. - Lim, Lee - 1993 ACM DBLP
11 Method for message authentication from nonmalleable cryptosy.. (context) - Dwork, Naor - 1996
11 Publicly verifiable secrete sharing (context) - Stadler - 1996
11 Cryptanalysis of immunized LL public key systems - Frankel, Yung - 1995
8 Towards practical public key cryptosystems secure against ch.. (context) - Damgard - 1991
5 Pseudo-random number generation from any one-way function (context) - Impagliazzo, Levin et al. - 1989
3 full length version of STOC paper (context) - Dolev, Dwork et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.inf.ethz.ch/personal/cramer/): More
Proofs of Partial Knowledge and Simplified Design of.. - Cramer, Damgård.. (1995) (Correct)
New Generation of Secure and Practical RSA-based Signatures - Cramer, Damgård (1996) (Correct)
Signature Schemes Based on the Strong RSA Assumption - Cramer, Shoup (1998) (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