In this paper, we present both practical and general 4-round concurrent and resettable zeroknowledge arguments with concurrent soundness in the bare public-key (BPK) model. To our knowledge, our result is the first work that achieves concurrent soundness for ZK protocols in the BPK model and stands for the current state-of-the-art of concurrent zero-knowledge with setup assumptions. Since the BPK model is very simple and also very reasonable and is in fact a weak version of the frequently used public-key infrastructure (PKI) model, which underlies any public-key cryptosystem or digital signature scheme, we suggest that zero-knowledge protocols with simultaneous concurrent security in the BPK model may be of independent interests and can be used as a building block in other applications in the BPK model (e. g. secure two-party and multi-party computation with registered public-keys). For example, we show how to use our CZK-CS protocols to achieve cryptographic protocols with both concurrent player security and concurrent channel security (concurrent non-malleability) in the BPK model. We also give practical rZK and deniable authentication protocols in the preprocessing model.
|
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
|
|
413
|
Efficient signature generation for smart cards
– Schnorr
- 1991
|
|
355
|
Nonmalleable cryptography
– Dolev, Dwork, et al.
|
|
306
|
Universally composable security: A new paradigm for cryptographic protocols
– Canetti
- 2001
|
|
304
|
How to generate and exchange secrets
– Yao
- 1986
|
|
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
|
|
185
|
Proofs of partial knowledge and simplified design of witness hiding protocols
– Cramer, Damg˚ard, et al.
|
|
169
|
A modular approach to the design and analysis of authentication and key exchange protocols
– Bellare, Canetti, et al.
- 1995
|
|
166
|
Public-key Cryptosystems Provably Secure Against Chosen Ciphertext Attacks. STOC ’90
– Naor, Yung
|
|
134
|
Noninteractive zero-knowledge
– Blum, Santis, et al.
- 1991
|
|
122
|
Concurrent zero-knowledge
– Dwork, Naor, et al.
- 1998
|
|
116
|
Authenticated encryption: Relations among notions and analysis of the generic composition paradigm
– Bellare, Namprempre
- 2000
|
|
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
|
|
102
|
On defining proofs of knowledge
– Bellare, Goldreich
|
|
88
|
Non-malleable non-interactive zero-knowledge and adaptive chosenciphertext security
– Sahai
- 1999
|
|
79
|
Zero knowledge proofs of knowledge in two rounds
– Feige, Shamir
|
|
77
|
On the concurrent composition of zero-knowledge proofs
– Richardson, Kilian
- 1999
|
|
75
|
Efficient concurrent zero-knowledge in the auxiliary string model
– Damgard
- 2000
|
|
70
|
Universally composable two-party and multi-party secure computation
– Canetti, Lindell, et al.
- 2002
|
|
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
|
|
50
|
Coin Flipping by Telephone
– Blum
- 1982
|
|
50
|
On the existence of statistically hiding bit commitment schemes and fail-stop signatures
– Damgard, Pedersen, et al.
- 1997
|
|
49
|
Black-box concurrent zero-knowledge requires ˜ Ω(log n) rounds
– Canetti, Kilian, et al.
- 2001
|
|
49
|
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
– Lindell
- 1977
|
|
48
|
Constant-Round Coin-Tossing With a Man in the Middle or Realizing the Shared Random String Model
– Barak
- 2002
|
|
46
|
Practical and provably-secure commitment schemes from collision-free hashing
– Halevi, Micali
- 1996
|
|
42
|
Efficient and noninteractive non-malleable commitment
– Crescenzo, Katz, et al.
|
|
30
|
R.: On concurrent zero-knowledge with preprocessing
– Crescenzo, Ostrovsky
|
|
29
|
Universal Arguments and their Applications
– Barak, Goldreich
- 2002
|
|
28
|
Zaps and Their Applications
– Dwork, Naor
|
|
27
|
Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor
– Damg˚ard, Nielsen
- 2002
|
|
26
|
Efficient non-malleable commitment schemes
– Fischlin, Fischlin
- 2000
|
|
26
|
Concurrent and Resettable Zero-Knowledge in Poly-logarithmic Rounds
– Kilian, Petrank
- 2001
|
|
25
|
Alternative Models for Zero Knowledge Interactive Proofs
– Feige
- 1990
|
|
25
|
Concurrent Zero Knowledge With Logarithmic Round Complexity
– Prabhakaran, Rosen, et al.
- 2002
|
|
23
|
Strict Polynomial-Time in Simulation and Extraction
– Barak, Lindell
- 2004
|
|
23
|
Non-interactive and reusable non-malleable commitment schemes
– Damg˚ard, Groth
- 2003
|
|
21
|
Strengthening Zero-Knowledge Protocols using Signatures
– Garay, MacKenzie, et al.
- 2003
|
|
18
|
Concurrent Zero-Knowledge With Timing Revisited
– Goldreich
- 2002
|
|
17
|
Soundness in the Public-Key Model
– Micali, Reyzin
- 2001
|
|
12
|
Composition of Secure Multi-Party Protocols - A Comprehensive Study
– Lindell
- 2003
|
|
11
|
Min-round resettable zero knowledge in the public-key model
– Micali, Reyzin
- 2001
|
|
9
|
Resettably-Sound Zero-Knowledge and its Applications. Record 2001/063, Cryptology ePrint Archive
– Barak, Goldreich, et al.
- 2001
|
|
8
|
Zero-knowledge arguments and public key cryptography
– Santis, Crescenzo, et al.
- 1995
|
|
7
|
How to play any mental game—a completeness theorem for protocols with honest majority
– Goldreich, Micali, et al.
- 1987
|
