期刊文献+

一个基于椭圆曲线的多重秘密共享体制 被引量:4

A Muti-secret Sharing Scheme Based on Elliptic Curve
在线阅读 下载PDF
导出
摘要 利用椭圆曲线提出了一种基于一般访问结构的多重秘密共享体制,可以有效阻止敌方窃取秘密或子秘密,防止内部成员之间的互相欺诈。方案中参与者的子秘钥是由各参与者选择,秘密分发者不需向各参与者传送任何秘密信息。当秘密更新、访问结构改变或参与者加入/退出系统时,成员的子秘钥无需改变。该文对体制的安全性和效率进行了分析,并与以往的方案进行了比较。 Based on elliptic curve, a new secret sharing scheme for general access structure is proposed. It is able to prevent adversaries from getting the secret and efficiently guard against cheating among participants. Each participant's secret is selected by participant himself and the dealer need not deliver any secret information to each participant. The secret do not need to be changed when the shared secret is renewed, the access structure is altered, or participants added/deleted. This paper analyzes the security and efficiency of this scheme, and compares it with the scheme.
作者 康斌 余昭平
出处 《计算机工程》 CAS CSCD 北大核心 2007年第13期176-178,共3页 Computer Engineering
基金 现代通信国家重点实验室基金资助项目(51436020405JB5205) 国家自然科学基金资助项目(60503012)
关键词 秘密共享 椭圆曲线 访问结构 欺诈 secret sharing elliptic curve access structure cheat
作者简介 康斌(1983-),男,硕士研究生,主研方向:协议分析,密码理论;E-mail:kb5702@tom.com. 余昭平,教授.
  • 相关文献

参考文献8

二级参考文献19

  • 1Tan K J,Computer Communications,1999年,22卷,755页
  • 2王育民,通信网的安全.理论与技术,1999年,215页
  • 3A Shamir.How to share a secret[J].Communications of the ACM,1979,22(11):612-613.
  • 4H.-Y.Lin,Harn L.A generalized secret sharing scheme with cheater detection[A].Advances in Cryptology-ASIACRYPT'91 Proceedings[C],Berlin:Springer-Verlag,1993.149-158.
  • 5M Carpentieri.A perfect threshold secret sharing scheme to identify cheaters[J].Designs,Codes and Cryptography,1995,5(3):183-197.
  • 6J Rifa-Coma.How to avoid the cheaters succeeding in the key sharing scheme[J].Designs,Codes and cryptography,1993,3(3):221-228.
  • 7E F Brickell,D R Stinson.The detection of cheaters in threshold scheme[A].Advances in Cryptology-CRYPTO'88[C],Berlin:Springer-Verlag,1988.564-577.
  • 8L Harn,H Lin.An l-span generalized secret sharing scheme[A].Advances in Cryptology-CRYPTO'92[C].Berlin:Springer-Verlag,1992.558-565.
  • 9L Harn.Efficient sharing (Broadcasting) of multiple secrets,IEE Proc.-Comput.Digit.Tech.1995,142(3):237-240.
  • 10L Chen,D Gollmann,C J Mitchell,P Wild.Secret sharing with reusable polynomials[A].The Second Australasian Conference on Information Security and Privacy-ACISP'97[C].Berlin:Springer-Verlag,1997.183-192.

共引文献69

同被引文献26

引证文献4

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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