Playlist: 24 videos

Probabilistically Checkable and Interactive Proof Systems

1:11:33

Efficient Zero-Knowledge Proofs: A Modular Approach

Yuval Ishai (Technion)
https://simons.berkeley.edu/talks/tbd-79
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
1:0:43

Practical Proof Systems: Implementations, Applications, and Next Steps

Riad Wahby (Stanford University)
https://simons.berkeley.edu/talks/tbd-80
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
0:30:46

Sonic: zk-SNARKs from Linear Sized Universal and Updatable SRS's

Mary Maller (University College London)
https://simons.berkeley.edu/talks/tbd-84
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
0:34:55

Publicly Verifiable Zero Knowledge on Blockchains

Alessandra Scafuro (North Carolina State University)
https://simons.berkeley.edu/talks/publicly-verifiable-zero-knowledge-blockchains
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
1:3:0

Finding a Nash Equilibrium is No Easier than Breaking Fiat-Shamir

Guy Rothblum (Weizmann Institute)
https://simons.berkeley.edu/talks/tbd-81
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
1:6:9

No-Signaling Proofs with O(\sqrt{log n})-Provers is in PSPACE

Yael Kalai (Microsoft Research)
https://simons.berkeley.edu/talks/tbd-85
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
1:3:42

Efficient Post-Quantum zkSNARKs from Univariate Sumcheck

Nicholas Spooner (UC Berkeley)
https://simons.berkeley.edu/talks/tbd-82
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
0:29:57

Recursive Techniques for Lattice-Based Zero-Knowledge

Jonathan Bootle (IBM Research- Zurich)
https://simons.berkeley.edu/talks/recursive-techniques-lattice-based-zero-knowledge
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
0:34:28

From Holography to Recursive Proofs

Alessandro Chiesa (UC Berkeley)
https://simons.berkeley.edu/talks/tbd-83
Probabilistically Checkable and Interactive Proof Systems
Visit talk page
0:34:4

Fully Homomorphic NIZK and NIWI Proofs

Prabhanjan Ananth (UC Santa Barbara)
https://simons.berkeley.edu/talks/fully-homomorphic-nizk-and-niwi-proofs
Probabilistically Checkable and Interactive Proof Systems
Visit talk page