Ran Canetti, Oded Goldreich, Shafi Goldwasser, Silvio Micali  Home/Search
Context Related
| iacr.org/1999/022.ps.gz 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: iacr.org/complete/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce the notion of Resettable Zero-Knowledge (rZK), a new security measure for cryptographic protocols which strengthens the classical notion of zero-knowledge. In essence, an rZK protocol is one that remains zero knowledge even if an adversary can interact with the prover many times, each time resetting the prover to its initial state and forcing it to use the same random tape. All known examples of zero-knowledge proofs and arguments are trivially breakable in this setting.... (Update)
Similar documents based on text: More All
1.3: Resettable Zero-Knowledge - Canetti, Goldreich, Goldwasser.. (2000) (Correct)
0.8: Resettably-Sound Zero-Knowledge and its Applications - Barak, Goldreich.. (2001) (Correct)
0.7: Probabilistic Proof Systems - Part I - Vadhan (2000) (Correct)
BibTeX entry: (Update)
R. Canetti, O. Goldreich, S. Goldwasser and S. Micali. Resettable zero-knowledge. In Proc. 32nd Annual ACM Symposium on Theory of Computing May 2000. http://citeseer.ist.psu.edu/canetti00resettable.html More
@article{ canetti99resettable,
author = "Ran Canetti and Oded Goldreich and Shafi Goldwasser and Silvio Micali",
title = "Resettable Zero-Knowledge",
journal = "Electronic Colloquium on Computational Complexity (ECCC)",
number = "42",
year = "1999",
url = "citeseer.ist.psu.edu/canetti00resettable.html" }
Citations (may not include all citations):531 The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1989
501 A Digital Signature Scheme Secure Against Adaptive Chosen-Me.. - Goldwasser, Micali et al. - 1988
419 How to Construct Random Functions (context) - Goldreich, Goldwasser et al. - 1986
411 How to Prove Yourself: Practical Solution to Identification .. - Fiat, Shamir - 1987
334 How to Generate Cryptographically Strong Sequences of Pseudo.. (context) - Blum, Micali - 1984
326 Non-Malleable Cryptography - Dolev, Dwork et al. - 1991
278 Probabilistic Encryption (context) - Goldwasser, Micali - 1984
206 Zero-Knowledge Proofs of Identity (context) - Feige, Fiat et al. - 1988
196 Minimum Disclosure Proofs of Knowledge (context) - Brassard, Chaum et al. - 1988
194 Proofs that Yield Nothing But Their Validity or All Language.. (context) - Goldreich, Micali et al. - 1991
111 the Composition of Zero-Knowledge Proof Systems - Goldreich, Krawczyk - 1996
95 Multiple Non-Interactive Zero-Knowledge Proofs Based on a Si.. (context) - Feige, Lapidot et al. - 1990
94 Concurrent Zero-Knowledge - Dwork, Naor et al. - 1998
85 Construction of Pseudorandom Generator from any One-Way Func.. - Hastad, Impagliazzo et al. - 1999
79 One-Way Functions are Essential for Complexity Based Cryptog.. (context) - Impagliazzo, Luby - 1989
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://eprint.iacr.org/complete/): More
A Tool for Obtaining Tighter Security Analyses of.. - Bellare, Impagliazzo (1999) (Correct)
Chameleon Hashing and Signatures - Krawczyk, Rabin (1997) (Correct)
Verifiable Encryption and Applications to Group.. - Camenisch, Damgård (1999) (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