… Building efficient hash functions with proven security can be … 1 and Group 2 [4] PGV
compression functions [32]. This compo… , in order to construct indifferentiable hash functions we …

… arbitrary group, its formalrandomoracle indifferentiability [43] proof … -based AOFIL compression
function strategy PGV-LC. … of modes to build secure compression and hash functions from …

… , its formal random-oracle indifferentiability [58] proof was only … From PGV-LC, we derive the
next FIL compression function … modes to build secure compression and hash functions from …

… Indifferentiability. While ICs are unachievable in the standard model [12, 41], it … build ICs
from other public ideal functions. This class of problem shall be addressed with indifferentiability …

… One basic approach to build hash functions is by the iteration … 4, we model the PGV
compression functions in Linicrypt and … properties for hash functions, such as indifferentiability [9]. …

… in the sense of indifferentiability to design more secure hash functions or more secure … of
PGV selection are really secure structures. Among them most popular compression functions …

… build a compression function and the classical constructions of MD5 and SHA1, SHA2 hash
… the indifferentiability composition theorem and replace the leaf level compression function of …

… be possible to build a MAC … compression function is used as a primitive. They also show
that one can use a truncated permutation to create a compression function that is indifferentiable …

… function for a compression function h which we assume is ideal. When we construct Hh then
we aim at building … For example, all PGV compression functions (see Section 14.1.3; page …

… , precisely matching our need for building a Merkle tree and … , the sponge construction is
indifferentiable from a random oracle up to … Here we focus on compression functions defined by …