Cryptology ePrint Archive: Report 2019/1127

Symmetric-key Corruption Detection : When XOR-MACs Meet Combinatorial Group Testing

Kazuhiko Minematsu and Norifumi Kamiya

Abstract: We study a class of MACs, which we call corruption detectable MAC, that is able to not only check the integrity of the whole message, but also detect a part of the message that is corrupted. It can be seen as an application of the classical Combinatorial Group Testing (CGT) to message authentication. However, previous work on this application has inherent limitation in communication. We present a novel approach to combine CGT and a class of linear MACs (XOR-MAC) that enables to break this limit. Our proposal, XOR-GTM, has a significantly smaller communication cost than any of the previous ones, keeping the same corruption detection capability. Our numerical examples for storage application show a reduction of communication by a factor of around 15 to 70 compared with previous schemes. XOR-GTM is parallelizable and is as efficient as standard MACs. We prove that XOR-GTM is provably secure under the standard pseudorandomness assumptions.

Category / Keywords: secret-key cryptography / MAC, Corruption Detection, Combinatorial Group Testing, XOR-MAC

Original Publication (with major differences): ESORICS 2019
DOI:
https://doi.org/10.1007/978-3-030-29959-0_29

Date: received 30 Sep 2019

Contact author: k-minematsu at ah jp nec com, kamiya@bc jp nec com

Available format(s): PDF | BibTeX Citation

Version: 20191002:075759 (All versions of this report)

Short URL: ia.cr/2019/1127


[ Cryptology ePrint archive ]