On the Composition of Public-Coin Zero-Knowledge Protocols

Download Now
Provided by: KTH - Royal Institute of Technology
Topic: Security
Format: PDF
The authors 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 paper 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). They 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.
Download Now

Find By Topic