Domain extension for MACs beyond the birthday barrier

Yevgeniy Dodis, John Steinberger

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Given an n-bit to n-bit MAC (e.g., a fixed key blockcipher) with MAC security ε against q queries, we design a variable-length MAC achieving MAC security O(εq,poly(n)) against queries of total length qn. In particular, our construction is the first to break the "birthday barrier" for MAC domain extension from noncompressing primitives, since our security bound is meaningful even for q = 2n/poly(n) (assuming ε is the best possible O(1/2n)). In contrast, the previous best construction for MAC domain extension for n-bit to n-bit primitives, due to Dodis and Steinberger [11], achieved MAC security of O(εq2(log q)2), which means that q cannot cross the "birthday bound" of 2n/2.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology - EUROCRYPT 2011, 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
Pages323-342
Number of pages20
DOIs
StatePublished - Jun 9 2011
Event30th Annual International Conference on the Theory and Applications of Cryptographic Techniques Advances in Cryptology, EUROCRYPT 2011 - Tallinn, Estonia
Duration: May 15 2011May 19 2011

Publication series

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

Other

Other30th Annual International Conference on the Theory and Applications of Cryptographic Techniques Advances in Cryptology, EUROCRYPT 2011
CountryEstonia
CityTallinn
Period5/15/115/19/11

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Dodis, Y., & Steinberger, J. (2011). Domain extension for MACs beyond the birthday barrier. In Advances in Cryptology - EUROCRYPT 2011, 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 323-342). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6632 LNCS). https://doi.org/10.1007/978-3-642-20465-4_19