First of all we take a thorough look at an error in a paper by Daemen et al.(ToSC 2018)
which looks at minimal requirements for tree-based hashing based on multiple primitives …

Tree hashing has several advantages over sequential hashing such as parallelism and a
lower cost of hash value recomputation when only a small part of the input changes. In this …

We explore cryptographic primitives with low multiplicative complexity. This is motivated by
recent progress in practical applications of secure multi-party computation (MPC), fully …

Abstract Recently, Wee (EUROCRYPT'12) introduced the notion of dual projective hashing
as an extension of the Cramer-Shoup projective hashing, with a simple construction of lossy …

We present the hash function BLAKE2, an improved version of the SHA-3 finalist BLAKE
optimized for speed in software. Target applications include cloud storage, intrusion …

We propose a flexible, fairly general, coding for tree hash modes. The coding does not
define a tree hash mode, but instead specifies a way to format the message blocks and …

We introduce the notion of dual projective hashing. This is similar to Cramer-Shoup
projective hashing, except that instead of smoothness, which stipulates that the output of the …

Impactful data breaches that exposed the online accounts and financial information of
billions of individuals have increased recently because of the digitization of numerous …

We present two tweakable wide block cipher modes from doubly-extendable cryptographic
keyed (deck) functions and a keyed hash function: double-decker and docked-double …

In this paper we give a generic security proof for hashing modes that make use of an
underlying fixed-length permutation. We formulate a set of five simple conditions, which are …