Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2014

Highly Cited

2014

The GGH Graded Encoding Scheme[9], based on ideal lattices, is the first plausible approximation to a cryptographic multilinear… Expand

Is this relevant?

Highly Cited

2013

Highly Cited

2013

The “learning with errors” (LWE) problem is to distinguish random linear equations, which have been perturbed by a small amount… Expand

Is this relevant?

Highly Cited

2013

Highly Cited

2013

Extending bilinear elliptic curve pairings to multilinear maps is a long-standing open problem. The first plausible construction… Expand

Is this relevant?

Highly Cited

2012

Highly Cited

2012

In recent years lattice-based cryptography has emerged as quantum secure and theoretically elegant alternative to classical… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

We construct a simple fully homomorphic encryption scheme, using only elementary modular arithmetic. We use Gentry’s technique to… Expand

Is this relevant?

Highly Cited

2010

Highly Cited

2010

The “learning with errors” (LWE) problem is to distinguish random linear equations, which have been perturbed by a small amount… 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 demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred… 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

2006

Highly Cited

2006

In (Micciancio, FOCS 2002), it was proved that solving the generalized compact knapsack problem on the average is as hard as… Expand

Is this relevant?