Chris Peikert
where else to find them
github:cpeikert
bluesky:chrispeikert.bsky.social
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
- Benny Applebaumonce
- Huck Bennettonce
- Yael Tauman Kalaionce
all 4 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Improved Hardness of BDD and SVP Under Gap-(S)ETH | ITCS 2022 | 2022-01-31 |
Shows fine-grained hardness reductions from SAT to lattice problems using locally dense gadgets and two-point counts, proving BDD cannot be solved in 2^{o(n)}… | ||
| Panel Discussion: Computational Assumptions | Simons Institute Workshop: New Developments in Obfuscation | 2020-12-10 |
Debate-focused panel that argues specifics: who bets on PRG in NC0 versus structured assumptions like SXDH vulnerable to quantum, practical strength of LWE… | ||
| The Learning With Errors Problem and Cryptographic Applications | Lattices: Algorithms, Complexity, and Cryptography Boot Camp 2020 | 2020-01-21 |
Defines LWE with modulus q (typically polynomial in n) and Gaussian error (std ≈ √n), proves a quantum worst-case to average-case reduction from GapSVP/SIVP… | ||
| Algebraic Lattices and Ring Learning with Errors | Lattices: Algorithms, Complexity, and Cryptography Boot Camp 2020 | 2020-01-21 |
Defines Ring-LWE over integer polynomial rings, proves a quantum worst-case→average-case reduction from approximate SIVP on ideal lattices, and gives a… | ||
| Finding Short Generators of Principal Ideals | The Mathematics of Modern Cryptography | 2015-07-06 |
Given a principal ideal presented by a bad basis, the result proves a classical polynomial‑time method to recover the short generator (up to trivial unit… | ||
| nothing matches | ||