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

Learning with Errors over Rings

Oded Regev

Published Jan 1, 2010• 7 citations
Publisher
DOI
10.1007/978-3-642-14518-6_3

Related papers

On Ideal Lattices and Learning with Errors over Rings

Vadim Lyubashevsky, Chris Peikert, Oded Regev

Lecture notes in computer science•Jan 1, 2010•1,909 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•1 citation

Ring Signatures Based on Middle-Product Learning with Errors Problems

Dipayan Das, Man Ho Au, Zhenfei Zhang

Lecture notes in computer science•Jan 1, 2019•8 citations

Learning with Errors in the Exponent

Özgür Dagdelen, Sebastian Gajek, Florian Göpfert

Lecture notes in computer science•Jan 1, 2016•5 citations

Efficient Fully homomorphic encryption scheme using Ring-LWE

Dan Xin, Jingzhou Ji, Jing Feng +2 more

Abstract Data can be stored and processed in an encrypted format using fully homomorphic encryption, which makes cloud computing provider can process data well without even knowing data information. However, most existing homomorphic encryption schemes based on ring learning with errors, focus on the special classes of rings, such as power-of-two cyclotomic rings, which significantly limits its application efficiency in cloud computing. Therefore, in this letter, to solve this problem above, an efficient fully homomorphic encryption scheme is proposed based on ring learning with errors in arbitrary cyclotomic rings. Particularly, a “somewhat homomorphic encryption” scheme is firstly proposed based on ring learning with errors. A novel fully homomorphic encryption scheme is further presented using key-switching. With theoretical and experimental verification, the proposed scheme has advantage of high efficiency of encryption and decryption. The security of our scheme strictly reduces to hardness of decision ring learning with errors problem in the random oracle model.

Journal of Physics Conference Series•Jan 1, 2021•4 citations

Some algorithms for learning with errors

Robert Fitzpatrick

•Jan 1, 2014•1 citation
Abstract Data can be stored and processed in an encrypted format using fully homomorphic encryption, which makes cloud computing provider can process data well without even knowing data information. However, most existing homomorphic encryption schemes based on ring learning with errors, focus on the special classes of rings, such as power-of-two cyclotomic rings, which significantly limits its application efficiency in cloud computing. Therefore, in this letter, to solve this problem above, an efficient fully homomorphic encryption scheme is proposed based on ring learning with errors in arbitrary cyclotomic rings. Particularly, a “somewhat homomorphic encryption” scheme is firstly proposed based on ring learning with errors. A novel fully homomorphic encryption scheme is further presented using key-switching. With theoretical and experimental verification, the proposed scheme has advantage of high efficiency of encryption and decryption. The security of our scheme strictly reduces to hardness of decision ring learning with errors problem in the random oracle model.