#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2016

2017

- This year (1)
- Last 5 years (2)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Oded Goldreich, Maya Leshkowitz
- Electronic Colloquium on Computational Complexity
- 2016

The known emulation of interactive proof systems by public-coins interactive proof systems proceeds by selecting, at each round, a message such that each message is selected with probability that is at most polynomially larger than its probability in the original protocol. Specifically, the possible messages are essentially clustered according to the… (More)

- Maya Leshkowitz
- Electronic Colloquium on Computational Complexity
- 2017

Consider an interactive proof system for some set S that has randomness complexity r(n) for instances of length n, and arbitrary round complexity. We show a public-coin interactive proof system for S of round complexity O(r(n)/ log n). Furthermore, the randomness complexity is preserved up to a constant factor, and the resulting interactive proof system has… (More)

- ‹
- 1
- ›