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

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


Duration: 1:06:09
264 views
6

Yael Kalai (Microsoft Research)
https://simons.berkeley.edu/talks/tbd-85
Probabilistically Checkable and Interactive Proof Systems



Other Videos By Simons Institute for the Theory of Computing


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
2019-09-24From Holography to Recursive Proofs
2019-09-24Recursive Techniques for Lattice-Based Zero-Knowledge
2019-09-24Efficient Post-Quantum zkSNARKs from Univariate Sumcheck
2019-09-24No-Signaling Proofs with O(\sqrt{log n})-Provers is in PSPACE
2019-09-23Finding a Nash Equilibrium is No Easier than Breaking Fiat-Shamir
2019-09-23Publicly Verifiable Zero Knowledge on Blockchains
2019-09-23Sonic: zk-SNARKs from Linear Sized Universal and Updatable SRS's
2019-09-23Practical Proof Systems: Implementations, Applications, and Next Steps
2019-09-23Efficient Zero-Knowledge Proofs: A Modular Approach
2019-09-19Platforms and Marketplaces: Past Lessons and Future Possibilities
2019-09-19Matching Markets: Managing Scale and Accuracy
2019-09-18Optimal Growth in Two-Sided Markets
2019-09-18Matching Algorithms for Blood Donation
2019-09-18The Unreasonable Effectiveness of Artificial Currencies


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Probabilistically Checkable and Interactive Proof Systems
Yael Kalai