XOR MACs: New methods for message authentication using finite pseudorandom functions

  • Mihir Bellare
  • , Roch Guérin
  • , Phillip Rogaway

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

170 Scopus citations

Abstract

We describe a new approach for authenticating a message using a finite pseudorandom function (PRF). Our “XOR MACs” have several nice features, including parallelizability, incrementality, and provable security. The finite PRF can be “instantiated” via DES (yielding an alternative to the CBC MAC), via the compression function of MD5 (yielding an alternative to various “keyed MD5” constructions), or in a variety of other ways. The proven security is quantitative, expressing the adversary’s inability to forge in terms of her (presumed) inability to break the underlying finite PRF. This is backed by attacks showing the analysis is tight. Our proofs exploit linear algebraic techniques.

Original languageEnglish
Title of host publicationAdvances in Cryptology ― CRYPTO 1995 - 15th Annual International Cryptology Conference, Proceedings
EditorsDon Coppersmith
PublisherSpringer Verlag
Pages15-28
Number of pages14
ISBN (Print)3540602216, 9783540602217
DOIs
StatePublished - 1995
Event15th Annual International Cryptology Conference, CRYPTO 19995 - Santa Barbara, United States
Duration: Aug 27 1995Aug 31 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume963
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th Annual International Cryptology Conference, CRYPTO 19995
Country/TerritoryUnited States
CitySanta Barbara
Period08/27/9508/31/95

Fingerprint

Dive into the research topics of 'XOR MACs: New methods for message authentication using finite pseudorandom functions'. Together they form a unique fingerprint.

Cite this