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. © IFIP International Federation for Information Processing 2013.
CITATION STYLE
Kubai, A., Shikata, J., & Watanabe, Y. (2013). Information-theoretically secure aggregate authentication code: Model, bounds, and constructions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8128 LNCS, pp. 16–28). https://doi.org/10.1007/978-3-642-40588-4_2
Mendeley helps you to discover research relevant for your work.