Characterization of Optimal Authentication Codes with Arbitration
Characterization of Optimal Authentication Codes with Arbitration
复制标题
DOI：
10.1007/3-540-48970-3_25
复制
发表时间：
1999-04
期刊：
影响因子：
--
通讯作者：
D. Pei;Yuqiang Li-;Yejing Wang;R. Safavi-Naini
中科院分区：
文献类型：
--
作者：
D. Pei;Yuqiang Li-;Yejing Wang;R. Safavi-Naini
本文研究了带仲裁的认证码（A2-码）。如果A2-码的欺骗概率达到信息论的下界，并且具有最少的密钥数，则称A2-码为最优的。我们用组合设计的方法给出了最优A2-码的特征。这意味着最优A2-码的构造被简化为相应的组合结构的构造。
In this paper we study authentication codes with arbitration (A2-codes). AnA2-code is called optimal if its cheating probabilities achieve their information-theoretic lower bounds, and has minimum number of keys. We give characterization of optimalA2-codes in terms of combinatorial designs. This means that construction of optimalA2-codes is reduced to the construction of the corresponding combinatorial structures.