The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Classical hardness of learning with errors
Abstract
We show that the Learning with Errors (LWE) problem is classically at least as hard as standard worst-case lattice problems. Previously this was only known under quantum reductions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
Trapdoors for hard lattices and new cryptographic constructions
Gentry, C., Peikert, C., & Vaikuntanathan, V. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374407 · Cited by 2,435
Self-citationOn lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2009) · Journal of the ACM · doi:10.1145/1568318.1568324 · Cited by 2,315
Self-citationOn Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_1 · Cited by 1,831
Self-citation(Leveled) fully homomorphic encryption without bootstrapping
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2012) · Proceedings of the 3rd Innovations in Theoretical Computer Science Conference · doi:10.1145/2090236.2090262 · Cited by 1,782
Self-citationA Pseudorandom Generator from any One-way Function
HÅstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539793244708 · Cited by 1,653
Efficient Fully Homomorphic Encryption from (Standard) LWE
Brakerski, Z., & Vaikuntanathan, V. (2011) · 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2011.12 · Cited by 1,449
Self-citationGenerating hard instances of lattice problems (extended abstract)
Ajtai, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237838 · Cited by 1,405
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
Brakerski, Z. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_50 · Cited by 1,252
Self-citationTrapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Micciancio, D., & Peikert, C. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_41 · Cited by 1,224
Self-citation(2000) · Lecture Notes in Computer Science · doi:10.1007/10722028 · Cited by 1,001
Efficient Lattice (H)IBE in the Standard Model
Agrawal, S., Boneh, D., & Boyen, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_28 · Cited by 976
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Micciancio, D., & Regev, O. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447360 · Cited by 907
Self-citationLattice Signatures without Trapdoors
Lyubashevsky, V. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-29011-4_43 · Cited by 827
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
Peikert, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536461 · Cited by 813
Self-citationApproximate counting, uniform generation and rapidly mixing Markov chains
Sinclair, A., & Jerrum, M. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90067-9 · Cited by 735
Bonsai Trees, or How to Delegate a Lattice Basis
Cash, D., Hofheinz, D., Kiltz, E., & Peikert, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_27 · Cited by 711
Self-citationBetter Key Sizes (and Attacks) for LWE-Based Encryption
Lindner, R., & Peikert, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-19074-2_21 · Cited by 688
Self-citationA Framework for Efficient and Composable Oblivious Transfer
Peikert, C., Vaikuntanathan, V., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-85174-5_31 · Cited by 678
Self-citationLossy Trapdoor Functions and Their Applications
Peikert, C., & Waters, B. (2011) · SIAM Journal on Computing · doi:10.1137/080733954 · Cited by 649
Self-citationA public-key cryptosystem with worst-case/average-case equivalence
Ajtai, M., & Dwork, C. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258604 · Cited by 642
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Applebaum, B., Cash, D., Peikert, C., & Sahai, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_35 · Cited by 562
Self-citationSimultaneous Hardcore Bits and Cryptography against Memory Attacks
Akavia, A., Goldwasser, S., & Vaikuntanathan, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00457-5_28 · Cited by 490
New bounds in some transference theorems in the geometry of numbers
Banaszczyk, W. (1993) · Mathematische Annalen · doi:10.1007/bf01445125 · Cited by 461
Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
Agrawal, S., Boneh, D., & Boyen, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_6 · Cited by 416
An Efficient and Parallel Gaussian Sampler for Lattices
Peikert, C. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_5 · Cited by 372
Self-citationA Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
Kuperberg, G. (2005) · SIAM Journal on Computing · doi:10.1137/s0097539703436345 · Cited by 347
New lattice-based cryptographic constructions
Regev, O. (2004) · Journal of the ACM · doi:10.1145/1039488.1039490 · Cited by 292
Self-citationGeneralized Compact Knapsacks Are Collision Resistant
Lyubashevsky, V., & Micciancio, D. (2006) · Lecture Notes in Computer Science · doi:10.1007/11787006_13 · Cited by 268
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
Boneh, D., & Venkatesan, R. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_11 · Cited by 266
The Learning with Errors Problem (Invited Survey)
Regev, O. (2010) · 2010 IEEE 25th Annual Conference on Computational Complexity · doi:10.1109/ccc.2010.26 · Cited by 255
Self-citationLattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
Boyen, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13013-7_29 · Cited by 254
Strong uniform times and finite random walks
Aldous, D., & Diaconis, P. (1987) · Advances in Applied Mathematics · doi:10.1016/0196-8858(87)90006-6 · Cited by 233
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
Peikert, C., & Rosen, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_8 · Cited by 229
Self-citationConcurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
Kawachi, A., Tanaka, K., & Xagawa, K. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89255-7_23 · Cited by 211
On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem
Lyubashevsky, V., & Micciancio, D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-03356-8_34 · Cited by 192
Quantum Computation and Lattice Problems
Regev, O. (2004) · SIAM Journal on Computing · doi:10.1137/s0097539703440678 · Cited by 188
Self-citationPseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
Micciancio, D., & Mol, P. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_26 · Cited by 186
Lattice-Based Identification Schemes Secure Under Active Attacks
Lyubashevsky, V. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78440-1_10 · Cited by 179
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More
Micciancio, D., & Vadhan, S. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45146-4_17 · Cited by 152
Bi-Deniable Public-Key Encryption
O’Neill, A., Peikert, C., & Waters, B. R. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22792-9_30 · Cited by 125
Self-citationCollision-Free Hashing from Lattice Problems
Goldreich, O., Goldwasser, S., & Halevi, S. (1996) · Cited by 92
Circular and KDM Security for Identity-Based Encryption
Alperin-Sheriff, J., & Peikert, C. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-30057-8_20 · Cited by 89
Self-citationRing Switching in BGV-Style Homomorphic Encryption
Gentry, C., Halevi, S., Peikert, C., & Smart, N. P. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32928-9_2 · Cited by 84
Self-citationCryptographic Hardness for Learning Intersections of Halfspaces
Klivans, A. R., & Sherstov, A. A. (2006) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2006.24 · Cited by 68
Cited by
Gentry, C., Sahai, A., & Waters, B. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40041-4_5 · Cited by 1,492
CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM
Bos, J., Ducas, L., Kiltz, E., Lepoint, T., Lyubashevsky, V., Schanck, J. M., Schwabe, P., Seiler, G., & Stehle, D. (2018) · 2018 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2018.00032 · Cited by 1,192
“One of the major achievements of Regev’s work was the introduction of an intermediate problem – the Learning With Errors (LWE) Problem – which was relatively simple to use in cryptographic constructions and asymptotically at least as hard as some standard worst-case lattice problems [23, 59].”
MethodTFHE: Fast Fully Homomorphic Encryption Over the Torus
Chillotti, I., Gama, N., Georgieva, M., & Izabachène, M. (2020) · Journal of Cryptology · doi:10.1007/s00145-019-09319-x · Cited by 990
On Ideal Lattices and Learning with Errors over Rings
Lyubashevsky, V., Peikert, C., & Regev, O. (2013) · Journal of the ACM · doi:10.1145/2535925 · Cited by 836
Self-citationFHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
Ducas, L., & Micciancio, D. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46800-5_24 · Cited by 745
Metadata
- Authors
- Brakerski, Z., Langlois, A., Peikert, C., Regev, O., & Stehlé, D.
- Venue
- Proceedings of the forty-fifth annual ACM symposium on Theory of Computing
- Publisher
- ACM
- Published
- 2013-06
- Pages
- 575-584
- OpenAlex
- W2089477764
- Cited by
- 627
- References
- 45
- FWCI
- 35.78
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.