Change search
ReferencesLink to record
Permanent link

Direct link
On the Composition of Public-Coin Zero-Knowledge Protocols
Cornell Univ, Ithaca, NY 14853 USA.
Cornell Univ, Ithaca, NY 14853 USA.
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0003-4157-1371
2009 (English)In: ADVANCES IN CRYPTOLOGY - CRYPTO 2009 / [ed] Halevi, S, 2009, Vol. 5677, 160-176 p.Conference paper (Refereed)
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 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
Keyword [en]
National Category
Computer and Information Science
URN: urn:nbn:se:kth:diva-50818DOI: 10.1007/978-3-642-03356-8_10ISI: 000269934400010ScopusID: 2-s2.0-70350303867OAI: diva2:462815
29th Annual International Cryptology Conference. Santa Barbara, CA. AUG 16-20, 2009

QC 20111209

Available from: 2011-12-08 Created: 2011-12-08 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
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: 18 hits
ReferencesLink to record
Permanent link

Direct link