论文部分内容阅读
本文利用密钥分享方案,特别是(k,n)-门限方案和智力扑克协议作为工具,从目前所有的无仲裁人的认证码可以构造出安全高效的有仲裁人的认证码.分析表明,得到的新码可以抵抗来自各方(包括通信双方,敌方,仲裁人,以及某一方与某些仲裁人的合谋)的欺骗攻击,同时具有原码的所有优良性能。它的实现比较简单,为了抵抗来自仲裁人的攻击,只需增加一定的冗余度,所增加的冗余比特的多少随着安全度要求的变化而变化。
In this paper, we use the key sharing scheme, especially the (k, n) -threshold scheme and the intellectual poker protocol as a tool to construct a secure and efficient authentication code with arbitrator from all the current non-arbitrator authentication codes. The resulting new code is able to resist fraudulent attacks from all sides, including the two parties to communications, the enemy, the arbitrator, and the conspiracy of some party with some arbitrators, and at the same time has all the fine performance of the original code. Its implementation is relatively simple, in order to resist the attack from the arbitrator, only need to add a certain degree of redundancy, the number of redundant bits increased with the security requirements change.