See this document in CiteSeerX!

Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks (1995)  (Make Corrections)  (177 citations)
Moni Naor, Moti Yung
ACM Symposium on Theory of Computing



  Home/Search   Context   Related

 
View or download:
wisdom.weizmann.ac.il/~naor...cca.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  wisdom.weizmann.ac.il/~na...onpub (more)
(Enter author homepages)

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

Abstract: We show how to construct a public-key cryptosystem (as originally defined by Diffie and Hellman) secure against chosen ciphertext attacks, given a public-key cryptosystem secure against passive eavesdropping and a non-interactive zero-knowledge proof system in the shared string model. No such secure cryptosystems were known before. Key words. cryptography, randomized algorithms AMS subject classifications. 68M10, 68Q20, 68Q22, 68R05, 68R10 A preliminary version of this paper appeared in the... (Update)

Cited by:   More
Appears in the proceedings of the First ACM Conference on.. - Random Oracles Are   (Correct)
Earlier versions of of this work appear in [9] and [1].. - Dhies An Encryption   (Correct)
Identity Based Key Encapsulation with Wildcards - James Birkett Alexander   (Correct)

Active bibliography (related documents):   More   All
1.3:   Non-Malleable Cryptography - Dolev, Dwork, Naor (2000)   (Correct)
0.5:   Public Key Cryptosystems with Partial Secrecy - Goldsmith, Klapper (1996)   (Correct)
0.3:   Encryption-Scheme Security in the Presence of.. - Black, Rogaway, Shrimpton (2002)   (Correct)

Similar documents based on text:   More   All
0.6:   Another Method for Attaining Security Against Adaptively Chosen.. - Lim, Lee (1993)   (Correct)
0.5:   Cryptanalysis of the Immunized LL Public Key Systems - Yair Frankel And (1995)   (Correct)
0.4:   Rigorous Time/Space Tradeoffs for Inverting Functions - Fiat, Naor (2000)   (Correct)

Related documents from co-citation:   More   All
83:   Non-malleable cryptography - Dolev, Dwork et al. - 1991
53:   Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
51:   Random Oracles are Practical: a Paradigm for Designing Efficient Protocols - Bellare, Rogaway - 1993

BibTeX entry:   (Update)

M. Naor and M. Yung. Public-key cryptosystems provably secure against chosen ciphertext attack. In Proceedings of the twenty second annual ACM Symp. Theory of Computing, STOC, pages 427--437, May 14--16, 1990. http://citeseer.ist.psu.edu/naor95publickey.html   More

@inproceedings{ naor90publickey,
    author = "Moni Naor and Moti Yung",
    title = "Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks",
    booktitle = "{ACM} Symposium on Theory of Computing",
    pages = "427-437",
    year = "1990",
    url = "citeseer.ist.psu.edu/naor95publickey.html" }
Citations (may not include all citations):
1529   A Method for Obtaining Digital Signature and Public Key Cryp.. - Rivest, Shamir et al. - 1978
635   New Directions in Cryptography - Diffie, Hellman - 1976  ACM
531   The Knowledge Complexity of Interactive ProofSystems (context) - Goldwasser, Micali et al. - 1989
419   How to Construct Random Functions (context) - Goldreich, Goldwasser et al. - 1986  ACM   DBLP
339   Theory and Applications of Trapdoor functions (context) - Yao - 1982
326   Non-malleable cryptography - Dolve, Dwork et al.  ACM
278   Probabilistic Encryption (context) - Goldwasser, Micali - 1984  ACM   DBLP
208   Universal One-way Hash Functions and their Cryptographic App.. - Naor, Yung - 1989  ACM   DBLP
206   Zero Knowledge Proofs of Identity (context) - Feige, Fiat et al.  ACM   DBLP
111   the Composition of Zero-knowledge Proof Systems - Goldreich, Krawczyk - 1989
99   One-way Function are Necessary and Sufficient for Signatures (context) - Rompel - 1990
95   Multiple Non-Interactive Zero-Knowledge Proofs Based on a Si.. (context) - Feige, Lapidot et al. - 1990
70   Hiding Information and Signatures in Trapdoor Knapsacks (context) - Merkle, Hellman - 1978
68   One-way Functions and Pseudo-random Generators (context) - Levin - 1987
63   An Efficient Probabilistic Public-key Encryption that Hides .. (context) - Blum, Goldwasser
56   Proofs that Yield Nothing But their Validity (context) - Goldreich, Micali et al. - 1986
51   Random Self Reducibility and Zero-knowledge Interactive Proo.. (context) - Tompa, Woll - 1987
36   Non-Interactive Zero-Knowledge Proof Systems (context) - Blum, Feldman et al. - 1988  ACM   DBLP
31   How to Sign Given Any Trapdoor Function (context) - Bellare, Micali - 1988  ACM   DBLP
29   Digital Signatures and Public Key Functions as Intractable a.. (context) - Rabin - 1979
24   A Hard Predicate for All One-way Functions (context) - Goldreich, Levin - 1989
21   Why and How to Establish a Private Code on a Public Network (context) - Goldwasser, Micali et al. - 1982
20   An efficient non-interactive zero-knowledge proof system for.. - Kilian, Petrank  DBLP
20   New Paradigms for Digital Signatures and Message Authenticat.. (context) - Bellare, Goldwasser
20   A Secure Digital Signature Scheme (context) - Goldwasser, Micali et al. - 1988
11   the complexity of bounded-interaction and non-interactive ze.. (context) - Kilian - 1994
7   Cryptoprotocols: Subscription To a Public Key (context) - Yung - 1985
5   Rabin Bits are 1=2 + 1=poly Secure (context) - Alexi, Chor et al. - 1988
5   Notions of Security of Public-Key Cryptosystems (context) - Micali, Rackoff et al. - 1988
4   Interactive Public-key Cryptosystems (context) - Galil, Haber et al.
4   Non-Interactive Zero-Knowledge (context) - Blum, De Santis et al.  ACM
3   A Uniform Complexity Encryption and Zero-knowledge (context) - Goldreich - 1989
3   Personal Communication (context) - Micali - 1990
1   Non-Interactive Zero-Knowledge Proof Systems Proc (context) - De Santis, Micali et al.
1   Proceeding of Structure in Complexity (context) - Zachos, Quantifiers et al. - 1986
1   Witness Hiding and Witness Indistinguishability (context) - Feige, Shamir - 1990



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


Documents on the same site (http://www.wisdom.weizmann.ac.il/~naor/onpub.html):   More
Deniable Encryption - Canetti, Dwork, Naor, Ostrovsky (1996)   (Correct)
Certificate Revocation and Certificate Update - Naor, Nissim (1998)   (Correct)
Verification of a human in the loop or Identification via the.. - Naor (1996)   (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