MergeMAC: A MAC for Authentication with Strict Time Constraints and Limited Bandwidth

Ralph Ankele; Florian  Böhl; Simon Friedberger

doi:10.1007/978-3-319-93387-0_20

MergeMAC: A MAC for Authentication with Strict Time Constraints and Limited Bandwidth

Ralph Ankele, Florian Böhl, Simon Friedberger

Department of Information Security

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

44 Downloads (Pure)

Abstract

This paper presents MergeMAC, a MAC that is particularly suitable for environments with strict time requirements and extremely limited bandwidth. MergeMAC computes the MAC by splitting the message into two parts. We use a pseudorandom function (PRF) to map messages to random bit strings and then merge them with a very efficient keyless function. The advantage of this approach is that the outputs of the PRF can be cached for frequently needed message parts. We demonstrate the merits of MergeMAC for authenticating messages on the CAN bus where bandwidth is extremely limited and caching can be used to recover parts of the message counter instead of transmitting it. We recommend an instantiation of the merging function MERGE and analyze the security of our construction. Requirements for a merging function are formally defined and the resulting EUF-CMA security of MergeMAC is proven.

Original language	English
Title of host publication	ACNS 2018 Applied Cryptography & Network security
Editors	Bart Preneel, Frederik Vercauteren
Place of Publication	Leuven, Belgium
Publisher	Springer International Publishing
Pages	381-399
Number of pages	19
Volume	10892
ISBN (Electronic)	978-3-319-93387-0
ISBN (Print)	978-3-319-93386-3
DOIs	https://doi.org/10.1007/978-3-319-93387-0_20
Publication status	Published - 2018

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	10892

Keywords

Symmetric-key cryptography
message authentication code
lightweight
EFFICIENT
automotive
CAN bus

Access to Document

10.1007/978-3-319-93387-0_20

Accepted ManuscriptAccepted author manuscript, 521 KB

Cite this

Ankele, R., Böhl, F., & Friedberger, S. (2018). MergeMAC: A MAC for Authentication with Strict Time Constraints and Limited Bandwidth. In B. Preneel, & F. Vercauteren (Eds.), ACNS 2018 Applied Cryptography & Network security (Vol. 10892, pp. 381-399). (Lecture Notes in Computer Science; Vol. 10892). Springer International Publishing. https://doi.org/10.1007/978-3-319-93387-0_20

@inproceedings{709f3eb7c8ba4066b636d71a50de8a6d,

title = "MergeMAC: A MAC for Authentication with Strict Time Constraints and Limited Bandwidth",

abstract = "This paper presents MergeMAC, a MAC that is particularly suitable for environments with strict time requirements and extremely limited bandwidth. MergeMAC computes the MAC by splitting the message into two parts. We use a pseudorandom function (PRF) to map messages to random bit strings and then merge them with a very efficient keyless function. The advantage of this approach is that the outputs of the PRF can be cached for frequently needed message parts. We demonstrate the merits of MergeMAC for authenticating messages on the CAN bus where bandwidth is extremely limited and caching can be used to recover parts of the message counter instead of transmitting it. We recommend an instantiation of the merging function MERGE and analyze the security of our construction. Requirements for a merging function are formally defined and the resulting EUF-CMA security of MergeMAC is proven. ",

keywords = "Symmetric-key cryptography, message authentication code, lightweight, EFFICIENT, automotive, CAN bus",

author = "Ralph Ankele and Florian B{\"o}hl and Simon Friedberger",

year = "2018",

doi = "10.1007/978-3-319-93387-0_20",

language = "English",

isbn = "978-3-319-93386-3",

volume = "10892",

series = "Lecture Notes in Computer Science",

publisher = "Springer International Publishing",

pages = "381--399",

editor = "Preneel, {Bart } and Vercauteren, {Frederik }",

booktitle = "ACNS 2018 Applied Cryptography & Network security",

}

