Daniel Wichs
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 8 in the filters
on a stage with
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Succinct Non-interactive Arguments of Proximity | Proofs (Simons Institute) | 2025-07-11 |
Constructs succinct noninteractive arguments of proximity (SNAPs) with tight parameters: adaptive SNAPs for P achieve O(n^{1/2}) proof length, verifier query… | ||
| Doubly Efficient Private Information Retrieval and Fully Homomorphic RAM Computation from Ring LWE | Minimal Complexity Assumptions for Cryptography 2023 | 2023-05-01 |
Constructs the first unkeyed schemes that make single-server private reads and RAM-style FHE practical under Ring LWE, turning PIR into evaluation of a… | ||
| Small-Box Cryptography | ITCS 2022 | 2022-01-31 |
Three-step recipe gives concrete security bounds for SPN/AES-style designs: a reduced-round proof, a hardness-amplification cascade, and the Big-to-Small… | ||
| Circularity Based IO, Part 3 | Simons Institute Workshop: New Developments in Obfuscation | 2020-12-10 |
Proposes that Oblivious-LWE sampling plus LWE gives a simulation-secure Dual-GSW split-FHE which implies IO; shows single-opening security by adding a fresh… | ||
| Multi-key FHE and Spooky Encryption | Lattices: New Cryptographic Capabilities 2020 | 2020-03-23 |
Defines multi-key FHE that converts per-user GSW ciphertexts (all reusing a public matrix B) into a single expanded ciphertext under a concatenated secret so… | ||
| Homomorphic Commitments & Signatures | The Mathematics of Modern Cryptography | 2015-07-06 |
Constructs homomorphic signatures for arbitrary circuits (leveled) where certificate size depends on circuit depth but not data size, built from equivocable… | ||
| Two Round MPC via Multi-Key FHE | Securing Computation (Simons Institute, June 2015) | 2015-06-08 |
Constructs two-round MPC from LWE by simplifying a GSW-style multi-key FHE so independent public keys encrypt into an expanded ciphertext space, then… | ||
| Oblivious RAM I | Cryptography Boot Camp 2015 | 2015-05-18 |
Describes why encrypted memory leaks via access patterns in SGX and cloud settings then gives concrete ORAM constructions, costs, and implementations. Tree… | ||
| Oblivious RAM II | Cryptography Boot Camp 2015 | 2015-05-18 |
Describes two concrete advances and what they actually build: an OnionORAM that achieves constant communication per access by shaving the usual log N factor at… | ||
| nothing matches | ||