Errorless Smooth Projective Hash Function Based on LWE
In the recent years, lattice based cryptography has been able to mimic many constructions from the discrete-logarithm/pairing world, and even go beyond. The incentives to switch to lattices are numerous; they offer strong security guarantees, such as hardness under worst-case assumptions, and potential resistance to quantum algorithms. They also offer better asymptotical security and good parallelism. And even more interestingly, lattice problems such as LWE have shown to be extremely versatile, allowing the construction of primitives which existence has been a long term open problem, such as fully homomorphic encryption, following the breakthrough work of gentry.