Главная
Study mode:
on
1
On Prover-Efficient Public-Coin Emulation of Interactive Proofs
2
Can We Transform Private-Coin Proofs To Public-Coin?
3
Main Theorem: Sufficient properties for efficient transformations
4
An application
5
Set Lower-Bound Protocol (Baba) Sets (0,1) with efficient membership test
6
Emulating General Interactive Proofs
7
Unknown Number of Equally Likely Messages
8
Set Lower-Bound Protocol For #Consistent Coins
9
In the general case: • Messages With Varying Likelihood
Description:
Explore a conference talk from the 2021 ITC Conference that delves into the relationship between private-coin and public-coin interactive proofs. Learn about the challenges in transforming private-coin proofs into public-coin ones while preserving the prover's efficiency. Discover the main theorem presenting sufficient properties for efficient transformations and its implications for doubly-efficient interactive proofs. Examine the impact of one-way functions on these transformations and investigate general conditions allowing for efficiency-preserving conversions. Gain insights into an application of these findings to transform a private-coin protocol for verifying graph properties into a doubly-efficient public-coin protocol.

On Prover-Efficient Public-Coin Emulation of Interactive Proofs

Paul G. Allen School
Add to list
0:00 / 0:00