Information-theoretic bounds for authentication codes and block designs
Information-theoretic bounds for authentication codes and block designs
复制标题
DOI：
10.1007/bf00191354
复制
发表时间：
1995-09
影响因子：
3
通讯作者：
D. Pei
中科院分区：
文献类型：
--
作者：
D. Pei
研究了具有保密性和分裂性的认证码.得到了订单欺骗攻击成功欺骗概率的信息论下界。认证码达到下界所需的条件被确定为一个简单的要求。基于结果的简单性，利用所谓的部分平衡设计，提出了一种能达到该下界的认证码的构造方法。
Authentication codes with secrecy and with splitting are investigated. An information-theoretic lower bound for the probability of successful deception for a spoofing attack of orderris obtained. The condition necessary on authentication codes to achieve the lower bound is determined as a single simple requirement. Based on the simplicity of the result a construction, by use of so-called partially balancedt-designs, for authentication codes that can achieve the lower bound is suggested.