期刊文献+

基于RSA密码体制(t,n)门限秘密共享方案 被引量:32

(t, n) threshold secret sharing scheme based on RSA cryptosystem
下载PDF
导出
摘要 基于RSA密码体制,提出了一个新的(t,n)门限秘密共享方案。在该方案中,秘密份额由各参与者自己选择,秘密分发者不知道每个参与者所持有的份额,而且秘密份额长度与秘密长度相同。在秘密恢复过程中,每个参与者能够验证其他参与者是否进行了欺骗。每个参与者只需维护一个秘密份额,就可以实现对多个秘密的共享。方案的安全性是基于RSA密码体制和Shamir的(t,n)门限秘密共享方案的安全性。 A new (t, n) threshold secret sharing scheme was proposed, which was based on RSA cryptosystem. In this scheme, each participant’s secret shadow was selected by the participant himself and even the secret dealer did not know anything about his secret shadow. All these shadows were as short as the secret to be shared. In the recovery phase, each participant was allowed to check whether another participant provided the true information or not. Each participant can share many secrets with other participants by holding only one shadow. The security of this scheme is the same as that of the RSA cryptosystem and Shamir’s (t, n) threshold secret sharing scheme.
出处 《通信学报》 EI CSCD 北大核心 2005年第6期70-73,共4页 Journal on Communications
基金 国家"973"重大基金资助项目(G19990358-05) 国家自然科学基金资助项目(60473027)
关键词 RSA密码体制 秘密共享方案 门限 秘密份额 参与者 恢复过程 安全性 长度 security secret sharing threshold scheme RSA
  • 相关文献

参考文献11

  • 1SHAMIR A. How to share a secret[J]. Communications of the ACM,1979, 22(11): 612-613.
  • 2BLAKLEY G. Safeguarding cryptographic keys[A]. Proc AFIPS 1979 National Computer Conference[C]. New York: AFIPS Press, 1979.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 system[J]. IEEE Transactions on Information Theory, 1983, 29(1): 35-41.
  • 5许春香,陈恺,肖国镇.安全的矢量空间秘密共享方案[J].电子学报,2002,30(5):715-718. 被引量:23
  • 6HARN L. Efficient sharing (broadcasting) of multiple secrets[J]. IEE Proceedings-Computers and Digital Techniques, 1995, 142(3): 237-240.
  • 7CHIEN 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.
  • 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.
  • 9HWANG R J, CHANG C C. An on-line secret sharing scheme for multi-secrets[J]. Computer Communications, 1998, 21(13): 1170-1176.
  • 10RIVEST R L, SHAMIR A, ADLEMAN L. A method for obtaining digital signatures and public key cryptosystem [J]. Communications of the ACM, 1978, 21(2): 120-126.

二级参考文献1

共引文献22

同被引文献211

引证文献32

二级引证文献137

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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