期刊文献+

线性码上的可验证多秘密共享方案 被引量:1

Verifiable Multi-secret Sharing Scheme on Linear Codes
下载PDF
导出
摘要 基于Massy的秘密共享体制和RSA密码体制,提出一个可验证的多秘密共享方案。在秘密共享阶段,参与者的份额由各个参与者自己选取,且其子秘密的传送可以通过公开的信道发送给秘密分发者。在秘密恢复阶段,可以验证参与者是否进行欺骗。该方案可以动态地更新秘密,无需更改参与者的秘密份额,只需更改公告牌上的部分相应信息。与以往的(t,n)门限秘密共享方案相比,该方案具有更丰富的授权子集。 This paper proposes a verifiable multi-secret sharing scheme based on the Massy secret sharing scheme and RSA encryption algorithm.In the sharing phase,the shares of each participant are chosen by himself or herself and sub-secret is transmitted to the secret dealer by using public channel.In the recovering phase,designated combiner is allowed to check whether each participant provides the true value.Multi-secrets are dynamically renewed without re-distributing the participant’s shares,the dealer only renew the values related to the renewed secrets in a public board.Compared with the former dynamic secret sharing schemes,this scheme has more interesting access structure.
出处 《计算机工程》 CAS CSCD 北大核心 2011年第21期89-90,共2页 Computer Engineering
基金 国家自然科学基金资助项目(10571112) 中央高校基本科研业务费专项基金资助项目(10871123)
关键词 线性码 RSA密码体制 多秘密共享体制 对偶码 极小码字 linear code RSA encryption system multi-secret sharing system dual code minimal codeword
  • 相关文献

参考文献9

  • 1Shamir A. How to Share a Secret[J]. Communications of the Association for Computing Machinery, 1979, 22(3): 612-613.
  • 2Blakley G R. Safeguarding Cryptographic Keys[C]//Proc. of National Computer Conference. [S. 1.]: IEEE Computer Society, 1979: 313-317.
  • 3Mceliece R J, Sarwate D V. On Sharing Secrets and Reed Solomon Codes[J]. Communications of the Association for Computing Machinery, 1981, 24(9): 583-584.
  • 4Massey J L. Minimal Code Words and Secret Sharing[C]//Proc. of the 6th Joint Swedish-Russian Workshop on Information Theory. Veldhoven, The Netherlands: [s. n.], 1993: 276-279.
  • 5Massey J L. Some Applications of Coding Theory in Crypto- graphy[EB/OL]. (1995-10-21). http://doc.utwente.nl/66717/2/ phdthesis.pdf.
  • 6Brickell E E Ideal Secret Sharing Schemes[C]//Proc. of Advances in Cryptology-Eurocrypt'89. IS. 1.]: Springer, 1990: 468-475.
  • 7Yuan Jin, Ding Cunsheng. Secret Sharing Schemes from Three Classes of Linear Codes[J]. IEEE Transactions on Information Theory, 2006, 52(1): 206-212.
  • 8谭晓青.基于线性码的可验证秘密分享方案[J].信息安全与通信保密,2007(5):27-29. 被引量:2
  • 9柳烨,李志慧,郭瑞.一种动态的多秘密共享方案[J].计算机工程,2009,35(23):120-121. 被引量:4

二级参考文献13

  • 1Chien H Y, Jan J K, Tseng Y M. A Practical (t, n) Multi-secret Sharing Scheme[J]. IEICE Transaction on Fundamentals, 2000, 83(12): 2762-2765.
  • 2Cachin C. On-line Secret Sharing[C]//Proc. of the 5th IMA Conf. on Cryptography and Coding. Berlin, Germany: Springer-Verlag, 1994.
  • 3Pinch R. On-line Multiple Secret Sharing[J]. Electronics Letters, 1996, 32(12): 1087-1088.
  • 4Hwang R J, Chang Chin-Chen. An On-line Secret Sharing Scheme for Multi-secrets[J]. Computer Communication, 1998, 21(13): 1170-1176.
  • 5[1]Shamir A.How to share a secret.Communications of the ACM,1979,22:612~613.
  • 6[2]Blakley G R.Safeguarding cryptographic keys.In:Proceedings of the National Computer Conference.New York:AFIPS Press,1979,48:242~268.
  • 7[3]Karnin E D,Green J W,Hellman M E.On Secret Sharing Systems.IEEE Transaction Information Theory,Sept.1983:644~654.
  • 8[4]Massey J L.Minimal Codewords and Secret Sharing.In:Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory,Sweden:Lund,1993:276~279.
  • 9[5]Massey J L.Some applications of coding theory in cryptography.In Cryptography and Coding IV,Oxford University Press,1995:33~47.
  • 10[6]Martin Tompa.Heather woll.How to share a secret with cheaters.J.Cryptology,1988,1(2):133~138.

共引文献4

同被引文献16

  • 1庞辽军,姜正涛,王育民.基于一般访问结构的多重秘密共享方案[J].计算机研究与发展,2006,43(1):33-38. 被引量:22
  • 2黄东平,王华勇,黄连生,戴一奇.动态门限秘密共享方案[J].清华大学学报(自然科学版),2006,46(1):102-105. 被引量:21
  • 3石润华,黄刘生.一种简单的可验证秘密共享方案[J].计算机应用,2006,26(8):1821-1823. 被引量:7
  • 4Shamir A.How to share a secret[J].Communications of the ACM,1979,22(11):612-613.
  • 5Blakley G R.Safeguarding cryptographic keys[C]//Proceedings of AFIPS 1979 National Computer Conference,1979:313-317.
  • 6Chor B,Goldwasser S,Micali S,et al.Verifiable secret sharing and achieving simultaneity in the presence of faults[C]//Proceedings of 26th IEEE Symposium on Foundations of Computer Science,1985:251-260.
  • 7Stadler M.Publicly verifiable secret sharing[C]//LNCS1070:Advances in Cryptology-EUROCRYPT’96.Berlin:Springer-Verlag,1996:190-199.
  • 8Yang C C,Chang T Y,Hwang M S.A(t,n)multi-secret sharing scheme[J].Applied Mathematics and Computation,2004,151(2):483-490.
  • 9Shao J,Cao Z F.A new efficient Verifiable Multi-Secret Sharing(VMSS)based on YCH scheme[J].Applied Mathematics and Computation,2005,168:135-140.
  • 10王天成,张建中.一个动态门限多重秘密共享方案[J].计算机工程与应用,2009,45(33):75-76. 被引量:5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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