A Toolkit for Ring-LWE Cryptography
By Vadim Lyubashevsky, Chris Peikert, Oded Regev. IACR Cryptology ePrint Archive, 2013
493 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/1efbc4c3c66f1dded4cfc626982d2e40a1c5b87b
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
- Vadim Lyubashevsky
- Chris Peikert
- Damien Stehlé
- Oded Regev
- Hao Chen
- Kim Laine
- Daniele Micciancio
- Léo Ducas
In Geometry and Topology
- Daniele Micciancio
- Damien Stehlé
- Adeline Langlois
- Léo Ducas
- Chris Peikert
- Vadim Lyubashevsky
- Oded Regev
- Eike Kiltz
Citations in the corpus
- Worst-case to average-case reductions for module lattices (2014, methodology): “We refer the reader to [30] and [19,20] for thorough introductions to the topics covered in this subsection.”
- On Ideal Lattices and Learning with Errors over Rings (2010, methodology): “As one example application, here we sketch a simple and efficient semantically secure public-key cryptosystem, but defer a precise analysis and generalization to arbitrary cyclotomics to [LPR13].”
- Simple Encrypted Arithmetic Library - SEAL v2.1 (2016, background): “We refer the reader to [18] and [13] for further details and discussion.”
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second (2015, methodology): “Our work uses the LWE instantiation of ring lattices [29,30] for the efficient implementation of encryption.”
- Towards Post-Quantum Blockchain: A Review on Blockchain Cryptography Resistant to Quantum Computing Attacks (2020, unknown): “, LP-LWE (Lindner-Peikert LWE) or Ring-LWE [122], [123]).”
- Homomorphic Encryption for Arithmetic of Approximate Numbers (2017, methodology): “Refer [34,35] for explaining the methods in more details.”
- A Modular Analysis of the Fujisaki-Okamoto Transformation (2017, background): “Finally, in the context of lattices-based encryption (e.g., [36, 31] The reduction (to the OW - CPA security of PKE ) loses a factor of q 1 / G , where q G is the number of G -queries an adversary makes.”
- Simple Encrypted Arithmetic Library v2.3.0 (2017, background): “We refer the reader to [31] and [21] for further details and discussion.”