可验证的Asmuth-Bloom秘密共享方案  

The Asmuth-bloom Verifiable Threshold Sharing Scheme

作　　者：于洋[1] 刘焕平[1] 

机构地区：[1]哈尔滨师范大学

出　　处：《哈尔滨师范大学自然科学学报》2012年第3期20-23,共4页Natural Science Journal of Harbin Normal University

摘　　要：针对现有基于中国剩余定理的可验证秘密共享方案存在的问题,结合模运算与同余性质构造了一个可验证Asmuth-Bloom秘密共享方案,并分析了方案的正确性和安全性.该方案在计算秘密份额的过程中,将生成的额外数据以离散对数的形式公开作为验证信息.参与者利用验证信息可以验证秘密份额的有效性,不仅能防止秘密分发者的欺骗,而且能够检测参与者之间的相互欺诈.In succession, Aiming at the existing problems of verifiable secret schemes based on Chinese Remainder Theorem, a verifiable Asmuth - Bloom secret sharing scheme is constructed. Then the validity and security of the scheme are analyzed. In the process of computing shares, some additional data are generated as the verify information which are opened to all participants in the form of discrete logarithm. Participants can verify the correctness of shares by using public verifying information. Consequently, the scheme can not only detect fraud amon~ the Participants but also Prevent dealer＇s e, hentin~ h^h~vinr

关 键 词：中国剩余定理 Asmuth—Bloom秘密共享方案 验证 

分 类 号：TN918.1[电子电信—通信与信息系统]