Download:
|
by Boaz Barak, Oded Goldreich, Shafi Goldwasser, Yehuda Lindell
Appeared in 42nd FOCS
http://www.wisdom.weizmann.ac.il/~oded/PS/rszk.ps
Add To MetaCart
Abstract:
Resettably-sound proofs and arguments maintain soundness even when the prover can reset the verifier to use the same random coins in repeated executions of the protocol. We show that resettably-sound zero-knowledge arguments for NP exist if collision-free hash functions exist. In contrast, resettably-sound zero-knowledge proofs are possible only for languages in P=poly. We present two applications of resettably-sound zero-knowledge arguments. First, we construct resettable zero-knowledge arguments of knowledge for NP, using a natural relaxation of the definition of arguments (and proofs) of knowledge. We note that, under the standard definition of proof of knowledge, it is impossible to obtain resettable zero-knowledge arguments of knowledge for languages outside BPP. Second, we construct a constant-round resettable zeroknowledge argument for NP in the public-key model, under the assumption that collision-free hash functions exist. This improves upon the sub-exponential hardness assumption required by previous constructions. We emphasize that our results use non-black-box zero-knowledge simulations. Indeed, we show that some of the results are impossible to achieve using black-box simulations. In particular,
Citations
|
692
|
The Knowledge Complexity of Interactive Proof-Systems (Extended Abstract
– Goldwasser, Micali, et al.
- 1985
|
|
552
|
How to prove yourself: Practical solutions to identification and signature problems
– Fiat, Shamir
- 1986
|
|
480
|
How to construct random functions
– Goldreich, Goldwasser, et al.
- 1986
|
|
355
|
Nonmalleable cryptography
– Dolev, Dwork, et al.
|
|
306
|
Universally composable security: A new paradigm for cryptographic protocols
– Canetti
- 2001
|
|
263
|
Zero Knowledge Proofs of Identity
– Fiege, Fiat, et al.
- 1987
|
|
241
|
Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems
– Goldreich, Micali, et al.
- 1991
|
|
219
|
Minimum disclosure proofs of knowledge
– Brassard, Chaum, et al.
- 1988
|
|
138
|
On the composition of zero-knowledge proof systems
– Goldreich, Krawczyk
- 1996
|
|
132
|
Witness indistinguishable and witness hiding protocols
– Feige, Shamir
|
|
122
|
Concurrent zero-knowledge
– Dwork, Naor, et al.
- 1998
|
|
113
|
How to go beyond the black-box simulation barrier
– Barak
- 2001
|
|
113
|
Multiple non-interactive zero knowledge proofs under general assumptions
– Feige, Lapidot, et al.
- 1999
|
|
111
|
How to construct constant-round zeroknowledge proof systems for NP
– Goldreich, Kahan
- 1996
|
|
102
|
On defining proofs of knowledge
– Bellare, Goldreich
|
|
81
|
Definitions and Properties of Zero-Knowledge Proof Systems
– Goldreich, Oren
- 1994
|
|
77
|
On the concurrent composition of zero-knowledge proofs
– Richardson, Kilian
- 1999
|
|
75
|
Efficient concurrent zero-knowledge in the auxiliary string model
– Damgard
- 2000
|
|
61
|
to Prove a Theorem So No One Else Can Claim It
– Blum, How
- 1986
|
|
56
|
On the Composition of Zero-Knowledge
– Goldreich, Krawczyk
- 1990
|
|
53
|
Foundations of Cryptography – Volume 2: Basic Applications
– Goldreich
- 2004
|
|
50
|
Foundations of Cryptography – Volume 1: Basic Tools
– Goldreich
- 2001
|
|
49
|
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
– Lindell
- 1977
|
|
49
|
Black-box concurrent zero-knowledge requires ˜ Ω(log n) rounds
– Canetti, Kilian, et al.
- 2001
|
|
29
|
Universal Arguments and their Applications
– Barak, Goldreich
- 2002
|
|
28
|
Zaps and Their Applications
– Dwork, Naor
|
|
25
|
Alternative Models for Zero Knowledge Interactive Proofs
– Feige
- 1990
|
|
21
|
Certifying Permutations: Non-Interactive Zero-Knowledge Based on Any Trapdoor Permutation
– Bellare, Yung
- 1996
|
|
17
|
Soundness in the Public-Key Model
– Micali, Reyzin
- 2001
|
|
11
|
Min-round resettable zero knowledge in the public-key model
– Micali, Reyzin
- 2001
|
|
6
|
Zero-knowledge with public keys
– Reyzin
- 2001
|
|
2
|
CS Proofs Under a Standard Assumption
– Barak, Goldreich
- 2001
|
|
1
|
Non-Malleable Cryptography. newblock
– Dolev, Dwork, et al.
- 2000
|
|
1
|
Verifiable Pseudorandom Functions
– Micali, Rabin, et al.
- 1999
|
|
1
|
Concurrent and Resettable Zero-Knowledge
– Kilian, Petrank
- 2001
|
