Abstract

We introduce group-testing aggregate message authentication code (GTA MAC) and provide its formal study. We first specify its syntax and security requirements. Then, we present a scheme of generic construction which applies non-adaptive group-testing to aggregate MAC. We also confirm the security of the generic construction based on that of underlying aggregate MAC and a useful property of matrices representing non-adaptive group-testing. In addition, we instantiate the generic construction using the aggregate MAC scheme proposed by Katz and Lindell or a scheme using a cryptographic hash function for aggregating tags. Finally, we present some implementation results to show the effectiveness of our proposed GTA MAC.

Highlights

  • The tag is computed with a cryptographic symmetrickey primitive called a Message authentication code (MAC) function such as HMAC [1], [2] and CMAC [3], [4]

  • We show that the generic construction enables us to reduce the security of group-testing aggregate MAC (GTA MAC) to that of aggregate MAC and a wellknown property of matrices representing group-testing

  • KATZ-LINDELL AGGREGATE MAC SCHEME We describe an aggregate MAC scheme proposed by Katz and Lindell [5]

Read more

Summary

BACKGROUND

The number of IoT (Internet of Things) devices is increasing, and there will be an enormous number of devices connected to networks including 5G in the near future. RELATED WORK Katz and Lindell [5] initiated formal study of aggregate MAC They formalized its syntax and security and proposed a scheme with a proof of its security on the assumption that the underlying MAC function is unforgeable. Group testing is applied to MAC by Goodrich et al [14], Minematsu [15], and Minematsu and Kamiya [16] Their schemes are different from ours in that aggregating tags from multiple users is out of their scope. After our proposal [7], Ogawa et al [20] proposed a GTA MAC scheme in the same setting as ours Their scheme reduces the total number of tags substantially but identifies invalid messages probabilistically

ORGANIZATION
MAC FUNCTION
UNFORGEABILITY VERSUS SOUNDNESS
SYNTAX
GENERIC CONSTRUCTION OF GTA MAC SCHEME
GENERIC CONSTRUCTION
UNFORGEABILITY
IDENTIFIABILITY
GTA MAC SCHEME BASED ON KATZ-LINDELL AGGREGATE MAC
GROUP-TESTING MATRIX
VIII. CONCLUSION
Findings
GTA MAC
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.