Constant-Round Arguments from One-Way Functions
Explore a groundbreaking lecture on constant-round arguments in cryptography. Delve into the innovative proof that, assuming only the existence of one-way functions, there exists a constant-round doubly-efficient argument system with almost-linear verification time for languages with log-space uniform circuits of linear depth and polynomial size. Compare this new result with prior work, including unconditionally sound interactive proofs and Kilian's protocol. Examine the advantages and limitations of this approach, which relies on weaker cryptographic assumptions than previous methods. Learn about the collaborative research conducted with Noga Amit, as presented by Guy Rothblum from Apple at the Simons Institute's "Minimal Complexity Assumptions for Cryptography" event.