On the Composition of Public-Coin Zero-Knowledge Protocols
2009 (English)In: ADVANCES IN CRYPTOLOGY - CRYPTO 2009 / [ed] Halevi, S, 2009, Vol. 5677, 160-176 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
2009. Vol. 5677, 160-176 p.
, Lecture Notes in Computer Science, ISSN 0302-9743
PROOF SYSTEMS; COMPLEXITY
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-50818DOI: 10.1007/978-3-642-03356-8_10ISI: 000269934400010ScopusID: 2-s2.0-70350303867OAI: oai:DiVA.org:kth-50818DiVA: diva2:462815
29th Annual International Cryptology Conference. Santa Barbara, CA. AUG 16-20, 2009
QC 201112092011-12-082011-12-082013-11-25Bibliographically approved