Shafi Goldwasser
where else to find them
no profile links on file
what they talk about
all 9 in the filters
where they keep going back
no series more than once — all 11 in the filters
on a stage with
- Amir Yehudayoffonce
- Amy Ambroseonce
- Carson Youngonce
all 10 in the filters
who talks about the same things
- Yuval Ishai8 talks
- Ran Canetti7 talks
- Dan Boneh10 talks
- Yael Tauman Kalai9 talks
- Alessandro Chiesa7 talks
- Nadav Kohen5 talks
| title | conference | date |
|---|---|---|
| Crypto + ML 1 | Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025 | 2025-05-19 |
Shows that verification and attacks admit concrete crypto-style answers: PAC-verifiable for Fourier-sparse Boolean functions using Goldreich‑Levin-style checks… | ||
| Introduction and Research Fellows Lightning Talks | Eighth Annual Industry Day | 2022-11-16 |
Five-minute snapshots present concrete claims and tools: queueing work gives implementable rules (how many hardware priority buckets and handling unknown… | ||
| Verification Dilemmas, Law, and the Promise of Zero-Knowledge Proofs | 4th ZKProof Workshop (Home Edition) | 2021-04-19 |
Defines a formal notion called PAC verification and gives constructive protocols and lower bounds showing verification can be strictly easier than learning… | ||
| Interactive Proofs for Verifying Machine Learning | ITCS 2021 | 2021-01-06 |
Defines PAC verification (verifier with sample access plus an interactive prover) and gives concrete separations: realizable thresholds admit order 1/ε… | ||
| Opening Remarks | Wrong at the Root: Racial Bias and the Tension Between Numbers and Words in Non-Internet Data | 2019-06-05 |
Overview of workshop goals and concrete tensions: theoretical tools used to audit census confidentiality tools and to set mathematical limits on fairness… | ||
| Privacy Challenges in Machine Learning | ZK Day 2019: Blockchains, Micropayments and Zero Knowledge | 2019-04-13 |
Survey of concrete solutions: lattice-based cryptography (notably learning with errors) underlies NIST’s post‑quantum proposals and enables homomorphic and… | ||
| Public Accountability vs Secret Law: Can They Coexist | 2nd ZKProof Workshop 2019 | 2019-04-10 |
Claims a workable system that makes secret surveillance orders auditable while keeping contents hidden, using a public immutable ledger plus zero-knowledge… | ||
| From Basic Idea to Impact: the story of modern cryptography | Berkeley ACM A.M. Turing Laureate Colloquium 2018 | 2018-09-26 |
Chronicles how a handful of concrete ideas become everyday infrastructure: the 1976 Diffie-Hellman/RSA blueprint for public key systems that takes roughly 25… | ||
| The Computational Benefit of Correlated Instances | Learning, Algorithm Design and Beyond Worst-Case Analysis | 2016-11-14 |
Two theoretical papers claim concrete speedups when many instances share structure: for Boolean constraint‑satisfaction, order log n auxiliary instances… | ||
| The Computational Benefit of Correlated Instances | KARPfest80 | 2015-10-17 |
Defines a model where hard CSP instances come with extra correlated instances produced by small perturbations of the hidden solution, and studies two… | ||
| The Cryptographic Lens: Visions of our Past and Future | Symposium on Visions of the Theory of Computing 2013 | 2013-05-29 |
Cryptography reframes theory: zero-knowledge proofs let a verifier be convinced without learning a witness; interactive proofs expand verification power… | ||
| nothing matches | ||