Information-Theoretically Secure Aggregate Authentication Code: Model, Bounds, and Constructions
Information-Theoretically Secure Aggregate Authentication Code: Model, Bounds, and Constructions
复制标题
DOI：
10.1007/978-3-642-40588-4_2
复制
发表时间：
2013-09
期刊：
影响因子：
--
通讯作者：
Asato Kubai;Junji Shikata;Yohei Watanabe
中科院分区：
文献类型：
--
作者：
Asato Kubai;Junji Shikata;Yohei Watanabe
在许多用户向接收方发送认证消息的认证方案中，为了降低通信复杂度，希望将它们聚合成单个短认证消息。在本文中，为了实现这样的机制在信息论的安全设置，我们首先提出了聚合认证码。具体来说，我们新提出了一个模型和安全定义的聚合认证码。我们还展示了实体的秘密密钥和（聚合）标签的大小上的严格下限。此外，我们提出了最佳（即，最有效的）构造。
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.