Skip to Main content Skip to Navigation
Conference papers

Information-Theoretically Secure Aggregate Authentication Code: Model, Bounds, and Constructions

Abstract : In authentication schemes where many users send authenticated messages to a receiver, it is desirable to aggregate them into a single short authenticated message in order to reduce communication complexity. In this paper, in order to realize such a mechanism in information-theoretic security setting, we first propose aggregate authentication codes. Specifically, we newly propose a model and a security definition for aggregate authentication codes. We also show tight lower bounds on sizes of entities’ secret-keys and (aggregated) tags. Furthermore, we present optimal (i.e., most efficient) constructions for aggregate authentication codes.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Wednesday, April 12, 2017 - 10:25:02 AM
Last modification on : Thursday, March 5, 2020 - 4:47:24 PM
Long-term archiving on: : Thursday, July 13, 2017 - 12:21:23 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License


  • HAL Id : hal-01506569, version 1


Asato Kubai, Junji Shikata, Yohei Watanabe. Information-Theoretically Secure Aggregate Authentication Code: Model, Bounds, and Constructions. 1st Cross-Domain Conference and Workshop on Availability, Reliability, and Security in Information Systems (CD-ARES), Sep 2013, Regensburg, Germany. pp.16-28. ⟨hal-01506569⟩



Record views


Files downloads