Cryptographic hash functions are fundamental in cryptographic constructions, as they
transform variable-length input into fixed-length output while maintaining essential security …

We extend the analysis of collision-resistant hash functions in the Linicrypt model presented
by McQuoid, Swope & Rosulek (TCC 2019) in order to characterize preimage awareness, a …

We extend the Linicrypt framework for characterizing hash function security as proposed by
McQuoid, Swope, and Rosulek (TCC 2018) to support constructions in the ideal cipher …

Cryptographic hash functions have become the basis of modern network computing for
identity authorization and secure computing; protocol consistency of cryptographic hash …

A cryptographic hash function compresses arbitrarily long messages to digests of a short
and fixed length. Most of existing hash functions are designed to evaluate a compression …

Cryptographic hash functions are used inside many applications that critically rely on their
resistance against cryptanalysis attacks and the correctness of their implementations …

We introduce the notion of a weak ideal compression function, which is vulnerable to strong
forms of attack, but is otherwise random. We show that such weak ideal compression …

A combiner for collision-resistant hash functions takes two functions as input and
implements a hash function with the guarantee that it is collision-resistant if one of the …

The security of iterated hash functions relies on the properties of underlying compression
functions. We study highly efficient compression functions based on block ciphers. We …

We analyze the security of the SHA-3 finalist BLAKE. The BLAKE hash function follows the
HAIFA design methodology, and as such it achieves optimal preimage, second preimage …