Fully Linear PCPs and their Cryptographic Applications

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=tuzwPb4RjJA


Duration: 1:07:37
1,000 views
4

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



Other Videos By Simons Institute for the Theory of Computing


2019-10-01Credible Mechanism
2019-10-01Obviousness Around the Clock
2019-10-01Incrementality Bidding and Attribution
2019-10-01Seeding with Costly Network Information
2019-10-01Complementary Information and Learning Traps
2019-09-30Simons Institute Polylogues: Algorithms and Race
2019-09-272-to-2 Games, the Grassmann Graph, and Hyper-contractivity
2019-09-27Role of Composition in low-error PCP constructions
2019-09-27Ligero: Sublinear Arguments from MPC-in-the-head
2019-09-27On The Power of Distributed Verifiers in Interactive Proofs
2019-09-26Fully Linear PCPs and their Cryptographic Applications
2019-09-26Streaming Verification of Graph Computations via Graph Structure
2019-09-26How to do Fiat-Shamir in the Standard Model
2019-09-26How to Delegate Computations Publicly
2019-09-25A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments
2019-09-25Improved Soundness Proving Proximity to Reed-Solomon Codes and STARKs
2019-09-25PLONK: Permutations over Lagrange-Bases for Oecumenical Noninteractive arguments of Knowledge
2019-09-25Transparent SNARKs from DARK Compilers
2019-09-25Efficient Zero Knowledge Proof from Interactive Proofs
2019-09-24On Two-Message Statistically Private Arguments
2019-09-24Fully Homomorphic NIZK and NIWI Proofs


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Probabilistically Checkable and Interactive Proof Systems
Elette Boyle
Henry Corrigan-Gibbs