Lattice-based Programmable Hash Functions and Applications

ePrint Report: Lattice-based Programmable Hash Functions and Applications

Jiang Zhang, Yu Chen, Zhenfeng Zhang

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 three types of concrete 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 a collision-resistant hash function, …

applications chen concrete cryptology eprint report function functions hash hash function hash functions journal journal of cryptology novel problem report study techniques types