TY - GEN
T1 - On the composition of public-coin zero-knowledge protocols
AU - Pass, Rafael
AU - Tseng, Wei Lung Dustin
AU - Wikström, Douglas
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=70350303867&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-03356-8_10
DO - 10.1007/978-3-642-03356-8_10
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:70350303867
SN - 3642033555
SN - 9783642033551
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 160
EP - 176
BT - Advances in Cryptology - CRYPTO 2009 - 29th Annual International Cryptology Conference, Proceedings
Y2 - 16 August 2009 through 20 August 2009
ER -