The Cryptographic Lens: Visions of our Past and Future

on YouTube ↗57m

" summary

Cryptography reframes theory: zero-knowledge proofs let a verifier be convinced without learning a witness; interactive proofs expand verification power (notably IP = PSPACE) and two noncommunicating provers boost it toward NEXP, enabling hardness-of-approximation results. Recent work shows a classical verifier can certify quantum polynomial-time computation by querying two entangled provers. Practical directions aim to make cloud servers both prove and compute efficiently (quasi‑linear verifier time) and to move beyond Gentry’s fully homomorphic encryption toward functional encryption that reveals only specific computation results.

AI-written summary · about

" chapters (36)

1. 0:00Intro
2. 7:05Unifying Theme
3. 10:15Computational Indistinguishability
4. 12:25Probability Distributions
5. 13:40axiomatic notions
6. 18:56Proofs
7. 25:46Interactive Proof
8. 26:28Zero Knowledge
9. 27:26Decoupling
10. 28:22Proof
11. 30:13Zero Knowledge Theorem
12. 31:41Lord Fourtner and Lon
13. 32:59The Verifier
14. 34:27The PCP Theorem
15. 35:18Quantum Proofers
16. 37:20Two Quantum Computers
17. 38:53Fears of Computing
18. 39:04The Cloud
19. 40:03Computation
20. 40:21Globalization of Knowledge
21. 40:58Challenge 1 Privacy
22. 41:17Challenge 2 Verification
23. 42:22The Problem
24. 42:59The Challenge
25. 43:33Models
26. 45:07Approximate answers
27. 46:23Challenge 2 Privacy
28. 46:53Challenge 3 Encryption
29. 47:21Fully Homomorphic Encryption
30. 47:57Craig Gentry
31. 49:36Examples
32. 51:06Surveillance Cameras
33. 51:40Suspect Database
34. 52:08The Third Example
35. 56:00The Cryptographic Lens
36. 56:26Conclusion

" related talks

• 10mCryptography 10 Years Later: Obfuscation, Proof Systems, and Secure ComputationAbhishek Jain · 9th Annual Simons Institute Industry Day
• 44mIOP based Zero-Knowledge ProofsAlessandro Chiesa · 2nd ZKProof Workshop 2019
• 12mThe Limits of Technology in Achieving PrivacyNeha Narula · DC Privacy Summit 2025
• 01h 15mTo interact or not to interact: Cryptographic proof systems and the Fiat-Shamir heuristicAlex Lombardi · Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
• 38mAdvisor-Verifier-Prover Games and the Hardness of Information Theoretic CryptographyBenny Applebaum · Minimal Complexity Assumptions for Cryptography 2023
• 01h 25mIntroduction to Verifiable ComputingAhto Truu · ACCU 2022
• 41mGKR based Zero-Knowledge ProofsYael Tauman Kalai · 2nd ZKProof Workshop 2019
• 54mVerification Dilemmas, Law, and the Promise of Zero-Knowledge ProofsShafi Goldwasser · 4th ZKProof Workshop (Home Edition)