To interact or not to interact: Cryptographic proof systems and the Fiat-Shamir heuristic
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=T9rrEnDUOAo
3Alex 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-06-26 | Expedition to Obfustopia: Indistinguishability Obfuscation from Well-Studied Assumptions to New... |
| 2025-06-25 | To interact or not to interact: Cryptographic proof systems and the Fiat-Shamir heuristic |
| 2025-06-18 | Succinct arguments for QMA from standard assumptions, without quantum PCPs |
| 2025-05-30 | Crypto + Meta-complexity 2 |
| 2025-05-30 | Crypto + Meta-complexity 1 |
| 2025-05-30 | Crypto + ML 2 |
| 2025-05-30 | Crypto + ML 1 |
| 2025-05-30 | Private Information Retrieval and Oblivious RAM |
| 2025-05-30 | Secure Computation 3 |
| 2025-05-30 | Secure Computation 2 |
| 2025-05-30 | Secure Computation 1 |
| 2025-05-30 | Proofs - Practice 2 |
| 2025-05-30 | Proofs - Practice 1 |
| 2025-05-30 | Proofs - Theory |
| 2025-05-30 | Quantum 4 |
| 2025-05-30 | Quantum 3 |
| 2025-05-30 | Quantum 2 |
| 2025-05-30 | Foundations 2 |
| 2025-05-18 | Foundations 1 |
| 2025-05-01 | Future Directions In AI Safety Research |
| 2025-04-27 | Introduction (Sanjit Seshia) |