| 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
Journal of Cryptology | 2024-08-30 | Paper |
Functional commitments for all functions, with transparent setup and from SIS
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-12 | Paper |
Classical and quantum security of elliptic curve VRF, via relative indifferentiability
Topics in Cryptology – CT-RSA 2023 | 2023-10-04 | Paper |
| Vector and functional commitments from lattices | 2023-04-13 | Paper |
Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Constraining and watermarking PRFs from milder assumptions
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Hardness of bounded distance decoding on lattices in lp norms
(available as arXiv preprint) | 2022-07-21 | Paper |
| He gives C-sieves on the CSIDH | 2022-03-23 | Paper |
Lattice (List) Decoding Near Minkowski’s Inequality
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Outsourcing computation: the minimal refereed mechanism
(available as arXiv preprint) | 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
Computational Complexity | 2017-10-18 | Paper |
Pseudorandomness of ring-LWE for any ring and modulus
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Optimal Error Correction for Computationally Bounded Noise
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Multi-key FHE from LWE, revisited
Theory of Cryptography | 2016-12-22 | Paper |
Three’s Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
How (not) to instantiate ring-LWE
Lecture Notes in Computer Science | 2016-10-21 | Paper |
On Adaptively Secure Multiparty Computation with a Short CRS
Lecture Notes in Computer Science | 2016-10-21 | Paper |
Recovering short generators of principal ideals in cyclotomic rings
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
A decade of lattice cryptography
Foundations and Trends in Theoretical Computer Science | 2016-05-23 | Paper |
SPRING: Fast Pseudorandom Functions from Rounded Ring Products
Fast Software Encryption | 2015-09-18 | Paper |
Completely fair SFE and coalition-safe cheap talk
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing | 2015-08-03 | Paper |
Key-homomorphic constrained pseudorandom functions
Theory of Cryptography | 2015-07-06 | Paper |
Public-key cryptosystems from the worst-case shortest vector problem
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Lattice cryptography for the internet
Post-Quantum Cryptography | 2015-01-14 | Paper |
Classical hardness of learning with errors
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
New and improved key-homomorphic pseudorandom functions
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Faster Bootstrapping with Polynomial Error
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
On ideal lattices and learning with errors over rings
Journal of the ACM | 2014-02-17 | Paper |
How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
Applied Cryptography and Network Security | 2014-01-24 | Paper |
Hardness of SIS and LWE with small parameters
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Practical bootstrapping in quasilinear time
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 |
Bonsai trees, or how to delegate a lattice basis
Journal of Cryptology | 2013-01-04 | Paper |
Ring switching in BGV-style homomorphic encryption
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Circular and KDM security for identity-based encryption
Public Key Cryptography – PKC 2012 | 2012-07-20 | Paper |
Trapdoors for lattices: simpler, tighter, faster, smaller
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
Pseudorandom functions and lattices
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
Identity-based (lossy) trapdoor functions and applications
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
| Generating shorter bases for hard random lattices | 2012-04-24 | Paper |
Lossy Trapdoor Functions and Their Applications
SIAM Journal on Computing | 2012-03-15 | Paper |
Bi-deniable public-key encryption
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Generating shorter bases for hard random lattices
Theory of Computing Systems | 2011-05-23 | Paper |
Better key sizes (and attacks) for LWE-based encryption
Topics in Cryptology – CT-RSA 2011 | 2011-02-11 | Paper |
An efficient and parallel Gaussian sampler for lattices
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
On ideal lattices and learning with errors over rings
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Bonsai trees, or how to delegate a lattice basis
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Public-key encryption schemes with auxiliary inputs
Theory of Cryptography | 2010-02-24 | Paper |
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Some Recent Progress in Lattice-Based Cryptography
Theory of Cryptography | 2009-03-03 | Paper |
A Framework for Efficient and Composable Oblivious Transfer
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
Lecture Notes in Computer Science | 2009-02-10 | Paper |
Trapdoors for hard lattices and new cryptographic constructions
Proceedings of the fortieth annual ACM symposium on Theory of computing | 2009-01-05 | Paper |
Lossy trapdoor functions and their applications
Proceedings of the fortieth annual ACM symposium on Theory of computing | 2009-01-05 | Paper |
| scientific article; zbMATH DE number 5485483 (Why is no real title available?) | 2009-01-05 | Paper |
SWIFFT: A Modest Proposal for FFT Hashing
Fast Software Encryption | 2008-09-18 | Paper |
Limits on the hardness of lattice problems in \(\ell_{p}\) norms
Computational Complexity | 2008-08-20 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
| scientific article; zbMATH DE number 2081074 (Why is no real title available?) | 2004-08-04 | Paper |
