摘要
在Simmons给出的有仲裁人认证码中,主要研究了五种欺骗攻击.Johnson对这些欺骗成功概率的信息论下界进行了研究.本文则给出了有仲裁人认证码中的敌方和收方的i(0)阶欺骗攻击成功概率的信息论下界,完善了关于欺骗攻击成功概率的下界的研究.
In the authentication codes with arbiter introduced by Simmons.five cheating attacks were mainly explored.The informationtheoretic lower bounds for the probability of successful deception for the five cheating attacks were obtained by Johnsson.In this paper,the information theoretic lower bounds for the probability of successful deception for spoofing attacks of order i by opponent and receiver are obtained.So the lower bounds for the probability of successful deception are perfected.
出处
《电子学报》
EI
CAS
CSCD
北大核心
1999年第4期90-93,97,共5页
Acta Electronica Sinica
基金
国家自然基金
863项目资助
关键词
认证码
认证函数
有仲裁人认证码
i阶欺骗攻击
Authentication code,Authentication function,Spoofing attack of order i ,Authentication code with arbiter