Cynthia Dwork, Moni Naor  Home/Search
Context Related
| wisdom.weizmann.ac.il/%7Ena...zap.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: wisdom.weizmann.ac.il/~na...onpub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A zap is a two-round, witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed "once-and-for-all" and applied to any instance, and where the verifier does not use any private coins. We present a zap for every language in NP, based on the existence of non-interactive zero-knowledge proofs in the shared random string model. The zap is in the standard model, and hence requires no common guaranteed random string. (Update)
Cited by: More
Non-interactive Zaps and New Techniques for NIZK - Jens Groth Rafail (Correct)
Derandomization in Cryptography - Barak, Ong, Vadhan (2005) (Correct)
Reducing Server Trust In Private Proxy Auctions - Di Crescenzo, Herranz, Sáez (2004) (Correct)
Similar documents (at the sentence level):
75.6%: Zaps and Their Applications - Dwork, Naor (2000) (Correct)
Active bibliography (related documents): More All
0.6: Concurrent Zero-Knowledge - Dwork, Naor, Sahai (1999) (Correct)
0.5: Strengthening Zero-Knowledge Protocols using Signatures - Garay, MacKenzie, Yang (2003) (Correct)
0.5: Non-Malleable Cryptography - Dolev, Dwork, Naor (1998) (Correct)
Similar documents based on text: More All
0.7: Constant-Round Coin-Tossing With a Man in the Middle or Realizing.. - Barak (2002) (Correct)
0.6: Concurrent Zero-Knowledge With Timing, Revisited - Goldreich (2001) (Correct)
0.6: Deniable Ring Authentication - Naor (2002) (Correct)
Related documents from co-citation: More All
7: Multiple non-interactive zero knowledge proofs based on a single random string (context) - Feige, Lapidot et al. - 1990
6: Concurrent Zero Knowledge - Dwork, Naor et al.
6: Resettable zero-knowledge - Canetti, Goldreich et al. - 2000
BibTeX entry: (Update)
C. Dwork and M. Naor. Zaps and their applications. In 41st FOCS, pages 283--293, 2000. http://citeseer.ist.psu.edu/article/dwork00zaps.html More
@inproceedings{ dwork00zaps,
author = "Cynthia Dwork and Moni Naor",
title = "Zaps and Their Applications",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "283-293",
year = "2000",
url = "citeseer.ist.psu.edu/article/dwork00zaps.html" }
Citations (may not include all citations):531 The Knowledge Complexity of Interactive Proof Systems (context) - Goldwasser, Micali et al. - 1989 ACM DBLP
419 How to Construct Random Functions (context) - Goldreich, Goldwasser et al. - 1986 ACM DBLP
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
334 How to Generate Cryptographically Strong Sequences of Pseudo.. (context) - Blum, Micali - 1984 ACM DBLP
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
197 A Randomized Protocol for Signing Contracts (context) - Even, Goldreich et al. - 1985 ACM DBLP
174 How to exchange secrets by oblivious transfer (context) - Rabin - 1981
124 Bit Commitment Using Pseudo-Randomness - Naor - 1991 ACM DBLP
111 the Composition of Zero Knowledge Proof Systems - Goldreich, Krawczyk - 1996
99 Foundations of Cryptography - Basic Tools (context) - Goldreich - 2001
97 Pseudorandomness and Cryptographic Applications (context) - Luby - 1996 ACM
95 Multiple NonInteractive Zero Knowledge Proofs Under General .. (context) - Feige, Lapidot et al. - 1999 DBLP
84 Noninteractive zero-knowledge - Blum, De Santis et al. - 1991 ACM DBLP
81 Replication Is Not Needed: Single Database (context) - Kushilevitz, Ostrovsky
81 Pricing via Processing-or- Combatting Junk Mail (context) - Dwork, Naor - 1993
56 Proofs that Yield Nothing But their Validity (context) - Goldreich, Micali et al. - 1991
56 How to Go Beyond The Black-Box Simulation Barrier - Barak - 2001 ACM DBLP
49 All-or-nothing disclosure of secrets - Brassard, Crepeau et al. - 1987 ACM DBLP
45 the Generation of Cryptographically Strong Pseudorandom Sequ.. (context) - Shamir - 1983
41 Lower Bounds for Zero Knowledge on the Internet - Kilian, Petrank et al. - 1998 ACM DBLP
37 Concurrent Zero-Knowledge: Reducing the Need for Timing Cons.. - Dwork, Sahai - 1998 DBLP
36 Non-Interactive Zero-Knowledge Proof Systems (context) - Blum, Feldman et al. - 1988 ACM DBLP
33 Resettable Zero-Knowledge - Canetti, Goldreich et al. - 2000 ACM DBLP
32 Synthesizers and their application to the parallel construct.. - Naor, Reingold - 1999
30 A Pseudorandom Generator from any One-way Function (context) - astad, Impagliazzo et al. - 1999 ACM DBLP
20 A Note on the Round-Complexity of Concurrent Zero-Knowledge - Rosen ACM DBLP
20 An Efficient Non-Interactive Zero-Knowledge Proof System for.. - Kilian, Petrank - 1998
17 Certifying permutations: Noninteractive zero-knowledge based.. - Bellare, Yung - 1996 DBLP
15 personal communication (context) - Impagliazzo, Naor et al. - 1998
12 Advances in Cryptology - CRYPTO (context) - Boneh, Naor et al.
11 Verifiable Random Functions - Micali, Rabin et al. - 1999 ACM DBLP
11 Method for message authentication from non-malleable crypto .. (context) - Dwork, Naor - 1996
7 The Non-Malleability Lectures (context) - Dwork - 1999
4 Efficient Concurrent Zero-Knowledge in the Auxiliary String .. (context) - ard DBLP
4 and M. Yung, Public-key Cryptosystems provably secure agains.. (context) - Naor - 1990
3 of the 30th ACM Symposium on the Theory of Computing (context) - Dwork, Naor et al. - 1998
3 and A. Shamir, Witness Indistinguishable and Witness Hiding .. (context) - Feige - 1990
2 the twelth Annual ACM-SIAM Symposium on Discrete Algorithms (context) - Naor, Pinkas et al. - 2001
2 Concurrent Zero Knowledge Require ~OmegaGamma n) Round (context) - Petrank, Zero et al.
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