Obfuscation
2025-06-23..2025-06-27
Berkeley, United States
who it's for
indistinguishability obfuscation researchers, lattice cryptographers, complexity theorists, functional encryption and FHE researchers, quantum cryptographers, cryptographic primitives designers, graduate students in cryptography
topics
indistinguishability obfuscation (iO) constructions; lattice-based assumptions and LWE variants; bootstrapping encodings for unlimited depth; succinct randomized encodings and laconic evaluation; witness encryption and its variants; public-key encryption from planted clique; adaptively-sound SNARGs in CRS model; pv-IO and proof-verifiable obfuscation; pseudorandom obfuscation (PRO) notions; unclonable cryptography and quantum obfuscation
| title | author | length |
|---|---|---|
| Using the Planted Clique Conjecture for Cryptography: Public-Key Encryption from... | Riddhi Ghosal | 42m |
Claims a concrete construction of public-key encryption from planted clique combined with a mild noisy k-LIN over expanders assumption, giving a scheme that is… | ||
| Obfuscation via GGH15 Encodings, 10 Years Later | Hoeteck Wee | 51m |
Describes a concrete candidate obfuscator built from GGH15 encodings that aims to get iO, null‑iO and witness encryption, with security arguments for… | ||
| Pseudorandom Obfuscation | Nico Döttling | 01h 06m |
Defines pseudorandom obfuscation (PRO): if a circuit’s truth table is computationally indistinguishable from uniform then its obfuscation must also look… | ||
| A Pure Indistinguishability Obfuscation Approach to Adaptively-Sound SNARGs for NP | Brent Waters | 53m |
Constructs an adaptively-sound SNARG for NP in the CRS model from sub-exponential iO plus only sub-exponential one-way functions, removing the prior need for… | ||
| Toward Obfuscation from Affine Determinant Programs | Mark Zhandry | 56m |
Proposes using affine determinant programs (ADPs) as an alternative path to obfuscation, converting NC1 via branching programs and Kilian-style rerandomization… | ||
| Indistinguishability Obfuscation via Mathematical Proofs | Zhengzhong Jin | 01h 07m |
Claims a construction of iO for unbounded-input Turing machines whose equivalence is provable in Cook's Theory PV, removing the usual 2^{input-length} security… | ||
| Talk by Elaine Shi (Carnegie Mellon University) | Elaine Shi | 41m |
Claims a construction of quasi-linear EF iO that runs in time proportional to circuit size plus EF-proof size, assuming FHE, one-way functions and iO for… | ||
| Succinct Obfuscation via Propositional Proofs (or: How to use pv-IO) | Surya Mathialagan | 46m |
Constructs a notion of fully succinct pv-IO that makes an obfuscation size depend only on the secret part of a program, not the public description or input… | ||
| Running Circuits of Unbounded Depth over Encrypted Data, Securely, Using Lattices... | Ji Luo | 46m |
Introduces a lattice-only bootstrapping that converts large-noise BGG+ encodings into fresh, moderate-noise encodings so homomorphic evaluation proceeds to… | ||
| Succinct Randomized Encodings from Laconic Function Evaluation, Faster and Simpler | Rachit Garg | 37m |
Claims construction under Circular LWE that yields succinct randomized encodings with encoding time roughly t^ε · s for any small constant ε<1, improving on… | ||
| Succinct Randomized Encodings from Lattices | Giulio Malavolta | 01h 05m |
Construction gives witness encryption for P and hence succinct randomized encodings with runtime and memory cost polylogarithmic in program time T and memory… | ||
| From Program Obfuscation to Unclonable Cryptography | Prabhanjan Ananth | 01h 03m |
Claims new obfuscation variants and reductions that tie indistinguishability obfuscation plus injective one‑way functions to unclonable primitives: a… | ||
| An Introduction to Quantum Obfuscation | James Bartusek | 59m |
Survey of what is known: obfuscation is now achievable for limited quantum classes under classical-to-quantum obfuscator constructions in the classical-oracle… | ||
| Obfuscation of Unitary Quantum Programs | Er-Cheng Tang | 46m |
Claims an ideal obfuscation for unitary functionalities in the classical-oracle model and constructs an obfuscator that outputs authenticated ciphertexts, EPR… | ||
| Diamond iO: Lattice-Based Obfuscation without Bootstrapping from Functional Encryption, toward... | Sora Suegami | 36m |
Claims a lattice iO that removes FE-to-iO bootstrapping by replacing recursive FE encryption with matrix multiplications and a non‑black‑box use of AKY24’s… | ||
| Computing on Encrypted Data via Secret Dual Codes | Yuval Ishai | 01h 07m |
Claim: a secret-key scheme lets a client upload an encrypted large X and issue unbounded hidden queries q with sublinear download and only a short secret key… | ||
| Somewhat Homomorphic Encryption from Linear Homomorphism and Sparse LPN | Alexandra Henzinger | 52m |
Construction claims somewhat homomorphic encryption from sparse LPN plus a standard assumption that yields linearly homomorphic encryption (e.g., DDH or DCR)… | ||
| Lower Bounds on the Overhead of Indistinguishability Obfuscation | Noam Mazor | 49m |
Under the assumption NP not in BPP the work proves a concrete inefficiency: efficient iO for multi-output Boolean circuits must add about s/log s additive… | ||
| Lattice-Based Post-Quantum iO from Circular Security with Random Opening Assumption | Yao Ching Hsieh | 01h 04m |
Presents a concrete construction of lattice-based post-quantum xiO that reduces to a new assumption called Circular Security with Random Opening and specifies… | ||
| Lattice Assumptions with Hints: Succinct LWE and its Applications | David Wu | 57m |
Proposes a family of succinct LWE assumptions and shows how a public trapdoor yields a practical matrix commitment that compresses n×L matrices to n×m… | ||
| Computational Wiretap Coding from Indistinguishability Obfuscation | Paul Lou | 32m |
Construction shows: under standard sub-exponential assumptions that imply indistinguishability obfuscation plus injective PRGs, every non-degraded binary-input… | ||
| Beyond P versus NP: Using Complexity Theory in Obfuscation and Vice-Versa | Rahul Ilango, Alex Lombardi | 59m |
Claim: iO plus stronger-than-P≠NP complexity assumptions yields cryptographic objects whose hardness matches naive attacks. Techniques combine… | ||
| Towards general-purpose program obfuscation via local mixing | Ran Canetti, Claudio Chamon, Eduardo R. Mucciolo, Andrei E. Ruckenstein | 01h 06m |
Proposes turning reversible circuits into obfuscated versions by repeated local mixing: pick constant-size contiguous gate slices, enumerate functionally… | ||
| Indistinguishability Obfuscation from Bilinear Maps and LPN Variants | Neekon Vafa | 46m |
Constructs indistinguishability obfuscation from three assumptions: bilinear maps, large-field LPN, and a new local functions with noise (LFN) assumption that… | ||
| Something about new average-case hard problems? | Tselil Schramm | 01h 07m |
Tutorial-style exposition of the low-degree polynomials model uses the sum of squared low-degree Fourier/Hermite coefficients — called the low-degree… | ||
| Expedition to Obfustopia: Indistinguishability Obfuscation from Well-Studied Assumptions to New... | Rachel Lin | 01h 08m |
Claims a provable route to indistinguishability obfuscation built from three well-studied assumptions (LPN over large fields, simple local PRGs computable in… | ||
| nothing matches | ||