A Decade of Lattice Cryptography
By Chris Peikert. Foundations and Trends® in Theoretical Computer Science, 2016
693 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/d7a7871638737acfc1f2e6ce7f53af0215952262
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Michael Naehrig
- Vinod Vaikuntanathan
- Léo Ducas
- Joppe W. Bos
- Shai Halevi
- Dan Boneh
- Kristin E. Lauter
- Mauro Conti
In Computational Theory and Mathematics
- Michael Naehrig
- Vinod Vaikuntanathan
- Joppe W. Bos
- Léo Ducas
- Shai Halevi
- Chris Peikert
- Kristin E. Lauter
- Mauro Conti
Citations in the corpus
- A Survey on Homomorphic Encryption Schemes (2017, methodology): “Two well-known modern problems suggested in [Ajtai 1996] for lattice-based cryptosystems are Closest Vector Problem (CVP) and Shortest Vector Problem (SVP) [Peikert 2015].”
- Computational Limitations in Robust Classification and Win-Win Results (2019, methodology): “ eT) = 1 P r Zm 2 [D(A;r) = 1] <negl(n) We have written specic versions of the LWE assumption. LWE is conjectured to be hard for a large setting of parameters. For a discussion on parameters, see [Pei16]. Denition 6.3 (LWE with Preprocessing Problem (LWEP)). We say that a pair of algorithms (Prep”
- Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives (2017, background): “We want to stress that ideal lattices have not been investigated nearly as deeply as standard lattices and thus there is less confidence in the assumptions (cf. [75]) and also the choice of parameters of these schemes can be seen as quite aggressive.”
- Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE (2016, background): “the recent survey [54] for a comprehensive list of relevant references), is an exciting field of research that, in addition to providing a richer diversity of underlying primitives, offers the potential to build practical quantum-resistant cryptography.”
- F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption (2021, background): “Since then, improved FHE schemes have greatly reduced these overheads and broadened its applicability [2, 59].”