A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
[chapter]
2016
Lecture Notes in Computer Science
Driven by the open problem raised by Hofheinz and Kiltz (Journal of Cryptology, 2012), we study the formalization of lattice-based programmable hash function (PHF), and give two types of constructions by using several techniques such as a novel combination of cover-free sets and lattice trapdoors. Under the Inhomogeneous Small Integer Solution (ISIS) assumption, we show that any (non-trivial) lattice-based PHF is collision-resistant, which gives a direct application of this new primitive. We
doi:10.1007/978-3-662-53015-3_11
fatcat:b5ud4ae7ozdefajmbttvdm5mua