To interact or not to interact: Cryptographic proof systems and the Fiat-Shamir heuristic

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


Duration: 0:00
210 views
3

Alex Lombardi (Princeton)
Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp



Other Videos By Simons Institute for the Theory of Computing


2025-07-07Reducing the number of qubits in quantum factoring
2025-07-07Panel Discussion
2025-07-07Exponential improvements to the average-case hardness of random circuits
2025-07-07Are Random Quantum Circuits PRUs?
2025-07-06An Overview of QEC at Google
2025-07-06Architectural mechanisms of a universal fault-tolerant quantum computer
2025-07-06Panel Discussion
2025-07-06Tour de gross: A modular quantum computer based on bivariate bicycle codes
2025-06-26Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from...
2025-06-26Expedition to Obfustopia: Indistinguishability Obfuscation from Well-Studied Assumptions to New...
2025-06-25To interact or not to interact: Cryptographic proof systems and the Fiat-Shamir heuristic
2025-06-18Succinct arguments for QMA from standard assumptions, without quantum PCPs
2025-05-30Crypto + Meta-complexity 2
2025-05-30Crypto + Meta-complexity 1
2025-05-30Crypto + ML 2
2025-05-30Crypto + ML 1
2025-05-30Private Information Retrieval and Oblivious RAM
2025-05-30Secure Computation 3
2025-05-30Secure Computation 2
2025-05-30Secure Computation 1
2025-05-30Proofs - Practice 2