Open AccessNew Constructions of MACs from (Tweakable) Block Ciphers
Author(s) -
Benoît Cogliati,
Jooyoung Lee,
Yannick Seurin
Publication year - 2017
Publication title -
iacr transaction on symmetric cryptology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.715
H-Index - 10
ISSN - 2519-173X
DOI - 10.46586/tosc.v2017.i2.27-58
Subject(s) - cryptographic nonce , block cipher , block cipher mode of operation , computer science , hash function , mdc 2 , cbc mac , mathematics , theoretical computer science , computer security , cryptography , cryptographic hash function , encryption , double hashing
We propose new constructions of Message Authentication Codes (MACs) from tweakable or conventional block ciphers. Our new schemes are either stateless and deterministic, nonce-based, or randomized, and provably secure either in the standard model for tweakable block cipher-based ones, or in the ideal cipher model for block cipher-based ones. All our constructions are very efficient, requiring only one call to the underlying (tweakable) block cipher in addition to universally hashing the message. Moreover, the security bounds we obtain are quite strong: they are beyond the birthday bound, and nonce-based/randomized variants provide graceful security degradation in case of misuse, i.e., the security bound degrades linearly with the maximal number of repetitions of nonces/random values.