Cryptology ePrint Archive: Report 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.

Category / Keywords: secret-key cryptography / MAC, variable tag length, Wegman-Carter, security bound

Date: received 22 Nov 2019, last revised 15 May 2020

Contact author: sebati1987 at gmail com, palash at isical ac in

Available format(s): PDF | BibTeX Citation

Version: 20200515:130305 (All versions of this report)

Short URL: ia.cr/2019/1347


[ Cryptology ePrint archive ]