摘要
研究了可供认证多个信息的具有仲裁人参加的认证码系统,给出了各方欺骗成功的信息论下界。讨论了系统在某一安全水平下,各参与方应掌握的密钥量的大小,以及收发双方密钥之间的大小。
In the paper,we discuss multiple authentication with arbitration, provide information-theoretic lower bounds for the probability of successful deception for the five cheating attacks. We show that sender, receiver and arbitrator must have the size of the secret key space under the security level.
出处
《通信技术》
2001年第6期8-9,12,共3页
Communications Technology
关键词
可仲裁多重认证码
信息论
密钥量
multiple authentication codes with arbitration, information-theoretic lower bounds, size of the secret key space