期刊文献+

可区分共享者角色的可验证的多秘密共享方案

A Verifiable Multi-Secret Sharing Scheme Differentiating the Roles of the Sharers
下载PDF
导出
摘要 针对前期研究中可区分秘密分享者角色的防欺诈秘密共享方案不能抵抗秘密分发者欺诈的缺点,提出一个改进的可区分共享者角色的可验证的多秘密共享方案.该方案不仅能抵抗共享者的欺骗,也能抵抗秘密分发者的欺诈;各共享者的秘密份额可以重复使用,每个共享者仅需维护一个秘密份额即可共享多个秘密;同时可以方便地实现数字签名,是一个可验证的多秘密共享方案. In view of the shortcomings in resisting the secret dealer's fraud in the anti-fraud secret-sharing scheme differentiating the roles of the secret sharers put forwarded in early time,the author proposed an improved verifiable multi-secret sharing scheme differentiating the roles of the secret sharers.This scheme is able to resist the fraud from sharers and share dealers,and it can only one reusable secret shadow is required to be kept by each sharer for sharing multiple secrets,and it can easily realize the implementation of digital signature.
作者 刘恒
出处 《郑州大学学报(工学版)》 CAS 北大核心 2011年第5期77-79,共3页 Journal of Zhengzhou University(Engineering Science)
基金 广西省自然科学基金资助项目(0832286) 广西教育科学"十一五"规划项目(2008B40) 玉林师范学院青年科研资助项目(2009YJQN12)
关键词 多秘密共享 共享者角色 可验证 数字签名 multi-secret sharing role of the secret sharers verifiable digital signature
  • 相关文献

参考文献7

  • 1SHAMIR A. How to share a secret [ J ]. Comm of ACM, 1979, 22(1) : 612 -613.
  • 2BLAKLEY G R. Safeguarding cryptographic keys[ C ] ,//Proc NCC, AFIPS Press, Montvale, 1979, 48: 313 -317.
  • 3ASMUTH C, BLOOM J. A Modular approach to key safegrarding[ J]. IEEE Transactions On Information Theory, 1983, 29(2): 208-210.
  • 4KARNIN E D, GREEN J W, HELLMAN M E. On sharing secret systems[J]. IEEE Transactions On In- formation Theory, 1983, 29 ( 1 ) : 35 - 41.
  • 5庞辽军,李慧贤,李志洁,王育民.一个可验证的门限多秘密共享方案[J].哈尔滨工业大学学报,2008,40(9):1462-1465. 被引量:1
  • 6周洪伟,郭渊博,李沁.门限多重秘密共享方案[J].计算机工程与设计,2008,29(8):1946-1947. 被引量:9
  • 7LIU Heng, WU Hua-jian. A cheating-proof secret-sha- ring scheme capable of differentiating the roles of the secret sharers[ J ]. Journal of zhengzhou : Natural sci- ence,2006,38(3) : 35 -38.

二级参考文献20

  • 1许春香,肖国镇.门限多重秘密共享方案[J].电子学报,2004,32(10):1688-1689. 被引量:41
  • 2庞辽军,王育民.基于RSA密码体制(t,n)门限秘密共享方案[J].通信学报,2005,26(6):70-73. 被引量:32
  • 3庞辽军,姜正涛,王育民.基于一般访问结构的多重秘密共享方案[J].计算机研究与发展,2006,43(1):33-38. 被引量:22
  • 4Tan K J,Zhu H W, Gu S J.Cheater identification in (t,n) threshold scheme[J].Computer Communication, 1999,22(8):762-765.
  • 5Okada K, Kurosawa K.MDS secret sharing scheme secure against cheaters[J].IEEE Transactions on Information Theory,2000,46 (3):1078-1081.
  • 6Yang C C,Chang T Y, Hwang M S.A (t,n) multi-secret sharing scheme[J].Applied Mathematics and Comutation,2004,151 (2): 483-490.
  • 7SHAMIR A. How to share a secret [J]. Communications of the ACM, 1979, 22(11) :612 -613.
  • 8BLAKLEY G. Safeguarding cryptographic keys [ C ]// Proc AFIPS 1979 Natl Conf. New York: AFIPS press, 1979:313 -317.
  • 9LIN T Y, WU T C. (t,n) threshold verifiable multisecret sharing scheme based on faetorisation intractability and discrete logarithm modulo a composite problems [J ]. IEE Proc Comput Digit Tech, 1999, 146(5): 264-268.
  • 10PANG L J, WANG Y M. A new (t, n) multi-secret sharing scheme based on Shamir's secret sharing [J]. Applied Mathemalics and Compulation, 2005, 167(2) : 840 - 848.

共引文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部