Asmuth-Bloom方案的抗欺骗性能  

The Anti-cheating property of the Asmuth-Bloomsecret sharing system

作　　者：马文平[1] 任亚安[1] 

机构地区：[1]西安电子科技大学计算机网络与信息安全教育部重点实验室,陕西西安710071

出　　处：《西安电子科技大学学报》2004年第1期36-38,共3页Journal of Xidian University

基　　金：自然科学基金重大项目资助(603113104);陕西省自然科学基金资助项目(2000X03)

摘　　要：MartinTompa和HeatherWoll证明Shamir门限方案在防止主动欺骗的情况下是不安全的,他们的攻击被称作Tompa Woll型攻击.文中指出Asmuth bloom门限方案在防止强欺骗的情况下也是不安全,一个小的改进可在保持与原方案相同的安全性和有效性的情况下,防止强欺骗.Martin Tompa and Heather Woll demonstrated that Shamir's Scheme is not secure against cheating and this attack is called Tompa-Woll attack. In this paper, we show that the Asmuth-Bloom's System is also not secure against strong cheating. A little modification of this scheme retains the security and efficiency of the original scheme and is secure against strong cheating.

关 键 词：密钥分享 门限方案 最大距离可分码 Tompa-Woll攻击 Asmuth-Bloom方案 抗欺骗性能 

分 类 号：TN918.2[电子电信—通信与信息系统] TN911.22[电子电信—信息与通信工程]