| Publication | Date of Publication | Type |
|---|
| SHIP: a shallow and highly parallelizable CKKS bootstrapping algorithm | 2025-11-20 | Paper |
| Plaintext-ciphertext matrix multiplication and FHE bootstrapping: fast and fused | 2024-12-13 | Paper |
| Bootstrapping bits with CKKS | 2024-11-12 | Paper |
| Efficient updatable public-key encryption from lattices | 2024-09-13 | Paper |
| G+G: a Fiat-Shamir lattice signature based on convolved Gaussians | 2024-08-30 | Paper |
| Ideal-SVP is hard for small-norm uniform prime ideals | 2024-08-15 | Paper |
| Round-optimal lattice-based threshold signatures, revisited | 2024-06-24 | Paper |
HERMES: efficient ring packing using MLWE ciphertexts and application to transciphering
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
A detailed analysis of Fiat-Shamir with aborts
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
On module unique-SVP and NTRU
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
On rejection sampling in Lyubashevsky's signature scheme
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-21 | Paper |
On the hardness of the NTRU problem
Lecture Notes in Computer Science | 2023-05-12 | Paper |
| An Anonymous Trace-and-Revoke Broadcast Encryption Scheme | 2023-04-13 | Paper |
| Faster enumeration-based lattice reduction: root Hermite factor \(k^{1/(2k)}\) time \(k^{k/8+o(k)}\) | 2022-11-09 | Paper |
| On the integer polynomial learning with errors problem | 2021-12-21 | Paper |
| Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security | 2021-12-01 | Paper |
| MPSign: a signature from small-secret middle-product learning with errors | 2021-12-01 | Paper |
Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
Journal of Cryptology | 2021-07-30 | Paper |
Computing an LLL-reduced basis of the orthogonal latice
Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation | 2020-09-09 | Paper |
| Towards practical GGM-based PRF from (module-)learning-with-rounding | 2020-07-21 | Paper |
On the smoothing parameter and last minimum of random orthogonal lattices
Designs, Codes and Cryptography | 2020-05-21 | Paper |
| An LLL algorithm for module lattices | 2020-05-05 | Paper |
| Approx-SVP in ideal lattices with pre-processing | 2020-02-06 | Paper |
Cryptanalysis of the CLT13 multilinear map
Journal of Cryptology | 2019-06-20 | Paper |
| Measuring, simulating and exploiting the head concavity phenomenon in BKZ | 2018-12-20 | Paper |
| Adaptively secure distributed PRFs from LWE | 2018-12-06 | Paper |
| On the ring-LWE and polynomial-LWE problems | 2018-07-09 | Paper |
Learning with errors and extrapolated dihedral cosets
(available as arXiv preprint) | 2018-05-29 | Paper |
Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
Journal of Cryptology | 2018-05-28 | Paper |
Hardness of \(k\)-LWE and applications in traitor tracing
Algorithmica | 2018-01-05 | Paper |
| scientific article; zbMATH DE number 6820265 (Why is no real title available?) | 2017-12-19 | Paper |
| All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE | 2017-10-27 | Paper |
| Middle-product Learning with Errors | 2017-10-27 | Paper |
Decoding by Sampling: A Randomized Lattice Algorithm for Bounded Distance Decoding
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Decoding by Embedding: Correct Decoding Radius and DMT Optimality
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Semantically Secure Lattice Codes for the Gaussian Wiretap Channel
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Faster LLL-type Reduction of Lattice Bases
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation | 2017-05-10 | Paper |
Tuple lattice sieving
LMS Journal of Computation and Mathematics | 2017-04-04 | Paper |
A new view on HJLS and PSLQ: sums and projections of lattices
Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation | 2017-02-10 | Paper |
Fully secure functional encryption for inner products, from standard assumptions
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Sanitization of FHE ciphertexts
Advances in Cryptology – EUROCRYPT 2016 | 2016-09-09 | Paper |
Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
Breaking Littlewood's cipher
Cryptologia | 2015-11-13 | Paper |
LLL reducing with the most significant bits
Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation | 2015-11-11 | Paper |
Cryptanalysis of the multilinear map over the integers
Advances in Cryptology -- EUROCRYPT 2015 | 2015-09-30 | Paper |
Fully homomophic encryption over the integers revisited
Advances in Cryptology -- EUROCRYPT 2015 | 2015-09-30 | Paper |
Worst-case to average-case reductions for module lattices
Designs, Codes and Cryptography | 2015-05-21 | Paper |
Low-dimensional lattice basis reduction revisited
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Classical hardness of learning with errors
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Hardness of \(k\)-LWE and applications in traitor tracing
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
An LLL-reduction algorithm with quasi-linear time complexity, extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
GGHLite: more efficient multilinear maps from ideal lattices
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Lattice-based group signatures with logarithmic signature size
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
Public-Key Cryptography – PKC 2013 | 2013-04-19 | Paper |
Perturbation analysis of the QR factor R in the context of LLL lattice basis reduction
Mathematics of Computation | 2012-06-29 | Paper |
H-LLL: using Householder inside LLL
Proceedings of the 2009 international symposium on Symbolic and algebraic computation | 2012-05-13 | Paper |
Analyzing blockwise lattice algorithms using dynamical systems
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
Algorithms for the shortest and closest lattice vector problems
Lecture Notes in Computer Science | 2011-06-08 | Paper |
Making NTRU as secure as worst-case problems over ideal lattices
Advances in Cryptology – EUROCRYPT 2011 | 2011-05-27 | Paper |
Rigorous Perturbation Bounds of Some Matrix Factorizations
SIAM Journal on Matrix Analysis and Applications | 2011-03-02 | Paper |
Faster fully homomorphic encryption
Advances in Cryptology - ASIACRYPT 2010 | 2010-12-07 | Paper |
On the Extremality of an 80-Dimensional Lattice
Lecture Notes in Computer Science | 2010-09-29 | Paper |
Short bases of lattices over number fields
Lecture Notes in Computer Science | 2010-09-29 | Paper |
Accelerating lattice reduction with FPGAs
Lecture Notes in Computer Science | 2010-08-31 | Paper |
An LLL algorithm with quadratic complexity
SIAM Journal on Computing | 2010-07-07 | Paper |
Floating-Point LLL: Theoretical and Practical Aspects
The LLL Algorithm | 2010-03-05 | Paper |
Efficient public key encryption based on ideal lattices (extended abstract)
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
| Handbook of Floating-Point Arithmetic | 2009-05-26 | Paper |
Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
Advances in Cryptology - CRYPTO 2007 | 2009-03-10 | Paper |
Rigorous and Efficient Short Lattice Vectors Enumeration
Advances in Cryptology - ASIACRYPT 2008 | 2009-02-10 | Paper |
Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format
Reliable Implementation of Real Number Algorithms: Theory and Practice | 2009-01-13 | Paper |
Floating-Point LLL Revisited
Lecture Notes in Computer Science | 2008-05-06 | Paper |
Speeding-Up Lattice Reduction with Random Projections (Extended Abstract)
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Algorithmic Number Theory
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Algorithmic Number Theory
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Searching worst cases of a one-variable function using lattice reduction
IEEE Transactions on Computers | 2007-01-09 | Paper |
Algorithmic Number Theory
Lecture Notes in Computer Science | 2005-08-12 | Paper |
Algorithmic Number Theory
Lecture Notes in Computer Science | 2005-08-12 | Paper |
