Γ-MAC[H, P]: a new universal MAC scheme

  • Authors:

  • Ewan Fleischmann;Christian Forler;Stefan Lucks

  • Affiliations:

  • Chair of Media-Security, Bauhaus-University Weimar, Germany;Chair of Media-Security, Bauhaus-University Weimar, Germany;Chair of Media-Security, Bauhaus-University Weimar, Germany

  • Venue:
  • WEWoRC'11 Proceedings of the 4th Western European conference on Research in Cryptology
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we introduce a new class of universal hash function families called almost regular universal (ε−ARU). Informally, an ε−ARU hash function family is almost universal, and additionally provides almost regularity. Furthermore, we present $\Gamma\mbox{-MAC}\lbrack \rbrack$, a new MAC scheme based on a ε−ARU hash function family. It is the first stateless MAC scheme based on universal hash functions, which requires only one n-bit key. $\Gamma\mbox{-MAC}\lbrack H,P\rbrack$ is provable secure and an alternative to the Wegman-Carter-Shoup (WCS) based MAC scheme, where the security breaks apart in the nonce-reuse scenario [11, 28]. In addition, we show that $\Gamma\mbox{-MAC}\lbrack H,P\rbrack$ can be implemented very efficiently in software. For messages longer than one kilobyte, our $\Gamma\mbox{-MAC}\lbrack H,P\rbrack$ implementation is even faster than the optimized AES-128 implementations from Schwabe and Bernstein from the eBash project.