Amit Sahai
where else to find them
what they talk about
where they keep going back
no series more than once — all 8 in the filters
on a stage with
- Alexis Korbonce
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Obfuscation 1 | Cryptography 10 Years Later: Obfuscation, Proof Systems, and Secure Computation Boot Camp 2025 | 2025-05-19 |
Claims a provable construction of indistinguishability obfuscation from three assumptions: LPN (moderate sparse errors) + local PRGs + DLIN over pairings. It… | ||
| Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness | Minimal Complexity Assumptions for Cryptography 2023 | 2023-05-01 |
Proves a concrete conditional separation: assuming UP not in RP (which follows from injective one‑way functions), with probability 1 over a random oracle O one… | ||
| LPN Based IO Part 1 | Simons Institute Workshop: New Developments in Obfuscation | 2020-12-10 |
Claims IO from four sub-exponential assumptions: LPN over Zp (error probability 1/l^delta against 2^{l^epsilon} attackers), LWE, NC0 PRGs and SXDH. Builds a… | ||
| Obfuscation IV: A New Assumption enabling iO | Lattices: New Cryptographic Capabilities 2020 | 2020-03-23 |
Conjectures that invertibility of random low‑constant‑degree polynomial systems over the integers yields iO: sample n variables, n^{1+ε} polynomials with each… | ||
| MPC-in-the-Head based Zero Knowledge Proofs | 2nd ZKProof Workshop 2019 | 2019-04-10 |
Framework claims that MPC-in-the-head yields practical zero-knowledge by having a prover hallucinate an honest-majority MPC, commit to each server’s… | ||
| Obfuscation: Past, Present, and Possible Futures | Securing Computation (Simons Institute, June 2015) | 2015-06-08 |
Claims a concrete route to indistinguishability obfuscation by encoding matrix branching programs into candidate multilinear maps and proving security under a… | ||
| Obfuscation I | Cryptography Boot Camp 2015 | 2015-05-18 |
Proposes a concrete candidate for indistinguishability obfuscation that encodes matrix branching programs with Kilian randomization and multilinear-map… | ||
| Obfuscation II | Cryptography Boot Camp 2015 | 2015-05-18 |
Candidate obfuscator compiles circuits into a matrix branching program randomized by Kilian randomization and protected by multilinear encodings and per-input… | ||
| How to Encrypt a Functionality | Quantum Games and Protocols | 2014-02-24 |
Claims a concrete candidate for indistinguishability obfuscation built from a new “algebraic jigsaw puzzle” instantiation of approximate multilinear maps… | ||
| nothing matches | ||