On the Composition of Public-Coin Zero-Knowledge Protocols

Authors:
Rafael Pass;Wei-Lung Dustin Tseng;Douglas Wikström
Affiliations:
Cornell University, USA;Cornell University, USA;KTH Royal Institute of Technology, Sweden
Venue:
CRYPTO '09 Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology
Year:
2009

Citing 0
Cited 5

(Nearly) round-optimal black-box constructions of commitments secure against selective opening attacks

TCC'11 Proceedings of the 8th conference on Theory of cryptography
An efficient parallel repetition theorem

TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Private coins versus public coins in zero-knowledge proof systems

TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
A Parallel Repetition Theorem for Constant-Round Arthur-Merlin Proofs

ACM Transactions on Computation Theory (TOCT)
Public-Coin concurrent zero-knowledge in the global hash model

TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that only languages in BPP have public-coin, black-box zero-knowledge protocols that are secure under an unbounded (polynomial) number of parallel repetitions. This result holds both in the plain model (without any set-up) and in the Bare Public-Key Model (where the prover and the verifier have registered public keys). We complement this result by showing the existence of a public-coin black-box zero-knowledge proof that remains secure under any a-priori bounded number of concurrent executions.