Badger - A Fast and Provably Secure MAC

Martin Boesgaard; Ove Scavenius; Thomas Pedersen; Thomas Christensen; Erik  Zenner

Badger - A Fast and Provably Secure MAC

Martin Boesgaard, Ove Scavenius, Thomas Pedersen, Thomas Christensen, Erik Zenner

Cryptico A/S

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

Abstract

We present Badger, a new fast and provably secure MAC based on universal hashing. In the construction, a modied 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 delta-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).

Original language	English
Title of host publication	Proceedings ACNS 2005
Editors	John Ioannidis, Angelos Keromytis, Moti Yung
Place of Publication	London, UK
Publisher	Springer Verlag
Publication date	2005
Pages	176-191
ISBN (Print)	3-540-26223-7
Publication status	Published - 2005
Externally published	Yes
Event	3rd Applied Cryptography and Network Security - New York, NY, United States Duration: 7 Jun 2005 → 10 Jun 2005 Conference number: 3 http://acns2005.cs.columbia.edu/

Conference

Conference	3rd Applied Cryptography and Network Security
Number	3
Country/Territory	United States
City	New York, NY
Period	07/06/2005 → 10/06/2005
Internet address	http://acns2005.cs.columbia.edu/

Series	Lecture Notes in Computer Science
Number	3531
ISSN	0302-9743

OpenUrl availability

Full text

Cite this

@inproceedings{909a1e8394164d3496c0ad2025d76e08,

title = "Badger - A Fast and Provably Secure MAC",

abstract = "We present Badger, a new fast and provably secure MAC based on universal hashing. In the construction, a modied 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 delta-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).",

author = "Martin Boesgaard and Ove Scavenius and Thomas Pedersen and Thomas Christensen and Erik Zenner",

year = "2005",

language = "English",

isbn = "3-540-26223-7",

series = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

number = "3531",

pages = "176--191",

editor = "John Ioannidis and Angelos Keromytis and Moti Yung",

booktitle = "Proceedings ACNS 2005",

address = "Germany",

note = "3rd Applied Cryptography and Network Security, ACNS 2005 ; Conference date: 07-06-2005 Through 10-06-2005",

url = "http://acns2005.cs.columbia.edu/",

}

Badger - A Fast and Provably Secure MAC. / Boesgaard, Martin; Scavenius, Ove; Pedersen, Thomas et al.
Proceedings ACNS 2005. ed. / John Ioannidis; Angelos Keromytis; Moti Yung. London, UK: Springer Verlag, 2005. p. 176-191 (Lecture Notes in Computer Science; No. 3531).

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

TY - GEN

T1 - Badger - A Fast and Provably Secure MAC

AU - Boesgaard, Martin

AU - Scavenius, Ove

AU - Pedersen, Thomas

AU - Christensen, Thomas

AU - Zenner, Erik

N1 - Conference code: 3

PY - 2005

Y1 - 2005

N2 - We present Badger, a new fast and provably secure MAC based on universal hashing. In the construction, a modied 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 delta-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).

AB - We present Badger, a new fast and provably secure MAC based on universal hashing. In the construction, a modied 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 delta-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).

M3 - Article in proceedings

SN - 3-540-26223-7

T3 - Lecture Notes in Computer Science

SP - 176

EP - 191

BT - Proceedings ACNS 2005

A2 - Ioannidis, John

A2 - Keromytis, Angelos

A2 - Yung, Moti

PB - Springer Verlag

CY - London, UK

T2 - 3rd Applied Cryptography and Network Security

Y2 - 7 June 2005 through 10 June 2005

ER -

Badger - A Fast and Provably Secure MAC

Abstract

Conference

OpenUrl availability

Fingerprint

Cite this