Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
We present a novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on… Expand
Is this relevant?
Highly Cited
2012
Highly Cited
2012
We propose a new notion of secure multiparty computation aided by a computationally-powerful but untrusted "cloud" server. In… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We present a fully homomorphic encryption scheme that is based solely on the(standard) learning with errors (LWE) assumption… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security… Expand
Is this relevant?
Highly Cited
2011
Highly Cited
2011
The prospect of outsourcing an increasing amount of data storage and management to cloud services raises many new privacy… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We describe a working implementation of a variant of Gentry's fully homomorphic encryption scheme (STOC 2009), similar to the… Expand
  • figure 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We present a fully homomorphic encryption scheme which has both relatively small key and ciphertext size. Our construction… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We propose a fully homomorphic encryption scheme -- i.e., a scheme that allows one to evaluate circuits over encrypted data… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We propose the first fully homomorphic encryption scheme, solving an old open problem. Such a scheme allows one to compute… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We construct a simple fully homomorphic encryption scheme, using only elementary modular arithmetic. We use Gentry’s technique to… Expand
  • figure 1
Is this relevant?