Paper 2009/347
An Efficient Concurrent Repetition Theorem
Douglas Wikström
Abstract
Håstad et al. (2008) prove, using Raz's lemma (STOC '95) thefirst efficient parallel repetition theorem for protocols with anon-constant number of rounds, for a natural generalization ofpublic-coin protocols. They show that a parallel prover thatconvinces a fraction
Note: This is a preliminary version. All comments are most welcome! The cited manuscript of Hastad et al. (2008) should be posted shortly.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- parallel repetition
- Contact author(s)
- dog @ csc kth se
- History
- 2009-07-18: received
- Short URL
- https://ia.cr/2009/347
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2009/347, author = {Douglas Wikström}, title = {An Efficient Concurrent Repetition Theorem}, howpublished = {Cryptology {ePrint} Archive, Paper 2009/347}, year = {2009}, url = {https://eprint.iacr.org/2009/347} }