Paper 2019/1347
Variants of Wegman-Carter Message Authentication Code Supporting Variable Tag Lengths
Sebati Ghosh and Palash Sarkar
Abstract
In this work, we study message authentication code (MAC) schemes supporting variable tag lengths. We provide a formalisation of such a scheme. Several variants of the classical Wegman- Carter MAC scheme are considered. Most of these are shown to be insecure by pointing out detailed attacks. One of these schemes is highlighted and proved to be secure. We further build on this scheme to obtain single-key variable tag length MAC schemes utilising either a stream cipher or a short-output pseudo-random function. These schemes can be efficiently instantiated using practical well known primitives.
Metadata
- Available format(s)
-
PDF
- Category
- Secret-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- MACvariable tag lengthWegman-Cartersecurity bound
- Contact author(s)
-
sebati1987 @ gmail com
palash @ isical ac in - History
- 2020-05-15: last of 2 revisions
- 2019-11-22: received
- See all versions
- Short URL
- https://ia.cr/2019/1347
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/1347,
author = {Sebati Ghosh and Palash Sarkar},
title = {Variants of Wegman-Carter Message Authentication Code Supporting Variable Tag Lengths},
howpublished = {Cryptology ePrint Archive, Paper 2019/1347},
year = {2019},
note = {\url{https://eprint.iacr.org/2019/1347}},
url = {https://eprint.iacr.org/2019/1347}
}
