Ideal lattice cryptography

Known as: Ideal Lattices and Cryptography 
Ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many parts of number theory… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Multilinear maps have become popular tools for designing cryptographic schemes since a first approximate realisation candidate… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2015
2015
Combining the efficient cross-polytope locality-sensitive hash family of Terasawa and Tanaka with the heuristic lattice sieve… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
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… (More)
Is this relevant?
2014
2014
In this paper, we present a practical and provably secure two-pass AKE protocol from ideal lattices, which is conceptually simple… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2013
Highly Cited
2013
We describe plausible lattice-based constructions with properties that approximate the soughtafter multilinear maps in hard… (More)
Is this relevant?
Highly Cited
2012
Highly Cited
2012
The “learning with errors” (LWE) problem is to distinguish random linear equations, which have been perturbed by a small amount… (More)
Is this relevant?
Highly Cited
2011
Highly Cited
2011
NTRUEncrypt, proposed in 1996 by Hoffstein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its… (More)
  • figure 1
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… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We describe public key encryption schemes with security provably based on the worst case hardness of the approximate Shortest… (More)
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… (More)
  • figure 2
  • figure 4
  • figure 6
Is this relevant?