多个接收者认证码的信息论下界及其组合特征  

INFORMATION-THEORETIC LOWER BOUNDS FOR MULTI-RECEIVER AUTHENTICATION CODES AND ITS COMBINATORIAL CHARACTERIZATION

作　　者：李育强[1] 裴定一[2] 

机构地区：[1]中国科学技术大学研究生院信息安全国家重点实验室,北京100039 [2]广州师范学院数学系,广州510400

出　　处：《应用数学学报》1999年第1期91-98,共8页Acta Mathematicae Applicatae Sinica

摘　　要：对一般的（带保密的）多个接收者认证码进行了讨论，给出了这类认证码的r阶欺 骗攻击成功概率的信息论下界，并利用部分平衡ｔ－设计和狭义区组设计刻划了达到信息论 下界的多个接收者认证码的组合特征。Multi-receiver Authentication Codes with Secrecy are investigated in this pa- per. An information-theoretic lower bound for the probability of successful deception for a spoofing attack of order r is obtained. By use of partially ballanced t-designs and special block designs, the combinatorial characterization of multi-receiver authentication codes that can achieve the lower bound is described.

关 键 词：认证码 欺骗攻击 区组设计 信息论下界 编码规则 

分 类 号：O157.4[理学—数学] O157.2[理学—基础数学]