期刊文献+

动态的多重秘密共享方案 被引量:6

Dynamic Multi-secret Sharing Scheme
下载PDF
导出
摘要 提出一种接入结构上的动态的多重秘密共享方案。该方案基于Shamir的秘密共享,采用拉格朗日插值方法进行秘密拆分和恢复。可以动态地添加或删除参与者及更新多重秘密,而不需要重新分发子秘密。子秘密由参与者自己保存,秘密恢复时,参与者提交的仅仅是影子信息,其他合作者可以通过公开信息验证影子信息的正确性,从而复用子秘密。 This article presents a dynamic multi-secret sharing scheme in any access structure based on Shamir's secret sharing. This scheme splits and reconstructs the secrets using the method of the Lagrange interpolation. This scheme can dynamically join or delete the participants and dynamically renew multi-secret, without re-distributing the sub-secrets. The sub-secrets are kept secretly by the participants. It is the shadows of the sub-secrets that are submitted by the participants during the reconstruction of the multi-secret. And any party can verify the correcmess of the shadows from the public information, thus the sub-secrets can be re-utilized.
出处 《计算机工程》 CAS CSCD 北大核心 2008年第9期170-171,173,共3页 Computer Engineering
基金 国家自然科学基金资助项目(60773114) 安徽省自然科学基金资助项目(070412051) 安徽高校省级重点自然科学研究项目(KJ2007A043)
关键词 多重秘密 接入结构 门限方案 动态 multi-secret access structure threshold scheme dynamic
  • 相关文献

参考文献6

  • 1Chien H Y,Jan J K,Tseng.Y M.A Practical(t,n)Multi-secret Sharing Scheme[J].IEICE Transactions on Fundamentals,2000,83(12):2762-2765.
  • 2Yang Chouchen,Chang Tingyi,Hwang Min-Shiang.A(t,n)Multi-secret Sharing Scheme[J].Applied Mathematics and Computation,2004,151(2):483-490.
  • 3Pang Liaojun,Wang Yumin.A New(t,n)Multi-secret Sharing Scheme Based on Shamir's Secret Sharing[J].Applied Mathematics and Computation,2005,167(2):840-848.
  • 4Li Huixian,Cheng Chuntian,Pang Liaojun.A New(t,n)Threshold Multi-secret Sharing Scheme[C]//Proceedings of the 25th Annual IACR Crypto'05.Berlin,Germany:Springer-Verlag,2005:421-426.
  • 5黄东平,王华勇,黄连生,戴一奇.动态门限秘密共享方案[J].清华大学学报(自然科学版),2006,46(1):102-105. 被引量:21
  • 6Stallings W.密码编码学与网络安全:原理与实践[M].2版.杨明,译.北京:电子工业出版社,2001.

二级参考文献7

  • 1Shamir A.How to share a secret[J].Communications of the ACM,1979,22(11):612-613.
  • 2Blakley G R.Safeguarding cryptographic keys[A].Proceedings of National Computer Conference[C].Montvale,NJ:AFIPS Press,1979.313-317.
  • 3Ito M,Saito A,Nishizeki T.Secret sharing scheme realizing general access structure[A].Proceedings IEEE Globecom'87[C].Tokyo,Japan:IEEE Press,1987.99-102.
  • 4Cachin C.On-line secret sharing[A].Proceedings of the 5th IMA Conference on Cryptography and Coding[C].London,UK:Springer-Verlag,1995.190-198.
  • 5Hwang Ren-Junn,Chang Chin-Chen.An on-line secret sharing scheme for multi-secrets[J].Computer Communications,1998,21(13):1170-1176.
  • 6Rivest R L,Shamir A,Adleman L.A method for obtaining digital signatures and public key cryptosystem[J].Communication of ACM,1978,21:120-126.
  • 7Aho A,Hopcroft J,Ullman J.The Design and Analysis of Computer Algorithms[M].Massachusetts,US:Addison-Wesley,1974.

共引文献22

同被引文献44

  • 1许春香,肖国镇.门限多重秘密共享方案[J].电子学报,2004,32(10):1688-1689. 被引量:41
  • 2张春生,王世普,姚绍文,张险峰.基于PKI防欺诈的门限密钥托管方案[J].计算机科学,2005,32(11):72-74. 被引量:3
  • 3申一頔,刘焕平.可选子密钥的秘密共享方案[J].哈尔滨师范大学自然科学学报,2006,22(1):54-57. 被引量:4
  • 4李文敏,张建中.基于离散对数的广义秘密共享方案[J].计算机工程与应用,2006,42(22):116-117. 被引量:1
  • 5Shamir A.How to Share a Secret[J].Communications of the ACM,1979,22(11):612-613.
  • 6Blakley G.Safeguarding Cryptographic Keys[C] //Proc.of AFIPS.New York,USA:AFIPS Press,1979:313-317.
  • 7Crescenzo G D.Sharing One Secret vs.Sharing Many Secrets[J].Theoretilal Computer Science,2003,295(1):123-140.
  • 8Chor 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.
  • 9Wu T C, Wu T S. Cheating Detection and Cheater identification in Secret Sharing Schemes[J]. IEEE Computer Digit Technology, 1995, 142(5): 367-369.
  • 10Ham L. Efficient Sharing(Broadcasting) of Multiple Secret[J]. IEEE Computer Digit Technology, 1995, 142(3): 237-240.

引证文献6

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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