The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
The Learning with Errors Problem (Invited Survey)
Abstract
In this survey we describe the Learning with Errors (LWE) problem, discuss its properties, its hardness, and its cryptographic applications.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Factoring polynomials with rational coefficients
Lenstra, A. K., Lenstra, H. W., & Lovász, L. (1982) · Mathematische Annalen · doi:10.1007/bf01457454 · Cited by 4,018
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
On 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-citationNTRU: A ring-based public key cryptosystem
Hoffstein, J., Pipher, J., & Silverman, J. H. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054868 · Cited by 1,947
On 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-citationEfficient 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-citationPublic-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
Authenticating Pervasive Devices with Human Protocols
Juels, A., & Weis, S. A. (2005) · Lecture Notes in Computer Science · doi:10.1007/11535218_18 · Cited by 718
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
A 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
Lossy Trapdoor Functions and Their Applications
Peikert, C., & Waters, B. (2011) · SIAM Journal on Computing · doi:10.1137/080733954 · Cited by 649
A 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
Micciancio, D., & Regev, O. (2009) · Post-Quantum Cryptography · doi:10.1007/978-3-540-88702-7_5 · Cited by 615
Self-citationGenerating Hard Instances of Lattice ProblemsPreprint
Ajtai, M. (1996) · Electronic colloquium on computational complexity · Cited by 606
Noise-tolerant learning, the parity problem, and the statistical query model
Blum, A., Kalai, A., & Wasserman, H. (2003) · Journal of the ACM · doi:10.1145/792538.792543 · Cited by 598
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
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
Lyubashevsky, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_35 · Cited by 558
A sieve algorithm for the shortest lattice vector problem
Ajtai, M., Kumar, R., & Sivakumar, D. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380857 · Cited by 558
Secure Human Identification Protocols
Hopper, N. J., & Blum, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_4 · Cited by 499
Simultaneous 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
Regev, O. (2006) · Lecture Notes in Computer Science · doi:10.1007/11818175_8 · Cited by 485
Self-citationImpagliazzo, R., & Zuckerman, D. (1989) · 30th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63486 · Cited by 387
Efficient Public Key Encryption Based on Ideal Lattices: (Extended Abstract)
Stehlé, D., Steinfeld, R., Tanaka, K., & Xagawa, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_36 · Cited by 369
Relations between average case complexity and approximation complexity
Feige, U. (2002) · Proceedings of the thiry-fourth annual ACM symposium on Theory of computing · doi:10.1145/509907.509985 · Cited by 351
Cryptographic Primitives Based on Hard Learning Problems
Blum, A., Furst, M., Kearns, M., & Lipton, R. J. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48329-2_24 · Cited by 332
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
SWIFFT: A Modest Proposal for FFT Hashing
Lyubashevsky, V., Micciancio, D., Peikert, C., & Rosen, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71039-4_4 · Cited by 265
More on average case vs approximation complexity
Alekhnovich, M. (2004) · 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. · doi:10.1109/sfcs.2003.1238204 · Cited by 247
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient One-Way Functions
Micciancio, D. (2007) · computational complexity · doi:10.1007/s00037-007-0234-9 · Cited by 242
On the Limits of Nonapproximability of Lattice Problems
Goldreich, O., & Goldwasser, S. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1686 · Cited by 231
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
Micciancio, D., & Voulgaris, P. (2010) · Proceedings of the forty-second ACM symposium on Theory of computing · doi:10.1145/1806689.1806739 · Cited by 226
Concurrently 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
Public-Key Encryption Schemes with Auxiliary Inputs
Dodis, Y., Goldwasser, S., Tauman Kalai, Y., Peikert, C., & Vaikuntanathan, V. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-11799-2_22 · Cited by 198
Aharonov, D., & Regev, O. (2005) · Journal of the ACM · doi:10.1145/1089023.1089025 · Cited by 179
Self-citationLattice-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
Asymptotically Efficient Lattice-Based Digital Signatures
Lyubashevsky, V., & Micciancio, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78524-8_3 · Cited by 178
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
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 147
Lyubashevsky, V. (2005) · Lecture notes in computer science · doi:10.1007/11538462_32 · Cited by 144
Cryptographic hardness for learning intersections of halfspaces
Klivans, A. R., & Sherstov, A. A. (2008) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2008.07.008 · Cited by 108
Multi-bit Cryptosystems Based on Lattice Problems
Kawachi, A., Tanaka, K., & Xagawa, K. (2007) · Springer eBooks · doi:10.1007/978-3-540-71677-8_21 · Cited by 99
Collision-Free Hashing from Lattice Problems
Goldreich, O., Goldwasser, S., & Halevi, S. (1996) · Cited by 92
How to Encrypt with the LPN Problem
Gilbert, H., Robshaw, M. J. B., & Seurin, Y. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-70583-3_55 · Cited by 81
On Bounded Distance Decoding for General Lattices
Liu, Y.-K., Lyubashevsky, V., & Micciancio, D. (2006) · Lecture notes in computer science · doi:10.1007/11830924_41 · Cited by 54
Collision-Free Hashing from Lattice Problems
Goldreich, O., Goldwasser, S., & Halevi, S. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22670-0_5 · Cited by 54
Representing hard lattices with O(n log n) bits
Ajtai, M. (2005) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1060590.1060604 · Cited by 39
The First and Fourth Public-Key Cryptosystems with Worst-Case/Average-Case EquivalencePreprint
Ajtai, M., & Dwork, C. (2007) · Electronic colloquium on computational complexity · Cited by 25
Cryptographic Functions from Worst-Case Complexity Assumptions
Micciancio, D. (2009) · Information security and cryptography · doi:10.1007/978-3-642-02295-1_13 · Cited by 15
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
(Leveled) Fully Homomorphic Encryption without Bootstrapping
Brakerski, Z., Gentry, C., & Vaikuntanathan, V. (2014) · ACM Transactions on Computation Theory · doi:10.1145/2633600 · Cited by 1,430
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Stehlé, D., & Steinfeld, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_4 · Cited by 444
A Decade of Lattice Cryptography
Peikert, C. (2016) · now publishers, Inc. eBooks · doi:10.1561/9781680831139 · Cited by 256
Metadata
- Authors
- Regev, O.
- Venue
- 2010 IEEE 25th Annual Conference on Computational Complexity
- Publisher
- IEEE
- Published
- 2010-06
- Pages
- 191-204
- ISSN
- 1093-0159 (ISSN-L)
- OpenAlex
- W2111809688
- Cited by
- 255
- References
- 52
- FWCI
- 9.88
- 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.
