The DOI matches its Crossref record; 56 of the 56 references it cites were found in a registry or an index.
On Ideal Lattices and Learning with Errors over Rings
Abstract
The “learning with errors” (LWE) problem is to distinguish random linear equations, which have been perturbed by a small amount of noise, from truly uniform ones. The problem has been shown to be as hard as worst-case lattice problems, and in recent years it has served as the foundation for a plethora of cryptographic applications. Unfortunately, these applications are rather inefficient due to an inherent quadratic overhead in the use of LWE. A main open question was whether LWE and its applications could be made truly efficient by exploiting extra algebraic structure, as was done for lattice-based hash functions (and related primitives). We resolve this question in the affirmative by introducing an algebraic variant of LWE called ring-LWE , and proving that it too enjoys very strong hardness guarantees. Specifically, we show that the ring-LWE distribution is pseudorandom, assuming that worst-case problems on ideal lattices are hard for polynomial-time quantum algorithms. Applications include the first truly practical lattice-based public-key cryptosystem with an efficient security reduction; moreover, many of the other applications of LWE can be made much more efficient through the use of ring-LWE.
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
New directions in cryptography
Diffie, W., & Hellman, M. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055638 · Cited by 14,713
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
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
A Course in Computational Algebraic Number Theory
Cohen, H. (1993) · Graduate Texts in Mathematics · doi:10.1007/978-3-662-02945-9 · Cited by 2,567
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-citationGoldreich, O. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546891 · Cited by 2,181
NTRU: 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
Goldreich, O. (2004) · Cambridge University Press eBooks · doi:10.1017/cbo9780511721656 · Cited by 1,805
(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
Research works printed but not linked: 9
- 10.5555/1881412.1881420 · doi:10.5555/1881412.1881420
- 10.1090/S0002-9904-1946-08538-9 · doi:10.1090/s0002-9904-1946-08538-9
- Shafi Goldwasser , Yael Tauman Kalai , Chris Peikert , and Vinod Vaikuntanathan . 2010 . Robustness of the learning with errors assumption . In Proceedings of ICS. 230--240 . Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, and Vinod Vaikuntanathan. 2010. Robustness of the learning with errors assumption. In Proceedings of ICS. 230--240.
- 10.5555/1964621.1964651 · doi:10.5555/1964621.1964651
- 10.5555/1793774.1793789 · doi:10.5555/1793774.1793789
- 10.5555/1802614.1802619 · doi:10.5555/1802614.1802619
- 10.1145/1374376.1374406 · doi:10.1145/1374376.1374406
- Peter Roquette . 1967. On class field towers . In Algebraic Number Theory, John William Scott Cassels and Albrecht Fröhlich Eds., Academic Press , 231--249. Peter Roquette. 1967. On class field towers. In Algebraic Number Theory, John William Scott Cassels and Albrecht Fröhlich Eds., Academic Press, 231--249.
- 10.5555/2008684.2008690 · doi:10.5555/2008684.2008690
Cited by
A Survey on Homomorphic Encryption Schemes: Theory and Implementation
Acar, A., Aksu, H., Uluagac, A. S., & Conti, M. (2019) · ACM Computing Surveys · doi:10.1145/3214303 · Cited by 1,397
Mironov, I. (2017) · 2017 IEEE 30th Computer Security Foundations Symposium (CSF) · doi:10.1109/csf.2017.11 · Cited by 1,255
Bernstein, D. J., & Lange, T. (2017) · Nature · doi:10.1038/nature23461 · Cited by 1,242
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
Survey on Fully Homomorphic Encryption, Theory, and Applications
Marcolla, C., Sucasas, V., Manzano, M., Bassoli, R., Fitzek, F. H. P., & Aaraj, N. (2022) · Proceedings of the IEEE · doi:10.1109/jproc.2022.3205665 · Cited by 323
Metadata
- Authors
- Lyubashevsky, V., Peikert, C., & Regev, O.
- Venue
- Journal of the ACM
- Published
- 2013-11
- Volume
- 60
- Issue
- 6
- Pages
- 1-35
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2071825329
- Cited by
- 836
- References
- 56
- FWCI
- 50.80
- Type
- journal article
- Language
- en
- Open access
- closed
- Funders
- Alfred P. Sloan Foundation
- Integrated Project QAP
- Sixth Framework Programme
- IST directorate (15848)
- Division of Computing and Communication Foundations (CCF-1054495)
- Division of Computer and Network Systems (CNS-0716786)
- Wolfson Foundation
- European Research Council
- United States - Israel Binational Science Foundation
- Israel Science Foundation
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On Ideal Lattices and Learning with Errors over Rings. https://app.cochat.ai/papers/10.1145/2535925
- The paper
- Lyubashevsky, V., Peikert, C., & Regev, O. (2013). On Ideal Lattices and Learning with Errors over Rings. Journal of the ACM. https://doi.org/10.1145/2535925
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.
