Paper 2017/837
Tight Security Analysis of EHtM MAC
Avijit Dutta, Ashwin Jha, and Mridul Nandi
Abstract
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 (a) either a larger random salt (e.g
Metadata
- Available format(s)
-
PDF
- Publication info
- Published by the IACR in FSE 2018
- Keywords
- Probabilistic MACEHtMXMACRAlternating Cycle.
- Contact author(s)
- avirocks dutta13 @ gmail com
- History
- 2017-08-31: received
- Short URL
- https://ia.cr/2017/837
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2017/837, author = {Avijit Dutta and Ashwin Jha and Mridul Nandi}, title = {Tight Security Analysis of {EHtM} {MAC}}, howpublished = {Cryptology {ePrint} Archive, Paper 2017/837}, year = {2017}, url = {https://eprint.iacr.org/2017/837} }