Ronald Cramer, Victor Shoup  Home/Search
Context Related
Links: ACM | shoup.net/papers/cca2.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: shoup.net/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A new public key encryption scheme, along with several variants, is proposed and analyzed. The scheme and its variants are quite practical, and are proved secure against adaptive chosen ciphertext attack under standard intractability assumptions. These appear to be the first public-key encryption schemes in the literature that are simultaneously practical and provably secure. (Update)
Cited by: More
Code-Based Game-Playing Proofs and the Security of Triple.. - Bellare, Rogaway (2006) (Correct)
Identity Based Key Encapsulation with Wildcards - James Birkett Alexander (Correct)
A Note on Bounded Chosen Ciphertext Security from.. - Cramer, Hofheinz, Kiltz (2006) (Correct)
Similar documents (at the sentence level):
73.1%: Design and Analysis of Practical Public-Key Encryption Schemes .. - Cramer, Shoup (2001) (Correct)
Active bibliography (related documents): More All
0.5: A Practical Public Key Cryptosystem Provably Secure against.. - Cramer, Shoup (1998) (Correct)
0.5: ACE: The Advanced Cryptographic Engine - Schweinberger, Shoup (2000) (Correct)
0.5: Signature Schemes Based on the Strong RSA Assumption - Cramer, Shoup (1999) (Correct)
Similar documents based on text: More All
2.5: Universal Hash Proofs and a Paradigm for Adaptive Chosen.. - Cramer, Shoup (2001) (Correct)
1.8: OAEP Reconsidered - Shoup (2000) (Correct)
1.7: Using Hash Functions as a Hedge against Chosen Ciphertext Attack - Shoup (2000) (Correct)
Related documents from co-citation: More All
17: Random Oracles are Practical: a Paradigm for Designing Efficient Protocols - Bellare, Rogaway - 1993
16: A proposal for an ISO standard for public key encryption - Shoup
13: Using hash functions as a hedge against chosen ciphertext attack - Shoup - 2000
BibTeX entry: (Update)
Cramer, R., and Shoup, V. Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. Manuscript, http://shoup.net/papers/, 2001. http://citeseer.ist.psu.edu/article/cramer01design.html More
@techreport{ cramer01design,
author = "Ronald Cramer and Victor Shoup",
title = "Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack",
number = "2001/108",
year = "2001",
url = "citeseer.ist.psu.edu/article/cramer01design.html" }
Citations (may not include all citations):659 Random oracles are practical: a paradigm for designing ecien.. - Bellare, Rogaway - 1993
635 New directions in cryptography - Die, Hellman - 1976 ACM
601 A public key cryptosystem and signature scheme based on disc.. (context) - ElGamal - 1985
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
326 Non-malleable cryptography - Dolev, Dwork et al. - 1991 ACM
326 Non-malleable cryptography - Dolev, Dwork et al. - 2000 ACM
260 Relations among notions of security for public-key encryptio.. (context) - Bellare, Desai et al. - 1998 ACM DBLP
254 A practical public key cryptosystem provably secure against .. - Cramer, Shoup - 1998 ACM DBLP
208 Universal one-way hash functions and their cryptographic app.. - Naor, Yung - 1989 ACM DBLP
189 Universally composable security: a new paradigm for cryptogr.. - Canetti DBLP
177 Public-key cryptosystems provably secure against chosen ciph.. - Naor, Yung - 1990 ACM DBLP
165 Optimal asymmetric encryption - Bellare, Rogaway - 1994 DBLP
162 Public-key cryptosystems based on composite degree residuosi.. - Paillier - 1999 DBLP
149 A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989 ACM DBLP
131 Optimistic fair exchange of digital signatures - Asokan, Shoup et al. - 2000
122 How to recycle random bits - Impagliazzo, Zuckermann - 1989 DBLP
119 Elliptic Curves in Cryptography - Blake, Seroussi et al. - 1999 ACM
116 Algorithmic Number Theory (context) - Bach, Shallit - 1996 ACM
114 Noninteractive zero-knowledge proof of knowledge and chosen .. (context) - Racko, Simon - 1991
92 Signature schemes based on the strong RSA assumption - Cramer, Shoup - 2000 ACM DBLP
89 Fast exponentiation with precomputation (context) - Brickell, Gordon et al. - 1992
87 The Decision Die-Hellman Problem (context) - Boneh - 1998
82 On formal models for secure key exchange - Shoup
72 OAEP reconsidered - Shoup ACM DBLP
65 Securing threshold cryptosystems against chosen ciphertext a.. - Shoup, Gennaro - 1998 DBLP
65 Number-theoretic constructions of ecient pseudo-random funct.. - Naor, Reingold - 1997
65 RSA-OAEP is secure under the RSA assumption - Fujisaki, Okamoto et al. ACM DBLP
59 The gap-problems: a new class of problems for the security o.. (context) - Okamoto, Pointcheval DBLP
50 Separating Decision Die-Hellman from Die-Hellman in cryptogr.. - Joux, Nguyen
48 Universal hash proofs and a paradigm for adaptive chosen cip.. - Cramer, Shoup
48 The discrete logarithm problem on elliptic curves of trace o.. - Smart - 1999 DBLP
48 line electronic cash system based on the representation prob.. (context) - Brands - 1993
45 Collision-resistant hashing: towards making UOWHFs practical (context) - Bellare, Rogaway - 1997 DBLP
40 Public-key encryption in a multi-user setting: security proo.. (context) - Bellare, Boldyreva et al. DBLP
39 Using hash functions as a hedge against chosen ciphertext at.. - Shoup DBLP
30 A pseudo-random generator from any one-way function (context) - astad, Impagliazzo et al. - 1999
28 The random oracle model (context) - Canetti, Goldreich et al. - 1998
27 Practical approaches to attaining security against adaptivel.. - Zheng, Seberry - 1992
26 Publicly veriable secret sharing - Stadler - 1996
20 Another method for attaining security against adaptively cho.. - Lim, Lee - 1993 ACM DBLP
19 A composition theorem for universal one-way hash functions - Shoup DBLP
17 Handbook of Applied Cryptography (context) - Menesez, van Oorschot et al. - 1997 ACM
13 More exible exponentiation with precomputation (context) - Lim, Lee - 1994
12 National Institute of Standards and Technology (context) - standard - 1995
12 Simplied OAEP for the RSA and Rabin functions (context) - Boneh
12 An ecient threshold public key cryptosystem secure against a.. (context) - Canetti, Goldwasser - 1999
11 Method for message authentication from non-malleable cryptos.. (context) - Dwork, Naor - 1996
11 Cryptanalysis of immunized LL public key systems - Frankel, Yung - 1995
10 A heuristic asymptotic formula concerning the distribution o.. (context) - Bateman, Horn - 1962
8 Towards practical public key cryptosystems secure against ch.. (context) - Damg - 1991
6 Primes represented by irreducible polynomials in one variabl.. (context) - Bateman, Horn - 1965
6 DHAES: an encryption scheme based on the Die-Hellma problem (context) - Abdalla, Bellare et al.
6 One-way functions are necessary and sucient for digital sign.. (context) - Rompel - 1990
5 Pseudo-random number generation from any one-way function (context) - Impagliazzo, Levin et al. - 1989
3 The Die-Hellman protocol (context) - Maurer, Wolf - 2000
3 The oracle Die-Hellman assumptions and an analysis of DHIES (context) - Abdalla, Bellare et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.shoup.net/papers/): More
Practical Threshold Signatures - Shoup (1999) (Correct)
Session Key Distribution Using Smart Cards - Shoup, Rubin (1996) (Correct)
Primality Testing with Fewer Random Bits - Peralta, Shoup (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