In this paper, we present One-key CBC MAC (OMAC) and prove its security for arbitrary
length messages. OMAC takes only one key, K (k bits) of a block cipher E. Previously, XCBC …

This paper proposes a designated verifier signature scheme based on the Schnorr signature
and the Zheng signcryption schemes. One of the advantages of the new scheme compared …

We suggest some simple variants of the CBC MAC that let you efficiently MAC messages of
arbitrary lengths. Our constructions use three keys, K1, K2, K3, to avoid unnecessary …

We suggest some simple variants of the CBC MAC that enable the efficient authentication of
arbitrary-length messages. Our constructions use three keys, K1, K2, K3, to avoid …

We present an improved bound on the advantage of any q-query adversary at distinguishing
between the CBC MAC over a random n-bit permutation and a random function outputting n …

In this paper, we propose TMAC. TMAC is a refinement of XCBC such that it requires only
two keys while XCBC requires three keys. More precisely, TMAC requires only (k+ n)-bit …

OMAC—a single-keyed variant of CBC-MAC by Iwata and Kurosawa—is a widely used and
standardized (NIST FIPS 800-38B, ISO/IEC 29167-10: 2017) message authentication code …

Background. Throughout this article we will consider the AE problem in the “symmetric-key
model.” This means that we assume our two communicating parties, traditionally called …

Abstract OMAC, TMAC and XCBC are CBC-type MAC schemes which are provably secure
for arbitrary message length. In this paper, we present a more tight upper bound on Adv mac …

LightMAC, by Luykx et al., is a block cipher based message authentication code (MAC). The
simplicity of design and low overhead allows it to have very compact implementations. As a …