首页 | 官方网站   微博 | 高级检索  
     

可选子密钥的门限多秘密共享方案
引用本文:殷凤梅,侯整风.可选子密钥的门限多秘密共享方案[J].计算机应用,2007,27(9):2187-2188.
作者姓名:殷凤梅  侯整风
作者单位:合肥工业大学计算机与信息学院,合肥230009
摘    要:现有的门限多秘密共享方案中,成员的子密钥是由庄家分发的,可能会导致庄家分发时的主动欺骗或无意欺骗,并且子密钥只能使用一次。针对这两个问题,基于离散对数求解的困难性提出了一个新的门限多秘密共享方案。该方案允许成员自主选择子密钥,子密钥可以重复使用,且不需要执行交互协议就能检测出庄家和参与者的欺诈。与现有方案相比,该方案的可行性更强、成员自主权更大,数据利用率更高。

关 键 词:多秘密共享  (t  n)门限方案  Lagrange插值
文章编号:1001-9081(2007)09-2187-02
收稿时间:2007-03-23
修稿时间:2007年3月23日

Self-selecting share threshold multi-secret sharing scheme
YIN Feng-mei,HOU Zheng-feng.Self-selecting share threshold multi-secret sharing scheme[J].journal of Computer Applications,2007,27(9):2187-2188.
Authors:YIN Feng-mei  HOU Zheng-feng
Abstract: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.
Keywords:multi-secret sharing  (t  n) threshold scheme  Lagrange interpolation
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号