| Publication | Date of Publication | Type |
|---|
| Hardness of the (approximate) shortest vector problem: a simple proof via Reed-Solomon codes | 2025-01-14 | Paper |
| Cryptanalysis of lattice-based sequentiality assumptions and proofs of sequential work | 2024-12-13 | Paper |
| Algebraically structured LWE, revisited | 2024-08-30 | Paper |
| Functional commitments for all functions, with transparent setup and from SIS | 2023-12-12 | Paper |
| Classical and quantum security of elliptic curve VRF, via relative indifferentiability | 2023-10-04 | Paper |
| Vector and functional commitments from lattices | 2023-04-13 | Paper |
| Improved discrete Gaussian and Subgaussian analysis for lattice cryptography | 2022-10-13 | Paper |
| Constraining and watermarking PRFs from milder assumptions | 2022-10-13 | Paper |
| Hardness of bounded distance decoding on lattices in lp norms | 2022-07-21 | Paper |
| He gives C-sieves on the CSIDH | 2022-03-23 | Paper |
| Lattice (List) Decoding Near Minkowski’s Inequality | 2022-02-17 | Paper |
| Outsourcing computation: the minimal refereed mechanism | 2020-06-30 | Paper |
| Noninteractive zero knowledge for NP from (Plain) Learning With Errors | 2020-05-20 | Paper |
| Algebraically structured LWE. Revisited | 2020-04-30 | Paper |
| More efficient commitments from structured lattice assumptions | 2018-10-17 | Paper |
| Privately constraining and programming PRFs, the LWE way | 2018-05-29 | Paper |
| New (and old) proof systems for lattice problems | 2018-05-29 | Paper |
| List-decoding Barnes-Wall lattices | 2017-10-18 | Paper |
| Pseudorandomness of ring-LWE for any ring and modulus | 2017-08-17 | Paper |
| Optimal Error Correction for Computationally Bounded Noise | 2017-07-27 | Paper |
| Multi-key FHE from LWE, revisited | 2016-12-22 | Paper |
| Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE | 2016-10-27 | Paper |
| How (not) to instantiate ring-LWE | 2016-10-21 | Paper |
| On Adaptively Secure Multiparty Computation with a Short CRS | 2016-10-21 | Paper |
| Recovering short generators of principal ideals in cyclotomic rings | 2016-07-15 | Paper |
| A decade of lattice cryptography | 2016-05-23 | Paper |
| SPRING: Fast Pseudorandom Functions from Rounded Ring Products | 2015-09-18 | Paper |
| Completely fair SFE and coalition-safe cheap talk | 2015-08-03 | Paper |
| Key-homomorphic constrained pseudorandom functions | 2015-07-06 | Paper |
| Public-key cryptosystems from the worst-case shortest vector problem | 2015-02-04 | Paper |
| Lattice cryptography for the internet | 2015-01-14 | Paper |
| Classical hardness of learning with errors | 2014-08-07 | Paper |
| New and improved key-homomorphic pseudorandom functions | 2014-08-07 | Paper |
| Faster Bootstrapping with Polynomial Error | 2014-08-07 | Paper |
| Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings | 2014-07-30 | Paper |
| On ideal lattices and learning with errors over rings | 2014-02-17 | Paper |
| How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE | 2014-01-24 | Paper |
| Hardness of SIS and LWE with small parameters | 2013-09-02 | Paper |
| Practical bootstrapping in quasilinear time | 2013-09-02 | Paper |
| A toolkit for ring-LWE cryptography | 2013-05-31 | Paper |
| Bonsai trees, or how to delegate a lattice basis | 2013-01-04 | Paper |
| Ring switching in BGV-style homomorphic encryption | 2012-09-25 | Paper |
| Circular and KDM security for identity-based encryption | 2012-07-20 | Paper |
| Trapdoors for lattices: simpler, tighter, faster, smaller | 2012-06-29 | Paper |
| Pseudorandom functions and lattices | 2012-06-29 | Paper |
| Identity-based (lossy) trapdoor functions and applications | 2012-06-29 | Paper |
| Generating shorter bases for hard random lattices | 2012-04-24 | Paper |
| Lossy Trapdoor Functions and Their Applications | 2012-03-15 | Paper |
| Bi-deniable public-key encryption | 2011-08-12 | Paper |
| Generating shorter bases for hard random lattices | 2011-05-23 | Paper |
| Better key sizes (and attacks) for LWE-based encryption | 2011-02-11 | Paper |
| An efficient and parallel Gaussian sampler for lattices | 2010-08-24 | Paper |
| On ideal lattices and learning with errors over rings | 2010-06-01 | Paper |
| Bonsai trees, or how to delegate a lattice basis | 2010-06-01 | Paper |
| Public-key encryption schemes with auxiliary inputs | 2010-02-24 | Paper |
| Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems | 2009-10-20 | Paper |
| Some Recent Progress in Lattice-Based Cryptography | 2009-03-03 | Paper |
| A Framework for Efficient and Composable Oblivious Transfer | 2009-02-10 | Paper |
| Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems | 2009-02-10 | Paper |
| Trapdoors for hard lattices and new cryptographic constructions | 2009-01-05 | Paper |
| Lossy trapdoor functions and their applications | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549647 | 2009-01-05 | Paper |
| SWIFFT: A Modest Proposal for FFT Hashing | 2008-09-18 | Paper |
| Limits on the hardness of lattice problems in \(\ell_{p}\) norms | 2008-08-20 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474183 | 2004-08-04 | Paper |
