History-free sequential aggregate MAC revisited. (English) Zbl 1426.94105

Hirose, Shoichi; Shikata, Junji

Steinfeld, Ron (ed.) et al., Provable security. 13th international conference, ProvSec 2019, Cairns, QLD, Australia, October 1–4, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11821, 77-93 (2019).

Summary: O. Eikemeier et al. introduced and formalized sequential aggregate MAC in [SCN 2010, Lect. Notes Comput. Sci. 6280, 309–328 (2010; Zbl 1291.94078)]. They also constructed a history-free scheme for sequential aggregate MAC using a pseudorandom permutation and a MAC function. In this paper, we reconsider history-free sequential aggregate MAC. We give a definition of its security requirement, which is more general than that of Eikemeier et al. Then, we propose two new schemes for history-free sequential aggregate MAC. The first scheme is constructed with a pseudorandom permutation and a pseudorandom function. The second scheme is constructed only with a pseudorandom function under two keying strategies and without a pseudorandom permutation. We reduce the security of the proposed schemes to the security properties of their underlying primitives. We also discuss an instantiation of the second scheme using a pseudorandom function based on a cryptographic hash function

•  Wikipedia
•  Wolfram MathWorld

such as HMAC with SHA-2 in some detail.
For the entire collection see [Zbl 1425.94004].

MSC:

94A60	Cryptography
94A62	Authentication, digital signatures and secret sharing

Keywords:

message authentication; aggregate MAC; block cipher; hash function; provable security

Citations:

Zbl 1291.94078