【摘要】 本文利用密钥分享方案,特别是(k,n)-门限方案和智力扑克协议作为工具,从目前所有的无仲裁人的认证码可以构造出安全高效的有仲裁人的认证码.分析表明,得到的新码可以抵抗来自各方(包括通信双方,敌方,仲裁人,以及某一方与某些仲裁人的合谋)的欺骗攻击,同时具有原码的所有优良性能。它的实现比较简单,为了抵抗来自仲裁人的攻击,只需增加一定的冗余度,所增加的冗余比特的多少随着安全度要求的变化而变化。更多还原

【Abstract】 Using the secret-sharing schemes, especialy the (k,n)-threshold schemes as tools, one method of constructing A2-Code from the general A-Code was given. It was shown that the new codes have all the good properties of the old ones, such as the known information-theoretical and combinatorial bounds of the latters, although asking for some data bits extension. Clearly, this method shows a new dimension of how to design the secret and efficient A2-code.更多还原