Playlist: 24 videos

Probabilistically Checkable and Interactive Proof Systems

0:32:42

On Two-Message Statistically Private Arguments

Dakshita Khurana (Microsoft Research)
https://simons.berkeley.edu/talks/two-message-statistically-private-arguments
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
0:47:39

Efficient Zero Knowledge Proof from Interactive Proofs

Yupeng Zhang (Texas A&M University)
https://simons.berkeley.edu/talks/efficient-zero-knowledge-proof-interactive-proofs
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
0:47:30

Transparent SNARKs from DARK Compilers

Benedikt Bünz (Stanford University)
https://simons.berkeley.edu/talks/trustless-setup-snarks-efficient-polynomial-commitments
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
0:37:2

Components of Recent Universal SNARKs

Ariel Gabizon (Protocol Labs)
https://simons.berkeley.edu/talks/components-recent-universal-snarks
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
0:31:58

Improved Soundness Proving Proximity to Reed-Solomon Codes and STARKs

Swastik Kopparty (Rutgers University)
https://simons.berkeley.edu/talks/improved-soundness-proving-proximity-reed-solomon-codes-and-starks
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
0:34:27

A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments

Iftach Haitner (Tel Aviv University)
https://simons.berkeley.edu/talks/tight-parallel-repetition-theorem-random-terminating-interactive-arguments
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
1:10:1

How to do Fiat-Shamir in the Standard Model

Alex Lombardi (MIT)
https://simons.berkeley.edu/talks/how-do-fiat-shamir-standard-model
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
0:28:28

How to Delegate Computations Publicly

Lisa Yang (MIT)
https://simons.berkeley.edu/talks/how-delegate-computations-publicly
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
0:28:35

Streaming Verification of Graph Computations via Graph Structure

Prantar Ghosh (Dartmouth College)
https://simons.berkeley.edu/talks/streaming-verification-graph-computations-graph-structure
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
1:7:37

Fully Linear PCPs and their Cryptographic Applications

Elette Boyle (IDC Herzliya), Henry Corrigan-Gibbs (Stanford University)
https://simons.berkeley.edu/talks/fully-linear-pcps
Probabilistically Checkable and Interactive Proof Systems
Visit talk page