Ankele, R, Böhl, F & Friedberger, S 2018, MergeMAC: A MAC for Authentication with Strict Time Constraints and Limited Bandwidth. in B Preneel & F Vercauteren (eds), ACNS 2018 Applied Cryptography & Network security. vol. 10892, Lecture Notes in Computer Science, vol. 10892, Springer International Publishing, Leuven, Belgium, pp. 381-399. https://doi.org/10.1007/978-3-319-93387-0_20

MergeMAC: A MAC for Authentication with Strict Time Constraints and Limited Bandwidth. / Ankele, Ralph; Böhl, Florian ; Friedberger, Simon.
ACNS 2018 Applied Cryptography & Network security. ed. / Bart Preneel; Frederik Vercauteren. Vol. 10892 Leuven, Belgium: Springer International Publishing, 2018. p. 381-399 (Lecture Notes in Computer Science; Vol. 10892).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - MergeMAC

T2 - A MAC for Authentication with Strict Time Constraints and Limited Bandwidth

AU - Ankele, Ralph

AU - Böhl, Florian

AU - Friedberger, Simon

PY - 2018

Y1 - 2018

N2 - This paper presents MergeMAC, a MAC that is particularly suitable for environments with strict time requirements and extremely limited bandwidth. MergeMAC computes the MAC by splitting the message into two parts. We use a pseudorandom function (PRF) to map messages to random bit strings and then merge them with a very efficient keyless function. The advantage of this approach is that the outputs of the PRF can be cached for frequently needed message parts. We demonstrate the merits of MergeMAC for authenticating messages on the CAN bus where bandwidth is extremely limited and caching can be used to recover parts of the message counter instead of transmitting it. We recommend an instantiation of the merging function MERGE and analyze the security of our construction. Requirements for a merging function are formally defined and the resulting EUF-CMA security of MergeMAC is proven.

AB - This paper presents MergeMAC, a MAC that is particularly suitable for environments with strict time requirements and extremely limited bandwidth. MergeMAC computes the MAC by splitting the message into two parts. We use a pseudorandom function (PRF) to map messages to random bit strings and then merge them with a very efficient keyless function. The advantage of this approach is that the outputs of the PRF can be cached for frequently needed message parts. We demonstrate the merits of MergeMAC for authenticating messages on the CAN bus where bandwidth is extremely limited and caching can be used to recover parts of the message counter instead of transmitting it. We recommend an instantiation of the merging function MERGE and analyze the security of our construction. Requirements for a merging function are formally defined and the resulting EUF-CMA security of MergeMAC is proven.

KW - Symmetric-key cryptography

KW - message authentication code

KW - lightweight

KW - EFFICIENT

KW - automotive

KW - CAN bus

UR - https://link.springer.com/chapter/10.1007/978-3-319-93387-0_20

UR - https://eprint.iacr.org/2018/342

U2 - 10.1007/978-3-319-93387-0_20

DO - 10.1007/978-3-319-93387-0_20

M3 - Conference contribution

SN - 978-3-319-93386-3

VL - 10892

T3 - Lecture Notes in Computer Science

SP - 381

EP - 399

BT - ACNS 2018 Applied Cryptography & Network security

A2 - Preneel, Bart

A2 - Vercauteren, Frederik

PB - Springer International Publishing

CY - Leuven, Belgium

ER -

Ankele R, Böhl F, Friedberger S. MergeMAC: A MAC for Authentication with Strict Time Constraints and Limited Bandwidth. In Preneel B, Vercauteren F, editors, ACNS 2018 Applied Cryptography & Network security. Vol. 10892. Leuven, Belgium: Springer International Publishing. 2018. p. 381-399. (Lecture Notes in Computer Science). Epub 2018 Jun 10. doi: 10.1007/978-3-319-93387-0_20

MergeMAC: A MAC for Authentication with Strict Time Constraints and Limited Bandwidth

Abstract

Publication series

Keywords

Access to Document

Other files and links

Cite this