| Publication | Date of Publication | Type |
|---|
| Post-quantum online/offline signatures | 2025-10-31 | Paper |
| Revisiting key decomposition techniques for FHE: simpler, faster and more generic | 2025-07-23 | Paper |
| To attest or not to attest, this is the question -- provable attestation in FIDO2 | 2024-09-13 | Paper |
The return of the SDitH
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Manticore: a framework for efficient multiparty computation supporting real number and Boolean arithmetic
Journal of Cryptology | 2023-08-22 | Paper |
CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
Journal of Mathematical Cryptology | 2021-05-03 | Paper |
| High-precision privacy-preserving real-valued function evaluation | 2021-03-17 | Paper |
TFHE: fast fully homomorphic encryption over the torus
Journal of Cryptology | 2020-03-03 | Paper |
New directions in nearest neighbor searching with applications to lattice sieving
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE | 2018-04-06 | Paper |
Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
Advances in Cryptology – ASIACRYPT 2016 | 2017-02-01 | Paper |
Structural lattice reduction: generalized worst-case to average-case reductions and homomorphic cryptosystems
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
A homomorphic LWE based E-voting scheme
Post-Quantum Cryptography | 2016-04-26 | Paper |
A sieve algorithm based on overlattices
LMS Journal of Computation and Mathematics | 2014-09-05 | Paper |
Efficient multiplication over extension fields
Arithmetic of Finite Fields | 2012-11-01 | Paper |
The degree of regularity of HFE systems
Advances in Cryptology - ASIACRYPT 2010 | 2010-12-07 | Paper |
Smallest Reduction Matrix of Binary Quadratic Forms
Lecture Notes in Computer Science | 2010-09-29 | Paper |
Lattice enumeration using extreme pruning
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Compact Normal Form for Regular Languages as Xor Automata
Implementation and Application of Automata | 2009-07-09 | Paper |
| Finding short lattice vectors within Mordell's inequality | 2009-01-05 | Paper |
Predicting Lattice Reduction
Advances in Cryptology – EUROCRYPT 2008 | 2008-04-15 | Paper |
Symplectic Lattice Reduction and NTRU
Advances in Cryptology - EUROCRYPT 2006 | 2007-09-24 | Paper |
New Chosen-Ciphertext Attacks on NTRU
Public Key Cryptography – PKC 2007 | 2007-09-04 | Paper |
Rankin’s Constant and Blockwise Lattice Reduction
Lecture Notes in Computer Science | 2007-09-04 | Paper |
