Change search
ReferencesLink to record
Permanent link

Direct link
On the composition of public-coin zero-knowledge protocols
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0003-4157-1371
2011 (English)In: SIAM journal on computing (Print), ISSN 0097-5397, E-ISSN 1095-7111, Vol. 40, no 6, 1529-1553 p.Article in journal (Refereed) Published
Abstract [en]

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 setup) and in the bare public key model (where the prover and the verifier have registered public keys). We complement this result by constructing a public-coin black-box zero-knowledge proof based on one-way functions that remains secure under any a priori bounded number of concurrent executions. A key step (of independent interest) in the analysis of our lower bound shows that any public-coin protocol, when repeated sufficiently in parallel, satisfies a notion of "resettable soundness" if the verifier picks its random coins using a pseudorandom function.

Place, publisher, year, edition, pages
2011. Vol. 40, no 6, 1529-1553 p.
Keyword [en]
public-coin interactive protocols, zero-knowledge, parallel repetition
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-63056DOI: 10.1137/100811465ISI: 000298377900003ScopusID: 2-s2.0-84855608151OAI: diva2:481575
ICT - The Next Generation

QC 20120125

Available from: 2012-01-21 Created: 2012-01-21 Last updated: 2013-11-25Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Pass, RafaelWikström, Douglas
By organisation
Theoretical Computer Science, TCS
In the same journal
SIAM journal on computing (Print)
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 32 hits
ReferencesLink to record
Permanent link

Direct link