Daniele Micciancio
where else to find them
what they talk about
where they keep going back
no series more than once — all 3 in the filters
on a stage with
never shared a talk
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Mathematics of Lattices | Lattices: Algorithms, Complexity, and Cryptography Boot Camp 2020 | 2020-01-21 |
Straightforward introduction to lattice math with no new results: precise definitions (determinant, successive minima, covering radius), basic theorems… | ||
| The Short Integer Solutions Problem and Cryptographic Applications | Lattices: Algorithms, Complexity, and Cryptography Boot Camp 2020 | 2020-01-21 |
Defines SIS as solving A·x ≡ y (mod q) for short x (typically n, m, q matrix A and x in {0,1}^m), proves average-case hardness by reducing worst-case lattice… | ||
| Lattice-Based Zero Knowledge and Applications | ZK Day 2019: Blockchains, Micropayments and Zero Knowledge | 2019-04-13 |
Gives interactive zero‑knowledge proofs for lattice problems and shows the closest‑vector language lies in SZK, ruling out NP‑hardness for useful approximation… | ||
| Historical Talk on Lattice-Based Cryptography | The Mathematics of Modern Cryptography | 2015-07-06 |
Ajtai’s 1996 paper introduces a worst-case to average-case reduction for lattice problems and spawns the SIS/LWE reductions that underpin modern schemes; 1998… | ||
| nothing matches | ||