Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025
2025-05-19..2025-05-23
Berkeley, United States
who it's for
cryptographers, secure computation researchers, obfuscation researchers, privacy engineers, applied crypto engineers, quantum cryptographers, machine learning security researchers
topics
Fiat-Shamir heuristic; zero-knowledge proofs for NP; succinct SNARG constructions; PCPs and vector commitments; private information retrieval (PIR); Path ORAM and Circuit-ORAM implementations; indistinguishability obfuscation from LPN+DLIN; randomized encodings and garbled circuits; quantum Fourier transform and period finding; homomorphic secret sharing for 2PC; pseudorandom correlation generators (PCGs); MPC preprocessing (Beaver triples, OT/OLE)
| title | author | length |
|---|---|---|
| To interact or not to interact: Cryptographic proof systems and the Fiat-Shamir heuristic | Alex Lombardi | 01h 15m |
Shows that zero-knowledge proofs for every NP language follow from one-way functions and that succinct arguments for NP use collision-resistant or vector… | ||
| Private Information Retrieval and Oblivious RAM | Elaine Shi | 01h 14m |
Survey condenses two concrete systems and their numbers: a tree/Circuit-ORAM implementation (used by Signal via a TEE but optimized to 20–50 microseconds per… | ||
| Obfuscation 1 | Amit Sahai | 01h 26m |
Claims a provable construction of indistinguishability obfuscation from three assumptions: LPN (moderate sparse errors) + local PRGs + DLIN over pairings. It… | ||
| Quantum 1 | Mark Zhandry | 01h 04m |
Quick quantum primer explains amplitudes, collapse, no cloning and why measurement changes later outcomes, then shows the algorithmic tool: the quantum Fourier… | ||
| Crypto + Meta-complexity 2 | Rafael Pass | 01h 17m |
Equivalence shows one-way functions ↔ average-case MKtP and the proof uses a conditional PRG notion plus an entropy-preserving strengthening to get density in… | ||
| Crypto + Meta-complexity 1 | Rafael Pass | 01h 06m |
Claim: average-case hardness of time‑bounded Kolmogorov complexity (KT/MKTP, uniform input) is equivalent to existence of one‑way functions; proof builds a… | ||
| Crypto + ML 2 | Nicholas Carlini | 57m |
Concrete demos and limits: practical attacks on watermarking, model extraction, and fine-tuning protections, plus what cryptography could formalize. Shows… | ||
| Crypto + ML 1 | Shafi Goldwasser | 01h 09m |
Shows that verification and attacks admit concrete crypto-style answers: PAC-verifiable for Fourier-sparse Boolean functions using Goldreich‑Levin-style checks… | ||
| Private Information Retrieval and Oblivious RAM | Elaine Shi | 01h 11m |
Signal runs Path ORAM for private contact discovery and achieves single-query latencies of 20–50 microseconds and ~200k qps on one machine; a reworked ORAM… | ||
| Secure Computation 3 | Peter Scholl | 01h 00m |
Shows a concrete route to sublinear 2PC: build homomorphic secret sharing for branching programs, use encrypted inputs plus secret-shared decryption key and a… | ||
| Secure Computation 2 | Elette Boyle | 01h 03m |
Describes a concrete workflow: generate input-independent correlated randomness for MPC so the online phase sends only masked wire values; shows many useful… | ||
| Secure Computation 1 | Peter Scholl | 01h 08m |
Quick tour of modern MPC with concrete trade-offs: honest‑majority uses Shamir secret sharing and degree reduction or Damgård‑Nielsen preprocessing to cut… | ||
| Proofs - Practice 2 | Justin Thaler | 01h 07m |
Explains why the sum-check protocol replaces heavy quotienting: it keeps prover work to field adds/muls, lets verifiers check huge sums by iterated univariate… | ||
| Proofs - Practice 1 | Justin Thaler | 01h 09m |
A practical SNARK pipeline converts a high-level program to a circuit (front-end) and runs a polynomial IOP plus a polynomial commitment (back-end); univariate… | ||
| Proofs - Theory | Yael Tauman Kalai | 01h 15m |
Survey of concrete SNARG progress and remaining barriers: shows an iO-based construction that achieves SNARGs for NP but relies on iO with subexponential… | ||
| Quantum 4 | Dakshita Khurana | 56m |
Quantum commitments and many other primitives can plausibly exist without one-way functions: oracle separations show pseudorandom state implies commitments and… | ||
| Quantum 3 | Dakshita Khurana | 01h 13m |
Covers concrete protocols built from Wiesner encodings (BB84-style states) and cryptographic tools: QKD via basis sampling and cut-and-choose checks; OT and… | ||
| Quantum 2 | Mark Zhandry | 58m |
Explains why lattice problems (SVP/CVP and LWE-style matrices) are the leading post-quantum tools, proves simple PRG composition still holds against QPT… | ||
| Foundations 2 | Iftach Haitner | 55m |
Best one-way-function PRG constructions use seed length n^3 and about n^3 oracle calls; black-box reductions cannot substantially beat that for length-doubling… | ||
| Foundations 1 | Iftach Haitner | 53m |
Claims a concrete path from one-way function → PRG via pseudoentropy: build G(x,h,i) that outputs f(x), h and a prefix of h·x whose length depends on x’s… | ||
| Obfuscation 2 | Aayush Jain | 58m |
Proves indistinguishability obfuscation from three assumptions: NC0 PRGs, LPN over large fields with error 1/l^delta, and bilinear maps (e.g. DLIN)… | ||
| nothing matches | ||