%0 Conference Proceedings
%T Information-Theoretically Secure Aggregate Authentication Code: Model, Bounds, and Constructions
%+ Graduate School of Environment and Information Sciences [Yokohama]
%A Kubai, Asato
%A Shikata, Junji
%A Watanabe, Yohei
%Z Part 1: Modern Cryptography
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 1st Cross-Domain Conference and Workshop on Availability, Reliability, and Security in Information Systems (CD-ARES)
%C Regensburg, Germany
%Y Alfredo Cuzzocrea
%Y Christian Kittl
%Y Dimitris E. Simos
%Y Edgar Weippl
%Y Lida Xu
%I Springer
%3 Security Engineering and Intelligence Informatics
%V LNCS-8128
%P 16-28
%8 2013-09-02
%D 2013
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%2 https://inria.hal.science/hal-01506569/document
%2 https://inria.hal.science/hal-01506569/file/978-3-642-40588-4_2_Chapter.pdf
%L hal-01506569
%U https://inria.hal.science/hal-01506569
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC5
%~ IFIP-WG
%~ IFIP-TC8
%~ IFIP-CD-ARES
%~ IFIP-WG8-4
%~ IFIP-WG8-9
%~ IFIP-LNCS-8128