CRT-based fully homomorphic encryption over the integers
type: Item
instance of: scholarly article
title: CRT-based fully homomorphic encryption over the integers
zbMATH Open document ID: 1387.94076
author: Jung Hee Cheon
author: Moon Sung Lee
author: Aaram Yun
author: Jinsu Kim
published in: Information Sciences
publication date: 2018-05-17T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A15
Mathematics Subject Classification ID: 14G50
zbMATH DE Number: 6869448
zbMATH Keywords: privacy homomorphism
zbMATH Keywords: Chinese remainder theorem
zbMATH Keywords: homomorphic encryption
zbMATH Keywords: approximate gcd
zbMATH Keywords: DGHV
describes a project that uses: fhe
MaRDI profile type: Publication
full work available at URL: j.ins.2015.03.019
OpenAlex ID: W2094909724
Wikidata QID: Q121323068
cites work: Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
cites work: Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
cites work: Q3792627
cites work: Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
cites work: Batch Fully Homomorphic Encryption over the Integers
cites work: Approximate common divisors via lattices
cites work: Known-plaintext cryptanalysis of the Domingo-Ferrer algebraic privacy homomorphism scheme
cites work: Scale-Invariant Fully Homomorphic Encryption over the Integers
cites work: Fully Homomorphic Encryption over the Integers with Shorter Public Keys
cites work: Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers
cites work: Fully Homomorphic Encryption over the Integers
cites work: Fully homomorphic encryption using ideal lattices
cites work: Toward Basing Fully Homomorphic Encryption on Worst-Case Hardness
cites work: Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
cites work: Implementing Gentry’s Fully-Homomorphic Encryption Scheme
cites work: Fully Homomorphic Encryption with Polylog Overhead
cites work: Homomorphic Evaluation of the AES Circuit
cites work: Q4787198
cites work: The Computational Complexity of Simultaneous Diophantine Approximation Problems
cites work: Factoring integers with elliptic curves
cites work: Faster Fully Homomorphic Encryption
cites work: Improved Key Generation for Gentry’s Fully Homomorphic Encryption Scheme
cites work: Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
cites work: Cryptanalysis of an Algebraic Privacy Homomorphism
DOI: 10.1016/J.INS.2015.03.019
description: scientific article; zbMATH DE number 6869448