| Publication | Date of Publication | Type |
|---|
| A framework for practical anonymous credentials from lattices | 2024-02-02 | Paper |
| A thorough treatment of highly-efficient NTRU instantiations | 2023-11-24 | Paper |
| BLOOM: bimodal lattice one-out-of-many proofs and applications | 2023-08-21 | Paper |
| Efficient lattice-based blind signatures via Gaussian one-time signatures | 2023-08-10 | Paper |
| Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general | 2023-06-28 | Paper |
| Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations | 2023-05-26 | Paper |
| A non-PCP approach to succinct quantum-safe zero-knowledge | 2022-11-09 | Paper |
| Practical product proofs for lattice commitments | 2022-11-09 | Paper |
| Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions | 2022-10-13 | Paper |
| Practical non-interactive publicly verifiable secret sharing with thousands of parties | 2022-08-30 | Paper |
| Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings | 2022-08-19 | Paper |
| More efficient amortization of exact zero-knowledge proofs for LWE | 2022-06-24 | Paper |
| SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions | 2022-04-22 | Paper |
| Shorter lattice-based zero-knowledge proofs via one-time commitments | 2021-12-21 | Paper |
| Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs | 2020-05-20 | Paper |
| Worst-case hardness for LPN and cryptographic hashing via code smoothing | 2020-02-04 | Paper |
| Short discrete log proofs for FHE and ring-LWE ciphertexts | 2020-01-28 | Paper |
| More efficient commitments from structured lattice assumptions | 2018-10-17 | Paper |
| Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits | 2018-09-26 | Paper |
| Asymptotically efficient lattice-based digital signatures | 2018-09-14 | Paper |
| A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model | 2018-07-17 | Paper |
| Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs | 2018-07-09 | Paper |
| Amortization with fewer equations for proving knowledge of small secrets | 2017-10-27 | Paper |
| One-Shot Verifiable Encryption from Lattices | 2017-06-13 | Paper |
| Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware | 2017-05-16 | Paper |
| Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings | 2017-01-06 | Paper |
| The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs | 2016-10-21 | Paper |
| Tightly secure signatures from lossy identification schemes | 2016-09-21 | Paper |
| Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian Sampling in Structured Lattices | 2015-09-30 | Paper |
| Simple Lattice Trapdoor Sampling from a Broad Class of Distributions | 2015-08-27 | Paper |
| Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures | 2015-01-16 | Paper |
| Efficient Identity-Based Encryption over NTRU Lattices | 2015-01-06 | Paper |
| On Ideal Lattices and Learning with Errors over Rings | 2014-02-17 | Paper |
| Man-in-the-Middle Secure Authentication Schemes from LPN and Weak PRFs | 2013-09-17 | Paper |
| Lattice Signatures and Bimodal Gaussians | 2013-09-02 | Paper |
| A Toolkit for Ring-LWE Cryptography | 2013-05-31 | Paper |
| Lapin: An Efficient Authentication Protocol Based on Ring-LPN | 2013-01-08 | Paper |
| Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems | 2012-11-13 | Paper |
| From Selective to Full Security: Semi-generic Transformations in the Standard Model | 2012-07-20 | Paper |
| Tightly-Secure Signatures from Lossy Identification Schemes | 2012-06-29 | Paper |
| Lattice Signatures without Trapdoors | 2012-06-29 | Paper |
| On Ideal Lattices and Learning with Errors over Rings | 2010-06-01 | Paper |
| Public-Key Cryptographic Primitives Provably as Secure as Subset Sum | 2010-02-24 | Paper |
| Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures | 2009-12-15 | Paper |
| On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem | 2009-10-20 | Paper |
| A note on the distribution of the distance from a lattice | 2009-03-24 | Paper |
| SWIFFT: A Modest Proposal for FFT Hashing | 2008-09-18 | Paper |
| Lattice-Based Identification Schemes Secure Under Active Attacks | 2008-03-05 | Paper |
| Asymptotically Efficient Lattice-Based Digital Signatures | 2008-03-05 | Paper |
| Generalized Compact Knapsacks Are Collision Resistant | 2007-09-11 | Paper |
| On Bounded Distance Decoding for General Lattices | 2007-08-28 | Paper |
| Geometry of jump systems | 2006-07-25 | Paper |
| Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 2006-07-07 | Paper |
