摘要
现有的门限多秘密共享方案中,成员的子密钥是由庄家分发的,可能会导致庄家分发时的主动欺骗或无意欺骗,并且子密钥只能使用一次。针对这两个问题,基于离散对数求解的困难性提出了一个新的门限多秘密共享方案。该方案允许成员自主选择子密钥,子密钥可以重复使用,且不需要执行交互协议就能检测出庄家和参与者的欺诈。与现有方案相比,该方案的可行性更强、成员自主权更大,数据利用率更高。
In the present threshold multi-secret sharing schemes, the dealer distributes share to every shareholder, which could lead to the dealer＇s intentional or unintentional cheating in shadow distribution, and the shareholder can only use share once. To solve these two problems, a new multi-secret sharing scheme based on the intractability of the discrete logarithm was presented. In this scheme, every shareholder＇s share is selected by himself （or herself）, and the share can be reused, in addition, the cheating of the dealer and the cheating between shareholders can be detected without using interactive protocol. Compared with the existing schemes, the proposed scheme is more feasible, and the shareholders take more initiatives. Besides, the utilization ratio of the data is higher.
出处
《计算机应用》
CSCD
北大核心
2007年第9期2187-2188,2199,共3页
journal of Computer Applications
