Reference : New Constructions of MACs from (Tweakable) Block Ciphers
Scientific journals : Article
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/34599
New Constructions of MACs from (Tweakable) Block Ciphers
English
Cogliati, Benoît-Michel mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Lee, Jooyoung mailto [KAIST, Korea]
Seurin, Yannick mailto [ANSSI, France]
2017
IACR Transactions on Symmetric Cryptology
International Association for Cryptologic Research
Yes
International
2519-173X
[en] MAC ; Tweakable Block Cipher ; noncemisuse resistance ; graceful security degradation
[en] 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.
Researchers
http://hdl.handle.net/10993/34599
H2020 ; 644209 - HEAT - Homomorphic Encryption Applications and Technology

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
document.pdfAuthor postprint584.89 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.