期刊文献+

多分发者的秘密共享方案 被引量:1

Secret sharing scheme based on multi-dealer
下载PDF
导出
摘要 传统的秘密共享方案都是基于一个秘密分发者。而在某些实际的应用中,被共享的秘密信息也许会被多个秘密分发者共同来维护。基于Shamir门限方案和离散对数问题的困难性提出了一种多分发者的秘密共享方案。在该方案中,多个秘密分发者可以共同维护秘密信息,并且任一分发者可以动态地更新秘密信息。在秘密的动态更新过程中,仅需要公布少量的信息而不需要进行对秘密份额的重新分发。方案的安全性依赖于Shamir门限方案的安全性和离散对数问题的困难性。 The traditional secret sharing schemes are all based on a single dealer.However,in reality,maybe there are many applications where the shared secret is commonly maintained by several dealers.In this paper,a novel secret sharing scheme is proposed based on the multi-dealer by means of Shamir's threshold scheme and discrete logarithm problem.In this scheme, several dealers can commonly maintain the secret and the secret can be dynamically renewed by any dealer.In the secret updated phase,the dealer just needs to publish a little public information instead of redistributing the new secret shadows.Its security is based on the security of Shamir's threshold scheme and the intractability of discrete logarithm problem.
出处 《计算机工程与应用》 CSCD 北大核心 2009年第6期10-12,共3页 Computer Engineering and Applications
基金 国家自然科学基金~~
关键词 秘密共享 多分发者 离散对数 门限机制 secret sharing multi-dealer discrete logarithm threshold scheme
  • 相关文献

参考文献9

  • 1Shamir A.How to share a secret[J].Communications of the ACM, 1979,22( 11 ) :612-613.
  • 2Blakley G.Safeguarding cryptographic keys[C]//Proceedings of the National Computer Conference.Montvale: NCC, 1979 : 313-317.
  • 3Chor B,Goldwasser S.Verifiable secret sharing and achieving simultaneity in the presence of faults[C]//Proceedings of 26th IEEE Symposium on Foundations of Computer Science.Portland:IEEE, 1985 : 383-395.
  • 4Wu T C,Wu T S.Cheating detection and cheater identification in secret sharing schemes[J].lEE Proc Comput Digit Tech, 1995,142 ( 5 ) : 367-369.
  • 5Ham L.Efficient sharing(broadcasting) of multiple secret[J].IEE Proc Comput Digit Tech, 1995,142(3 ) :237-240.
  • 6庞辽军,柳毅,王育民.一个有效的(t,n)门限多重秘密共享体制[J].电子学报,2006,34(4):587-589. 被引量:26
  • 7Zhao J J,Zhang J Z,Zhao R.A practical verifiable multi-secret sharing scheme[J].Computer Standards & Interfaces, 2007,29 ( 1 ) : 138-141.
  • 8Shao J,cao Z F,A new efficient(t,n)verifiable multi-secret sharing (VMSS) based on YCH scheme[J].Applied Mathematics and Computation, 2005,168 ( 1 ) : 135-140.
  • 9Hwang R J,Chang C C.An on-line secret sharing scheme for multisecrets[J].Computer Communications, 1998,21 ( 13 ) : 1170-1176.

二级参考文献1

共引文献25

同被引文献9

  • 1Chor B, Goldwasser S. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults[C]//Proceedings of the 26th IEEE Symposium on Foundations of Computer Science. Portland, USA: IEEE Press, 1985: 383-395.
  • 2Wu T C, Wu T S. Cheating Detection and Cheater identification in Secret Sharing Schemes[J]. IEEE Computer Digit Technology, 1995, 142(5): 367-369.
  • 3Ham L. Efficient Sharing(Broadcasting) of Multiple Secret[J]. IEEE Computer Digit Technology, 1995, 142(3): 237-240.
  • 4Zhao Jianjie, Zhang Jianzhong, Zhao Rong. A Practical Verifiable Multi-secret Sharing Scheme[J]. Computer Standards & Interfaces, 2007, 29(1): 138-141.
  • 5Hwang R J, Chang C C. An On-line Secret Sharing Scheme for Multi-secret[J]. Computer Communication, 1998, 21(13): 1170- 1176.
  • 6Biggs N L. Discrete Mathematics[M]. New York, USA: Oxford University Press, 1989.
  • 7Dehkordi M H, Mashhadi S. New Efficient and Practical Verifiable Multi-secret Sharing Scheme[J]. Information Sciences, 2008, 178(5): 2262-2274.
  • 8石润华,仲红,黄刘生.动态的多重秘密共享方案[J].计算机工程,2008,34(9):170-171. 被引量:6
  • 9贺军,李丽娟,李喜梅.一种新的可验证多秘密共享方案[J].计算机工程,2009,35(9):119-120. 被引量:7

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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