Tight Security Analysis of EHtM MAC

The security of a probabilistic Message Authentication Code (MAC) usually depends on the uniqueness of the random salt which restricts the security to birthday bound of the salt size due to the collision on random salts (e.g XMACR). To overcome the birthday bound limit, the natural approach to use (...

Full description

Bibliographic Details
Main Authors: Avijit Dutta, Ashwin Jha, Mridul Nandi
Format: Article
Language:English
Published: Ruhr-Universität Bochum 2017-09-01
Series:IACR Transactions on Symmetric Cryptology
Subjects:
Online Access:https://tosc.iacr.org/index.php/ToSC/article/view/768