CRT-based fully homomorphic encryption over the integers

DOI10.1016/j.ins.2015.03.019zbMath1387.94076OpenAlexW2094909724WikidataQ121323068 ScholiaQ121323068MaRDI QIDQ1749613

Jung Hee Cheon, Moon Sung Lee, Aaram Yun, Jin-Su Kim

Publication date: 17 May 2018

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2015.03.019

zbMATH Keywords

Chinese remainder theoremhomomorphic encryptionapproximate gcdprivacy homomorphismDGHV

Mathematics Subject Classification ID

Cryptography (94A60) Information theory (general) (94A15) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (3)

An Improved Leveled Fully Homomorphic Encryption Scheme over the Integers ⋮ Homomorphic extensions of CRT-based secret sharing ⋮ Homomorphic encryption systems statement: trends and challenges

Uses Software

• fhe

Cites Work

• Unnamed Item
• Unnamed Item
• Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme
• Factoring integers with elliptic curves
• Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
• Fully Homomorphic Encryption with Polylog Overhead
• Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
• Homomorphic Evaluation of the AES Circuit
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
• Approximate common divisors via lattices
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Faster Fully Homomorphic Encryption
• Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme
• Cryptanalysis of an Algebraic Privacy Homomorphism
• Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
• Fully Homomorphic Encryption over the Integers
• Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
• The Computational Complexity of Simultaneous Diophantine Approximation Problems
• Batch Fully Homomorphic Encryption over the Integers
• Fully homomorphic encryption using ideal lattices
• Fully Homomorphic Encryption over the Integers with Shorter Public Keys
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
• Scale-Invariant Fully Homomorphic Encryption over the Integers
• Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits

This page was built for publication: CRT-based fully homomorphic encryption over the integers