## CryptoDB

### Paper: New Constructions of MACs from (Tweakable) Block Ciphers

Authors: Benoît Cogliati , University of Luxembourg Jooyoung Lee , KAIST Yannick Seurin , ANSSI, Paris DOI: 10.13154/tosc.v2017.i2.27-58 URL: https://tosc.iacr.org/index.php/ToSC/article/view/637 Search ePrint Search Google 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.
##### BibTeX
@article{tosc-2017-28481,
title={New Constructions of MACs from (Tweakable) Block Ciphers},
journal={IACR Trans. Symmetric Cryptol.},
publisher={Ruhr-Universität Bochum},
volume={2017, Issue 2},
pages={27-58},
url={https://tosc.iacr.org/index.php/ToSC/article/view/637},
doi={10.13154/tosc.v2017.i2.27-58},
author={Beno&icirc;t Cogliati and Jooyoung Lee and Yannick Seurin},
year=2017
}