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

Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme

Joppe W. Bos, Kristin Lauter, Jake Loftus, Michael Naehrig

Published Jan 1, 2013• 439 citations
Publisher
DOI
10.1007/978-3-642-45239-0_4

Related papers

Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages

Zvika Brakerski, Vinod Vaikuntanathan

Lecture notes in computer science•Jan 1, 2011•1,145 citations

Improved Circular Secure Homomorphic Encryption Scheme

Meng Wu, Xiufeng Zhao, Yu Fu +1 more

International Conference on Computational Intelligence and Security (CIS)•Jan 1, 2023•0 citations

Improved Multi-Identity Based Fully Homomorphic Encryption Scheme over Lattices

Yongli Tang, Mingxing Hu, Qing Ye +2 more

Beijing Youdian Xueyuan xuebao•Feb 28, 2018•1 citation

On the security of the fully-homomorphic encryption scheme based on ideal lattices

Masaya Yasuda, Jun Yajima, Shimoyama Takeshi +1 more

IEICE Technical Report; IEICE Tech. Rep.•Sep 2, 2011•0 citations

CHIMERA: Combining Ring-LWE-based Fully Homomorphic Encryption Schemes

Christina Boura, Nicolas Gama, Mariya Georgieva +1 more

•Jan 1, 2018•12 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
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.