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
An Efficient Parallel Repetition Theorem
KTH, School of Computer Science and Communication (CSC), Numerical Analysis and Computer Science, NADA.ORCID iD: 0000-0002-5379-345X
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0003-4157-1371
2010 (English)In: THEORY OF CRYPTOGRAPHY, PROCEEDINGS / [ed] Micciancio D, 2010, Vol. 5978, 1-18 p.Conference paper, Published paper (Refereed)
Abstract [en]

We present a general parallel-repetition theorem with an efficient reduction. As a corollary of this theorem we establish that parallel repetition reduces the soundness error at an exponential rate in any public-coin argument, and more generally, any argument where the verifier's messages, but not necessarily its decision to accept or reject, can be efficiently simulated with noticeable probability.

Place, publisher, year, edition, pages
2010. Vol. 5978, 1-18 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 5978
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-29638DOI: 10.1007/978-3-642-11799-2_1ISI: 000280461700001Scopus ID: 2-s2.0-77949610580ISBN: 978-3-642-11798-5 (print)OAI: oai:DiVA.org:kth-29638DiVA: diva2:408295
Conference
7th Theory of Cyptography Conference
Note

QC 20110404

Available from: 2011-04-04 Created: 2011-02-11 Last updated: 2013-11-25Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Håstad, JohanWikström, Douglas

Search in DiVA

By author/editor
Håstad, JohanPass, RafaelWikström, Douglas
By organisation
Numerical Analysis and Computer Science, NADATheoretical Computer Science, TCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 61 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