Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

On Ideal Lattices and Learning with Errors over Rings

Vadim Lyubashevsky, Chris Peikert, Oded Regev

Published Jan 1, 2010• 2,006 citations
Publisher
DOI
10.1007/978-3-642-13190-5_1

Related papers

On Ideal Lattices and Learning with Errors over Rings

Vadim Lyubashevsky, Chris Peikert, Oded Regev

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.

Journal of the ACM•Nov 1, 2013•911 citations

Learning with errors over group rings constructed by semi-direct product

Jiaqi Liu, Fang‐Wei Fu

arXiv:2311.15868•Designs Codes and Cryptography•Feb 24, 2026•2 citations

Some algorithms for learning with errors

Robert Fitzpatrick

•Jan 1, 2014•1 citation

Lattice Ciphertext-Policy Attribute-Based encryption from ring-LWE

Tan Soo Fun, Azman Samsudin

The recent promising results on the hardness of lattice problems have inspired the construction of several Attribute-based Encryption (ABE) schemes from the quantum resistant perspective. However, these schemes are insufficient enough for supporting real-world applications due to inherent quadratic overhead problem in the use of Learning With Error (LWE). To solve this problem, this paper proposed a Ciphertext-Policy Attribute-Based Encryption (CP-ABE) scheme from a more lightweight ideal lattice classes- Ring-Learning with Errors (Ring-LWE), that further called as CP-ABER-LWEscheme. Compared to existing R-LWE based ABE scheme, the proposed CP-ABER-LWEis capable to handle a monotone access structure and enjoys collusion resistance properties. We exploited Linear Secret Scheme (LSSS) to express a monotone access structure. For resist to collusion attack, we applied the private key randomization technique to blind the user's private key. The proposed scheme CP-ABER-LWEis further proven to be secure under the Decision Ring-LWEd,q,χproblem in the selective set model.

International Symposium on Technology Management and Emerging Technologies (ISTMET)•Aug 1, 2015•33 citations

Learning with Errors over Rings

Oded Regev

Lecture notes in computer science•Jan 1, 2010•7 citations

An ideal lattice based IBE scheme in the standard model

Xiaoyuan Yang, Liqiang Wu, Minqing Zhang +2 more

Under the standard model, an IND-sID-CPA secure IBE (Identity Based Encryption) scheme is proposed, which is based on an improved trapdoor generation function over ring and decisional R-LWE (ring-learning with errors) assumption, thus the hardness of recovering system master key can be reduced to solve the Ideal-SIS (small integer solution) problem, and the attack to the ciphertext is equivalent to solving the SVP (the shortest vector problem) in the worst case on ideal lattice to within a fixed poly( n ) factor. Moreover, the proposed scheme has advantages of high encryption and decryption speed and low encryption blowup factor compared with all known IBE scheme from the standard lattice under the standard model.

Wuhan University Journal of Natural Sciences•Sep 3, 2011•2 citations
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.
The recent promising results on the hardness of lattice problems have inspired the construction of several Attribute-based Encryption (ABE) schemes from the quantum resistant perspective. However, these schemes are insufficient enough for supporting real-world applications due to inherent quadratic overhead problem in the use of Learning With Error (LWE). To solve this problem, this paper proposed a Ciphertext-Policy Attribute-Based Encryption (CP-ABE) scheme from a more lightweight ideal lattice classes- Ring-Learning with Errors (Ring-LWE), that further called as CP-ABER-LWEscheme. Compared to existing R-LWE based ABE scheme, the proposed CP-ABER-LWEis capable to handle a monotone access structure and enjoys collusion resistance properties. We exploited Linear Secret Scheme (LSSS) to express a monotone access structure. For resist to collusion attack, we applied the private key randomization technique to blind the user's private key. The proposed scheme CP-ABER-LWEis further proven to be secure under the Decision Ring-LWEd,q,χproblem in the selective set model.
Under the standard model, an IND-sID-CPA secure IBE (Identity Based Encryption) scheme is proposed, which is based on an improved trapdoor generation function over ring and decisional R-LWE (ring-learning with errors) assumption, thus the hardness of recovering system master key can be reduced to solve the Ideal-SIS (small integer solution) problem, and the attack to the ciphertext is equivalent to solving the SVP (the shortest vector problem) in the worst case on ideal lattice to within a fixed poly( n ) factor. Moreover, the proposed scheme has advantages of high encryption and decryption speed and low encryption blowup factor compared with all known IBE scheme from the standard lattice under the standard model.