Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In this paper, we present new adaptively secure identity-based encryption (IBE) schemes. One of the distinguishing properties of… 
2016
2016
We present an additively homomorphic commitment scheme with hardness based on the Ring-SIS problem. Our construction is… 
2015
2015
Garg, Gentry and Halevi (GGH) described the first candidate multilinear maps using ideal lattices. However, Hu and Jia recently… 
2015
2015
We improve the zeroizing attack on the multilinear map of Garg, Gentry and Halevi (GGH). Our algorithm can solve the Graded… 
Review
2014
Review
2014
Biometric authentication based on facial image, fingerprint, palm print, iris, retina, or veins are becoming increasingly popular… 
Review
2014
Review
2014
Fully Homomorphic Encryption (FHE) has been a myth till 2009 when Craig Gentry proposed an FHE scheme using Ideal Lattices. We… 
2013
2013
In this paper, we report that we have solved the shortest vector problem (SVP) over a 128-dimensional lattice, which is currently…