# Homomorphic encryption

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2012

Highly Cited

2012

- ITCS
- 2012

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

- IACR Cryptology ePrint Archive
- 2012

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

- IEEE 52nd Annual Symposium on Foundations of…
- 2011

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

- CCSW
- 2011

The prospect of outsourcing an increasing amount of data storage and management to cloud services raises many new privacy… (More)

Is this relevant?

Highly Cited

2011

Highly Cited

2011

- IACR Cryptology ePrint Archive
- 2011

We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players… (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- EUROCRYPT
- 2010

We describe a working implementation of a variant of Gentry’s fully homomorphic encryption scheme (STOC 2009), similar to the… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- STOC
- 2009

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

- EUROCRYPT
- 2009

We describe a very simple “somewhat homomorphic” encryption scheme using only elementary modular arithmetic, and use Gentry’s… (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Public Key Cryptography
- 2009

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

- IACR Cryptology ePrint Archive
- 2000

We introduce a new approach to multiparty computation (MPC) basing it on homomorphic threshold crypto-systems. We show that given… (More)

Is this relevant?