Maya Leshkowitz

  • Citations Per Year
Learn More
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)
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