一个可验证的门限多秘密分享方案  

A Verifiable Multiple Secrets Sharing Scheme

作　　者：何明星[1] 范平志[2] 袁丁[2] 

机构地区：[1]西南交通大学计算机与通信学院,四川成都610031 [2]西华大学计算机科学与工程系,四川成都610039

出　　处：《四川工业学院学报》2003年第B12期121-124,共4页Journal of Sichuan University of Science and Technology

基　　金：国家自然科学基金(No:69825102)的资助。

摘　　要：基于离散对数计算和大整数分解的困难性、利用RSA加密体制提出了一个新的门限多秘密分享方案。该方案通过零知识证明等协议来防止秘密分发者和秘密分享者的欺诈行为,因而是一个可验证的门限多秘密分享方案。该方案还具有:秘密影子可重复使用;子秘密影子可离线验证;供分享的秘密不需事先作预计算等特点。该方案可用于会议密钥(秘密)分配、安全多方计算、门限数字签名等应用领域。A new multiple secrets sharing scheme, based on the intractability of the discrete logarithm (DL) and the RSA encryption algorithm is presented, in which the participants' shadows remain secret and can be reused, even if all subshadows are made public. Meanwhile, by using a zero-knowledge proof protocol, the validity verification of shadow and subshadow is also provided to prevent both dealer cheating and other participant cheating, and any freely given secrets without pre-computation by dealer can be reconstructed. The scheme can be applied to many areas such as conference key distribution, secure multi-part-computation, threshold signature etc.

关 键 词：秘密分享 门限体制 离散对数 RSA加密体制 零知识证明 

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