| Publication | Date of Publication | Type |
|---|
Hintless single-server private information retrieval
| 2024-12-13 | Paper |
SoK: learning with errors, circular security, and fully homomorphic encryption
| 2024-11-12 | Paper |
Faster amortized FHEW bootstrapping using ring automorphisms
| 2024-11-12 | Paper |
Error correction and ciphertext quantization in lattice cryptography
Advances in Cryptology – CRYPTO 2023 | 2024-02-06 | Paper |
Efficient FHEW bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-12 | Paper |
Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-16 | Paper |
Securing approximate homomorphic encryption using differential privacy
Advances in Cryptology – CRYPTO 2022 | 2023-06-12 | Paper |
Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
| 2023-03-21 | Paper |
Homomorphic Encryption Standard
Protecting Privacy through Homomorphic Encryption | 2022-11-02 | Paper |
Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
Lecture Notes in Computer Science | 2022-10-13 | Paper |
On the security of homomorphic encryption on approximate numbers
| 2021-12-08 | Paper |
Homomorphic encryption for finite automata
| 2020-05-05 | Paper |
Building an efficient lattice gadget toolkit: Subgaussian sampling and more
| 2020-02-06 | Paper |
Symbolic encryption with pseudorandom keys
| 2020-02-04 | Paper |
Algorithms for the densest sub-lattice problem
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
On the hardness of learning with errors with binary secrets
Theory of Computing | 2019-01-31 | Paper |
Asymptotically efficient lattice-based digital signatures
Journal of Cryptology | 2018-09-14 | Paper |
On the bit security of cryptographic primitives
| 2018-07-09 | Paper |
Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
| 2018-07-09 | Paper |
Equational security proofs of oblivious transfer protocols
| 2018-05-16 | Paper |
Gaussian sampling over the integers: efficient, generic, constant-time
| 2017-11-15 | Paper |
Fast lattice point enumeration with minimal overhead
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
An equational approach to secure multi-party computation
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
A linear space algorithm for computing the hermite normal form
Proceedings of the 2001 international symposium on Symbolic and algebraic computation | 2017-02-03 | Paper |
Compactness vs collusion resistance in functional encryption
Theory of Cryptography | 2016-12-22 | Paper |
Practical, Predictable Lattice Basis Reduction
Advances in Cryptology – EUROCRYPT 2016 | 2016-09-09 | Paper |
FHEW: bootstrapping homomorphic encryption in less than a second
Advances in Cryptology -- EUROCRYPT 2015 | 2015-09-30 | Paper |
Simultaneous broadcast revisited
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Improved short lattice signatures in the standard model
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Faster exponential time algorithms for the shortest vector problem
| 2014-05-22 | Paper |
A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
SIAM Journal on Computing | 2013-09-25 | Paper |
Hardness of SIS and LWE with small parameters
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Inapproximability of the shortest vector problem: toward a deterministic reduction
Theory of Computing | 2012-09-27 | Paper |
Trapdoors for lattices: simpler, tighter, faster, smaller
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
The geometry of lattice cryptography
Foundations of Security Analysis and Design VI | 2011-09-16 | Paper |
Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
Advances in Cryptology – CRYPTO 2011 | 2011-08-12 | Paper |
scientific article; zbMATH DE number 5764780 (Why is no real title available?)
| 2010-08-06 | Paper |
Improved cryptographic hash functions with worst-case/average-case connection
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Computational soundness, co-induction, and encryption cycles
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Cryptographic functions from worst-case complexity assumptions
The LLL Algorithm | 2010-03-05 | Paper |
The RSA group is pseudo-free
Journal of Cryptology | 2010-03-01 | Paper |
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2009-05-14 | Paper |
Lattice-based Cryptography
Post-Quantum Cryptography | 2009-03-12 | Paper |
SWIFFT: A Modest Proposal for FFT Hashing
Fast Software Encryption | 2008-09-18 | Paper |
The RSA Group is Pseudo-Free
Lecture Notes in Computer Science | 2008-05-06 | Paper |
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
SIAM Journal on Computing | 2008-03-28 | Paper |
Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
Computational Complexity | 2008-03-11 | Paper |
Asymptotically Efficient Lattice-Based Digital Signatures
Theory of Cryptography | 2008-03-05 | Paper |
The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization
Theory of Cryptography | 2008-03-05 | Paper |
Advances in Cryptology - CRYPTO 2003
Lecture Notes in Computer Science | 2007-11-28 | Paper |
Advances in Cryptology - EUROCRYPT 2004
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Generalized Compact Knapsacks Are Collision Resistant
Automata, Languages and Programming | 2007-09-11 | Paper |
Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption
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 |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
The complexity of the covering radius problem
Computational Complexity | 2006-02-07 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Hardness of approximating the minimum distance of a linear code
IEEE Transactions on Information Theory | 2005-05-31 | Paper |
Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
SIAM Journal on Computing | 2005-02-21 | Paper |
scientific article; zbMATH DE number 2120513 (Why is no real title available?)
| 2004-12-01 | Paper |
The inapproximability of lattice and coding problems with preprocessing
Journal of Computer and System Sciences | 2004-10-04 | Paper |
scientific article; zbMATH DE number 2086721 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2086695 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2009953 (Why is no real title available?)
| 2003-11-26 | Paper |
scientific article; zbMATH DE number 2009983 (Why is no real title available?)
| 2003-11-26 | Paper |
The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes
Lecture Notes in Computer Science | 2003-07-16 | Paper |
A note on the minimal volume of almost cubic parallelepipeds
Discrete & Computational Geometry | 2003-03-17 | Paper |
scientific article; zbMATH DE number 1852141 (Why is no real title available?)
| 2003-01-09 | Paper |
The hardness of the closest vector problem with preprocessing
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
scientific article; zbMATH DE number 1775397 (Why is no real title available?)
| 2002-08-01 | Paper |
Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
Information Processing Letters | 2002-07-25 | Paper |
The shortest vector in a lattice is hard to approximate to within some constant
SIAM Journal on Computing | 2001-06-21 | Paper |
scientific article; zbMATH DE number 1559561 (Why is no real title available?)
| 2001-02-28 | Paper |
scientific article; zbMATH DE number 1088241 (Why is no real title available?)
| 1998-01-07 | Paper |
