| HAL-Inria | Publications, software ... of Inria's scientists |
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.
Cited literature [12 references]
https://hal.inria.fr/hal-01506569
Contributor : Hal Ifip <>
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
Contributor : Hal Ifip <>
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
File
978-3-642-40588-4_2_Chapter.pd...
Files produced by the author(s)
Licence
Distributed under a Creative Commons Attribution 4.0 International License