This paper provides efficient authenticated-encryption (AE) schemes in which a ciphertext is
a commitment to the key. These are extended, at minimal additional cost, to schemes where …

We initiate the study of multi-user (mu) security of authenticated encryption (AE) schemes as
a way to rigorously formulate, and answer, questions about the “randomized nonce” …

The best existing bounds on the concrete security of key-alternating ciphers (Chen and
Steinberger, EUROCRYPT'14) are only asymptotically tight, and the quantitative gap with …

The keyed duplex construction was introduced by Bertoni et al.(SAC 2011) and recently
generalized to full-state absorption by Mennink et al.(ASIACRYPT 2015). We present a …

This paper revisits the multi-user (mu) security of symmetric encryption, from the perspective
of delivering an analysis of the AES-GCM-SIV AEAD scheme. Our end result shows that its …

This paper introduces Simpira, a family of cryptographic permutations that supports inputs of
128 * b bits, where b is a positive integer. Its design goal is to achieve high throughput on …

The multi-key, or multi-user, setting challenges cryptographic algorithms to maintain high
levels of security when used with many different keys, by many different users. Its …

Proving security bounds in contexts with a large number of users is one of the central
problems in symmetric-key cryptography today. This paper introduces a new method for …

AMAC AMAC is a simple and fast candidate construction of a PRF from an MD-style hash
function which applies the keyed hash function and then a cheap, un-keyed output transform …

It is widely known that double encryption does not substantially increase the security of a
block cipher. Indeed, the classical meet-in-the middle attack recovers the 2 k-bit secret key at …