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.
Type de document :
Communication dans un congrès
Alfredo Cuzzocrea; Christian Kittl; Dimitris E. Simos; Edgar Weippl; Lida Xu. 1st Cross-Domain Conference and Workshop on Availability, Reliability, and Security in Information Systems (CD-ARES), Sep 2013, Regensburg, Germany. Springer, Lecture Notes in Computer Science, LNCS-8128, pp.16-28, 2013, Security Engineering and Intelligence Informatics
https://hal.inria.fr/hal-01506569
Contributeur : Hal Ifip
<>
Soumis le : mercredi 12 avril 2017 - 10:25:02
Dernière modification le : mercredi 12 avril 2017 - 14:40:01
Document(s) archivé(s) le : jeudi 13 juillet 2017 - 12:21:23
Asato Kubai, Junji Shikata, Yohei Watanabe. Information-Theoretically Secure Aggregate Authentication Code: Model, Bounds, and Constructions. Alfredo Cuzzocrea; Christian Kittl; Dimitris E. Simos; Edgar Weippl; Lida Xu. 1st Cross-Domain Conference and Workshop on Availability, Reliability, and Security in Information Systems (CD-ARES), Sep 2013, Regensburg, Germany. Springer, Lecture Notes in Computer Science, LNCS-8128, pp.16-28, 2013, Security Engineering and Intelligence Informatics. 〈hal-01506569〉
