Amit Sahai  Home/Search
Context Related
| mit.edu/~amits/work/S99.ps 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: mit.edu/~amits/work/index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-malleability properties. We then show that the elegant encryption scheme of Naor and Yung [NY] can be made secure against the strongest form of chosen-ciphertext attack by using a non-malleable NIZK proof instead of a standard NIZK proof. Our encryption scheme is simple to describe and works in the standard... (Update)
Cited by: More
Perfect Non-Interactive Zero Knowledge for NP - Jens Groth Rafail (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)
Active bibliography (related documents): More All
1.1: Simulation-Sound Non-Interactive Zero Knowledge - Amit Sahai January (2000) (Correct)
0.3: Non-Malleable Encryption: Equivalence between Two Notions.. - Bellare, Sahai (1999) (Correct)
0.2: Non-Malleable Cryptography - Dolev, Dwork, Naor (1998) (Correct)
Similar documents based on text: More All
1.2: A Unified Methodology For Constructing Public-Key Encryption.. - Elkind, Sahai (2002) (Correct)
0.6: A Simpler Construction of CCA2-Secure Public-Key Encryption Under .. - Lindell (2002) (Correct)
0.6: Robust Non-Interactive Zero Knowledge - de Santis, di Crescenzo.. (2001) (Correct)
Related documents from co-citation: More All
31: Non-malleable cryptography - Dolev, Dwork et al. - 1991
30: Public-key cryptosystems provably secure against chosen ciphertext attack - Naor, Yung - 1990
25: A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciph.. - Cramer, Shoup - 1998
BibTeX entry: (Update)
Amit Sahai. Non-malleable non-interactive zero-knowledge and adaptive chosen-ciphertext security. In 40th Annual Symposium on Foundations of Computer Science, New York, October 1999. IEEE. http://citeseer.ist.psu.edu/sahai99nonmalleable.html More
@inproceedings{ sahai99nonmalleable,
author = "Amit Sahai",
title = "Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "543-553",
year = "1999",
url = "citeseer.ist.psu.edu/sahai99nonmalleable.html" }
Citations (may not include all citations):659 Random oracles are practical: a paradigm for designing effic.. - BELLARE, ROGAWAY - 1993
531 The knowledge complexity of interactive proof systems (context) - GOLDWASSER, MICALI et al. - 1989
404 Journal of Computer and System Sciences (context) - GOLDWASSER, MICALI et al. - 1984
260 Relations among notions of security for public-key encryptio.. (context) - BELLARE, DESAI et al. - 1998
254 A practical public key cryptosystem provably secure against .. - CRAMER, SHOUP - 1998
177 Public-key cryptosystems provably secure against chosen ciph.. - NAOR, YUNG - 1990
120 A modular approach to the design and analysis of authenticat.. (context) - BELLARE, CANETTI et al. - 1998
118 Optimal asymmetric encryption -- How to encrypt with RSA (context) - BELLARE, ROGAWAY - 1994
114 Non-interactive zeroknowledge proof of knowledge and chosen .. (context) - RACKOFF, SIMON - 1991
99 One-way functions are necessary and sufficient for secure si.. (context) - ROMPEL - 1990
95 Multiple non-interactive zero knowledge proofs based on a si.. (context) - FEIGE, LAPIDOT et al. - 1990
77 Noninteractive zero-knowledge and its applications (context) - BLUM, FELDMAN et al. - 1988
55 A uniform complexity treatment of encryption and zero-knowle.. - GOLDREICH - 1993
52 Foundations of cryptography - GOLDREICH - 1989
25 Non-Malleable Encryption: Equivalence between Two Notions - BELLARE, SAHAI
24 Why chosen ciphertext security matters - SHOUP - 1998
11 Zero-knowledge proofs of knowledge without interaction (context) - DE SANTIS, PERSIANO - 1992
6 Non-Interactive and Non-Malleable Commitment - DI CRESCENZO, ISHAI et al. - 1998
6 Non-Interactive Zero-Knowledge Proofs (context) - BLUM, DE and et al. - 1991
3 The SET standard --- book 3 --- formal protocol definitions (context) - Secure, LLC - 1997
2 Preliminary version appeared (context) - DWORK, NAOR et al. - 1998
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://theory.lcs.mit.edu/~amits/work/index.html): More
Concurrent Zero-Knowledge - Dwork, Naor, Sahai (1999) (Correct)
Honest-Verifier Statistical Zero-Knowledge Equals.. - Goldreich, Sahai, Vadhan (1998) (Correct)
Exposure-Resilient Functions and All-Or-Nothing.. - Canetti, Dodis, Halevi, .. (2000) (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