See this document in CiteSeerX!

Why Chosen Ciphertext Security Matters (1998)  (Make Corrections)  (24 citations)
Victor Shoup



  Home/Search   Context   Related

 
View or download:
ibm.com/security/publicat...Shoup98.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ibm.com/security/publicati...1998 (more)
(Enter author homepages)

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

Abstract: This article motivates the importance of public-key cryptosystems that are secure against chosen ciphertext attack, and of rigorous security proofs. It also discusses the new cryptosystem developed by Cramer and Shoup, and its relevance in this regard. (Update)

Cited by:   More
An efficient hybrid encryption in standard model - Lu (2006)   (Correct)
Revisit of chosen ciphertext secure public key encryption in.. - Lu, He, Li (2006)   (Correct)
PEKE, Probabilistic Encryption Key Exchange, 10 Years Later.. - Moreau (2005)   (Correct)

Similar documents (at the sentence level):
69.4%:   Why Chosen Ciphertext Security Matters - Shoup (1998)   (Correct)

Active bibliography (related documents):   More   All
0.4:   A Practical Public Key Cryptosystem Provably Secure against.. - Cramer, Shoup (1998)   (Correct)
0.3:   On the Security of ElGamal based Encryption - Tsiounis, Yung (1998)   (Correct)
0.3:   Securing Threshold Cryptosystems against Chosen Ciphertext Attack - Shoup, Gennaro (1999)   (Correct)

Similar documents based on text:   More   All
1.2:   Outerfaces: How to Make Less Fragile Software Than Interfaces Allow - Harrison   (Correct)
1.1:   Asynchronous Protocols for Optimistic Fair Exchange - Asokan, Shoup, Waidner (1997)   (Correct)
1.1:   Optimistic Synchronous Multi-Party Contract Signing - Asokan, Baum-Waidner.. (1998)   (Correct)

Related documents from co-citation:   More   All
14:   A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciph.. - Cramer, Shoup - 1998
13:   Random Oracles are Practical: a Paradigm for Designing Efficient Protocols - Bellare, Rogaway - 1993
13:   Non-malleable cryptography - Dolev, Dwork et al. - 1991

BibTeX entry:   (Update)

V. Shoup. Why chosen ciphertext security matters. Research Report RZ 3076 (#93122), IBM Research, Nov. 1998. http://citeseer.ist.psu.edu/shoup98why.html   More

@techreport{ shoup98why,
    author = "Victor Shoup",
    title = "Why Chosen Ciphertext Security Matters",
    number = "RZ 3076 (\#93122)",
    year = "1998",
    url = "citeseer.ist.psu.edu/shoup98why.html" }
Citations (may not include all citations):
1529   A method for obtaining digital signatures and public-key cry.. - Rivest, Shamir et al. - 1978
659   Random oracles are practical: a paradigm for designing e#cie.. - Bellare, Rogaway - 1993
635   New directions in cryptography - Di and, Hellman - 1976
404   Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
326   Non-malleable cryptography - Dolev, Dwork et al. - 1991
254   A practical public key cryptosystem provably secure against .. - Cramer, Shoup - 1998
189   Keying hash functions for message authentication - Bellare, Canetti et al. - 1996
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
165   Optimal asymmetric encryption - Bellare, Rogaway - 1994
131   Optimistic fair exchange of digital signatures - Asokan, Shoup et al. - 1998
131   Noninteractive zero-knowledge proof of knowledge and chosen .. (context) - Racko, Simon - 1991
120   A modular approach to the design and analysis of authenticat.. (context) - Bellare, Canetti et al. - 1998
119   Chosen ciphertext attacks against protocols based on the RSA.. - Bleichenbacher - 1998
67   Finding a small root of a univariate modular equation (context) - Coppersmith - 1998
65   Securing threshold cryptosystems against chosen ciphertext a.. - Shoup, Gennaro - 1998
65   Number-theoretic constructions of e#cient pseudo-random func.. - Naor, Reingold - 1997
42   Toward realizing random oracles: hash functions that hide al.. - Canetti - 1997
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
11   Cryptanalysis of immunized LL public key systems - Frankel, Yung - 1995
11   Publicly verifiable secrete sharing (context) - Stadler - 1996
8   Towards practical public key cryptosystems secure against ch.. (context) - Damgard - 1991
3   Plug and play cryptography (context) - Beaver - 1997



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.zurich.ibm.com/security/publications/1998.html):   More
Communication Complexity of Group Key Distribution - Becker (1998)   (Correct)
Quality in the Access to Information - Peiro, Quisquater (1998)   (Correct)
Communication Complexity of Group Key Distribution - Becker, Wille (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