A fast and provably secure MAC (2005)
Cached
Download Links
| Venue: | In Applied Cryptography and Network Security: Third International Conference, ACNS 2005 |
| Citations: | 2 - 0 self |
BibTeX
@INPROCEEDINGS{Boesgaard05afast,
author = {Martin Boesgaard and Ove Scavenius and Thomas Pedersen and Thomas Christensen and Erik Zenner},
title = {A fast and provably secure MAC},
booktitle = {In Applied Cryptography and Network Security: Third International Conference, ACNS 2005},
year = {2005},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We present Badger, a new fast and provably secure MAC based on universal hashing. In the construction, a modified tree hash that is more efficient than standard tree hashing is used and its security is proven. Furthermore, in order to derive the core hash function of the tree, we use a novel technique for reducing ∆-universal function families to universal families. The resulting MAC is very efficient on standard platforms both for short and long messages. As an example, for a 64-bit tag, it achieves performances up to 2.2 and 1.3 clock cycles per byte on a Pentium III and Pentium 4 processor, respectively. The forgery probability is at most 2 −52.2.
