Justin Thaler
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
- DC Privacy Summit2 editions2024–2025
all 6 in the filters
on a stage with
- Abhi Shelatonce
who talks about the same things
- Abhi Shelat4 talks
- Keerthana Ganesh2 talks
- Dan Boneh10 talks
- Norbert Vadas3 talks
- Izaak Meckler4 talks
- Shafi Goldwasser13 talks
| title | conference | date |
|---|---|---|
| What ZK Can—and Can’t—Do for You | DC Privacy Summit 2025 | 2025-10-16 |
Zero-knowledge SNARKs power a privacy layer in Google Wallet that runs on phone and proves attributes like age without sending ID photos; credentials are… | ||
| Twist and Shout: Fast, Simple Memory Arguments | Proofs (Simons Institute) | 2025-07-11 |
Two new memory-checking arguments, Twist and Shout, turn lookup-heavy proofs into practical zkVM plumbing: Shout gives a batch-evaluation/lookup protocol with… | ||
| Proofs - Practice 2 | Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025 | 2025-05-19 |
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 | Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025 | 2025-05-19 |
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… | ||
| The science of zero-knowledge | DC Privacy Summit 2024 | 2024-10-24 |
a16z’s team ties cryptography to engineering to push snarks from theory to practice, using the sumcheck protocol as the key tool to make proof generation… | ||
| SNARKs from the sum-check protocol | 4th ZKProof Workshop (Home Edition) | 2021-04-19 |
Explains how the sum-check protocol underpins a three-step snark design: produce a polynomial IOP + polynomial commitment, apply Fiat–Shamir, and get a… | ||
| Quantum Algorithms for Composed Functions With Shared Inputs | Interactive Complexity 2018 | 2018-10-15 |
Shows that composing any outer Boolean F with shared-input OR gates has quantum query complexity ~O(polylog(n) sqrt(n Q(F))) so the bound is the geometric… | ||
| Hardness Amplification and the Approximate Degree of Constant-Depth Circuits | Neo-Classical Methods in Discrete Analysis 2013 | 2013-12-02 |
Shows a lossless linear-program dual view using dual LP / dual polynomials to prove approximate-degree lower bounds, with an explicit combining trick (feed… | ||
| nothing matches | ||