期刊文献+

基于ECC的门限秘密共享方案及其安全性 被引量:4

Threshold secret sharing scheme based on ECC and its security
在线阅读 下载PDF
导出
摘要 基于椭圆曲线密码体制,提出一个新的(t,n)门限秘密共享方案.该方案使用各参与者的私钥作为他们的秘密份额,秘密分发者不需要进行秘密份额的分配.在秘密分发过程中,秘密分发者只需计算一些公开信息,而无需向各参与者传递任何信息.在秘密重构过程中,每个合作的参与者只需向秘密计算者提交一个由秘密份额计算的、可验证的伪份额.由于无需可信中心管理参与者密钥,且在秘密分发阶段无需任何秘密通信,因此,该方案具有良好的安全性和执行效率. Based on elliptic curve cryptography, a novel (t, n) threshold secret sharing scheme is proposed. Each participant's private-key is used as his secret shadow and the secret dealer does not have to distribute each participant's secret shadow. In the secret distribution phase, the dealer only needs to compute some public values without sending any information to each participant. And in the secret recovery phase, each cooperative participant only needs to submit a verifiable pseudo-shadow instead of his secret shadow. The trusted center to manage participants' keys is eliminated and no secret communication is required in the secret distribution phase, so the scheme is characterized by excellent security as well as high efficiency.
出处 《西安电子科技大学学报》 EI CAS CSCD 北大核心 2006年第4期572-575,共4页 Journal of Xidian University
基金 973国家重大项目资助(G1999035805) "十五"国家部委预研资助项目(Y1010122)
关键词 椭圆曲线密码体制 秘密共享 门限方案 elliptic curve cryptography secret sharing threshold scheme
  • 相关文献

参考文献2

二级参考文献13

  • 1Schneier B 吴世忠(译).应用密码学[M].北京:机械工业出版社,2000..
  • 2Shamir A. How to share a secret [J]. Communications of the ACM,1999, 22(11), 612-613.
  • 3Blakley G. Safeguarding cryptographic keys [A]. Proc AFIPS 1979 National Computer Conference [C]. New York: AFIPS Press,1979. 313-317.
  • 4Asmuth C, Bloom J. A modular approach to key safeguarding [J]. IEEE Transactions on Information Theory, 1983, 29(2):208-210.
  • 5Karnin E D, Green J W, Hellman M E. On sharing secret system [J]. IEEE Transactions on Information Theory, 1983, 29(1):35-41.
  • 6Wu T C, He W H. A geometric approach for sharing secrets [J]. Computers and Security, 1995,14(2): 135-145.
  • 7Yang 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.
  • 8Crescenzo G D. Sharing one secret vs. sharing many secrets [J]. Theoretical Computer Science, 2003,295(1-3): 123-140.
  • 9He J, Dawson E. Multistage secret sharing based on one-way function[J]. Electronics Letters, 1994, 30 (19):1 591-1 592.
  • 10Wiedemann D H. Solving sparse linear equations over finite fields [J]. IEEE Transactions on Information Theory, 1981, 32(1):54-62.

共引文献23

同被引文献28

引证文献4

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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