Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
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, Published 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.
Series
Lecture Notes in Computer Science, ISSN 0302-9743
Keyword [en]
PROOF SYSTEMS; COMPLEXITY
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:kth:diva-50818DOI: 10.1007/978-3-642-03356-8_10ISI: 000269934400010Scopus ID: 2-s2.0-70350303867OAI: oai:DiVA.org:kth-50818DiVA: diva2:462815
Conference
29th Annual International Cryptology Conference. Santa Barbara, CA. AUG 16-20, 2009
Note

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

Authority records BETA

Wikström, Douglas

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

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 32 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf