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
Volume6632 LNCS
DOIs
StatePublished - 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)03029743
ISSN (Electronic)16113349

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

Query
Design

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

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 (Vol. 6632 LNCS, 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

Domain extension for MACs beyond the birthday barrier. / Dodis, Yevgeniy; Steinberger, John.

Advances in Cryptology - EUROCRYPT 2011, 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Vol. 6632 LNCS 2011. p. 323-342 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6632 LNCS).

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

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. vol. 6632 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6632 LNCS, pp. 323-342, 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques Advances in Cryptology, EUROCRYPT 2011, Tallinn, Estonia, 5/15/11. https://doi.org/10.1007/978-3-642-20465-4_19
Dodis Y, Steinberger J. 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. Vol. 6632 LNCS. 2011. p. 323-342. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-20465-4_19
Dodis, Yevgeniy ; Steinberger, John. / Domain extension for MACs beyond the birthday barrier. Advances in Cryptology - EUROCRYPT 2011, 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. Vol. 6632 LNCS 2011. pp. 323-342 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{4fbde2fff99e442e844ea4cd379596be,
title = "Domain extension for MACs beyond the birthday barrier",
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.",
author = "Yevgeniy Dodis and John Steinberger",
year = "2011",
doi = "10.1007/978-3-642-20465-4_19",
language = "English (US)",
isbn = "9783642204647",
volume = "6632 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "323--342",
booktitle = "Advances in Cryptology - EUROCRYPT 2011, 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings",

}

TY - GEN

T1 - Domain extension for MACs beyond the birthday barrier

AU - Dodis, Yevgeniy

AU - Steinberger, John

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79958006849&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79958006849&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-20465-4_19

DO - 10.1007/978-3-642-20465-4_19

M3 - Conference contribution

AN - SCOPUS:79958006849

SN - 9783642204647

VL - 6632 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 323

EP - 342

BT - Advances in Cryptology - EUROCRYPT 2011, 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings

ER -