期刊文献+

基于ECC的可公开验证的非交互式密钥共享方案

A Publicly Verifiable Non-Interactive Secret Sharing Scheme Based on ECC
下载PDF
导出
摘要 提出一种基于椭圆曲线加密的非交互式零知识证明协议,并基于该证明协议提出一个可公开验证的密钥共享方案.在该方案中,密钥和密钥份额被嵌入椭圆曲线的点上,任何人均可对密钥和密钥份额进行验证,只有合法参与者集合可恢复出密钥,但无法知道密钥的具体内容;这样有效阻止了攻击者窃取密钥,也防止了数据的误发和成员之间的欺诈,更有利于密钥的复制与更新. A non- interactive zero- knowledge proof protocol based on Elliptic Curve Encryption was proposed, and based this protocol, a publicly verified secret sharing scheme was proposed too. In the scheme, secret and secret shadow were embedded onto the points of Elliptic Curve, anybody can verify them publicly, and only the legitimate participants set can recover the secret key, but knowing nothing about the secret key. This scheme can prevent adversaries from getting the secret, the dealer from distributing improper data and the participants from cheating each other efficiently. Furthermore, it is propitious for the replication and update of secret.
出处 《微电子学与计算机》 CSCD 北大核心 2008年第6期147-150,共4页 Microelectronics & Computer
基金 南京信息工程大学科研基金项目(Y619)
关键词 椭圆曲线密码 可公开验证 密钥共享 非交互式密钥共享 elliptic curve cryptography(ECC) publicly verifiable secret sharing non - interactive secret sharing
  • 相关文献

参考文献9

二级参考文献15

  • 1Tompa M, Woll H. How to share a secret with cheaters[J]. J Cryptol, 1988,(1):133-138. 被引量:1
  • 2Wu C T, Wu S T. Cheating detection and cheater identification in secret sharing schemes[J]. IEEE Proc,Comput Dig Tech, 1995,142 (5):367-369. 被引量:1
  • 3Hwang R J, Lee W B, Chang C C. A concept of designing cheater identification methods for secret sharing[J].Journal of systems and software, 2000,46(1):7-11. 被引量:1
  • 4Chang C C, Hwang R J. Efficient cheater identification method for threshold schemes[J]. IEEE Proc, Comput Digit Tech, 1997,144(1):23-27. 被引量:1
  • 5Chien H Y, Jan J K, Tseng Y M. A practical (t,n) multi-secret sharing scheme[J].IEICE Transaction Fundamentals, 2000, E83-A(12):2762-2765. 被引量:1
  • 6Sun H. On-line multiple secret sharing based on a one-way function[J] .Computer communications, 1999, 22(8):745-748. 被引量:1
  • 7Harn L. Efficient sharing (broadcasting) of multiple secrets[J].IEEE Proc, Comput Dig Tech 1998, 142(3):237-240. 被引量:1
  • 8Chen L, Gollmann D, Mitchell C J, et al. Secret sharing with reusable polynomials[C]. Berlin: ACISP'98 Springer-Verlag, 1999.183-193. 被引量:1
  • 9杨波,孙晓蓉,王育民.基于门限方案的密钥托管[J].西安电子科技大学学报,1998,25(2):239-241. 被引量:9
  • 10徐秋亮,李大兴.适用于建立密码体制的椭圆曲线的构造方法及实现[J].计算机学报,1998,21(12):1059-1065. 被引量:10

共引文献90

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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