Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Constant-Round Arguments from One-Way Functions

Simons Institute via YouTube

Overview

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.

Syllabus

Constant-Round Arguments from One-Way Functions

Taught by

Simons Institute

Reviews

Start your review of Constant-Round Arguments from One-Way Functions

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.