| Publication | Date of Publication | Type |
|---|
| Efficient verifiable mixnets from lattices, revisited | 2025-07-29 | Paper |
A framework for practical anonymous credentials from lattices
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
A thorough treatment of highly-efficient NTRU instantiations
Lecture Notes in Computer Science | 2023-11-24 | Paper |
BLOOM: bimodal lattice one-out-of-many proofs and applications
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-21 | Paper |
Efficient lattice-based blind signatures via Gaussian one-time signatures
Public-Key Cryptography – PKC 2022 | 2023-08-10 | Paper |
Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
Lecture Notes in Computer Science | 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
Post-Quantum Cryptography | 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
Computer Security -- ESORICS 2015 | 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
Journal of Cryptology | 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
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware
IEEE Transactions on Computers | 2017-05-16 | Paper |
Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
The whole is less than the sum of its parts: constructing more efficient lattice-based AKEs
Lecture Notes in Computer Science | 2016-10-21 | Paper |
Tightly secure signatures from lossy identification schemes
Journal of Cryptology | 2016-09-21 | Paper |
Quadratic time, linear space algorithms for Gram-Schmidt orthogonalization and Gaussian sampling in structured lattices
Advances in Cryptology -- EUROCRYPT 2015 | 2015-09-30 | Paper |
Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
Lecture Notes in Computer Science | 2015-08-27 | Paper |
Better zero-knowledge proofs for lattice encryption and their application to group signatures
Lecture Notes in Computer Science | 2015-01-16 | Paper |
Efficient identity-based encryption over NTRU lattices
Lecture Notes in Computer Science | 2015-01-06 | Paper |
On ideal lattices and learning with errors over rings
Journal of the ACM | 2014-02-17 | Paper |
Man-in-the-middle secure authentication schemes from LPN and weak PRFs
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Lattice signatures and bimodal Gaussians
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
A toolkit for ring-LWE cryptography
Advances in cryptology -- EUROCRYPT 2013. 32nd annual international conference on the theory and applications of cryptographic techniques, Athens, Greece, May 26--30, 2013. Proceedings | 2013-05-31 | Paper |
Lapin: an efficient authentication protocol based on ring-LPN
Fast Software Encryption | 2013-01-08 | Paper |
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
Cryptographic Hardware and Embedded Systems – CHES 2012 | 2012-11-13 | Paper |
From selective to full security: semi-generic transformations in the standard model
Public Key Cryptography – PKC 2012 | 2012-07-20 | Paper |
Lattice signatures without trapdoors
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
Tightly-secure signatures from lossy identification schemes
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
On ideal lattices and learning with errors over rings
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Theory of Cryptography | 2010-02-24 | Paper |
Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
A note on the distribution of the distance from a lattice
Discrete & Computational Geometry | 2009-03-24 | Paper |
SWIFFT: A Modest Proposal for FFT Hashing
Fast Software Encryption | 2008-09-18 | Paper |
Asymptotically Efficient Lattice-Based Digital Signatures
Theory of Cryptography | 2008-03-05 | Paper |
Lattice-Based Identification Schemes Secure Under Active Attacks
Public key cryptography -- PKC 2008. 11th international workshop on practice and theory in public-key cryptography, Barcelona, Spain, March 9--12, 2008. Proceedings | 2008-03-05 | Paper |
Generalized Compact Knapsacks Are Collision Resistant
Automata, Languages and Programming | 2007-09-11 | Paper |
On Bounded Distance Decoding for General Lattices
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
Geometry of jump systems
Rocky Mountain Journal of Mathematics | 2006-07-25 | Paper |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2006-07-07 | Paper |
