Fully Linear PCPs and Their Cryptographic Applications

Explore a comprehensive lecture on Fully Linear PCPs and their cryptographic applications, presented by Elette Boyle from IDC Herzliya and Henry Corrigan-Gibbs from Stanford University. Delve into the world of Probabilistically Checkable and Interactive Proof Systems, covering topics such as distributed verifiers, cryptographic applications, and fully linear interactive oracles. Learn about low communication fully linear PCPs, secret sharing schemes, and their construction and examples. Gain insights into communication complexity, existing approaches, and passive secure protocols. Discover the connections between these concepts and their relevance in modern cryptography and computer science.

Introduction
Proofs and Verifiers
Distributed Verifiers
Cryptographic Applications
Fully Linear PCPs
Fully Linear PCP
Fully Linear Interactive Oracle
Low Communication Fully Linear PCP
Secret Sharing Scheme
Fully Linear PCP Construction
Fully Linear PCP Example
Summary
Quick refresher
Applications
Communication Complexity
Existing Approaches
Passive Secure Protocol
Observations