International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Frédéric Valette

Affiliation: CELAR

Publications

Year
Venue
Title
2009
CHES
2008
CHES
2006
CHES
2006
PKC
2004
ASIACRYPT
2004
CHES
2004
CHES
2003
CHES
2002
CRYPTO
2002
FSE
2001
EPRINT
On the Security of Randomized CBC-MAC Beyond the Birthday Paradox Limit - A New Construction
Éliane Jaulmes Antoine Joux Frederic Valette
In this paper, we study the security of randomized CBC-MACs and propose a new construction that resists birthday paradox attacks and provably reaches full security. The size of the MAC tags in this construction is optimal, i.e., exactly twice the size of the block cipher. Up to a constant, the security of the proposed randomized CBC-MAC using an n-bit block cipher is the same as the security of the usual encrypted CBC-MAC using a 2n-bit block cipher. Moreover, this construction adds a negligible computational overhead compared to the cost of a plain, non-randomized CBC-MAC. We give a full standard proof of our construction using one pass of a block cipher with 2n-bit keys but there also is a proof for n-bit keys block ciphers in the ideal cipher model.

Program Committees

CHES 2007
CHES 2006
CHES 2004