Homomorphic encryption

Known as: Fully homomorphic encryption, Homomorphic computing, Privacy homomorphism 
Homomorphic encryption is a form of encryption that allows computations to be carried out on ciphertext, thus generating an encrypted result which… (More)
Wikipedia

Related topics

Related topics

25 relations
CiphertextClient-side encryptionCloud computingCloud computing security
(More)

Broader (1)

Public-key cryptography

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
(Leveled) fully homomorphic encryption without bootstrapping
We present a novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on… (More)
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Somewhat Practical Fully Homomorphic Encryption
In this paper we port Brakerski’s fully homomorphic scheme based on the Learning With Errors (LWE) problem to the ring-LWE… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Efficient Fully Homomorphic Encryption from (Standard) LWE
We present a fully homomorphic encryption scheme that is based solely on the(standard) learning with errors (LWE) assumption… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Can homomorphic encryption be practical?
The prospect of outsourcing an increasing amount of data storage and management to cloud services raises many new privacy… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Multiparty Computation from Somewhat Homomorphic Encryption
We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players… (More)
  • figure 3
  • figure 7
  • figure 11
  • figure 12
  • figure 15
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Implementing Gentry's Fully-Homomorphic Encryption Scheme
We describe a working implementation of a variant of Gentry’s fully homomorphic encryption scheme (STOC 2009), similar to the… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Fully homomorphic encryption using ideal lattices
We propose a fully homomorphic encryption scheme -- i.e., a scheme that allows one to evaluate circuits over encrypted data… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Fully Homomorphic Encryption over the Integers
We describe a very simple “somewhat homomorphic” encryption scheme using only elementary modular arithmetic, and use Gentry’s… (More)
  • figure 1
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes
We present a fully homomorphic encryption scheme which has both relatively small key and ciphertext size. Our construction… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Multiparty Computation from Threshold Homomorphic Encryption
We introduce a new approach to multiparty computation (MPC) basing it on homomorphic threshold crypto-systems. We show that given… (More)
Is this relevant?