期刊文献+

一种基于椭圆曲线自双线性映射的多秘密共享方案 被引量:3

A Multi-secret Sharing Scheme Based on Self-bilinear Pairing Algorithm Elliptic Curves
下载PDF
导出
摘要 分析了Duo Liu等人提出的基于椭圆曲线自双线性映射的多秘密共享方案,发现该方案易遭受分发者/参与者欺诈攻击和广播窃听攻击,并依赖安全信道;提出了一种基于单向散列函数、密钥协商协议和动态多方Deffie-Hellman协议的改进方案,改进方案能抵抗分发者/参与者欺诈攻击和广播窃听攻击,并使方案摆脱对安全信道的依赖.最后对改进方案的安全性进行了分析. Duolius multi-secret sharing scheme based on self-bilinear pairing over elliptic curves is analyzed. Duolius Scheme is found vulnerable to dealer/participant fraud attack, broadcast wiretap attack, and dependent on secure communi- cation channel. An improved scheme based on hash function, key agreement protocol, and dynamic multi-party Defile-Hell- man protocol is proposed to eliminate the above deficiencies. Security performance is discussed in the end.
作者 张尚韬
出处 《海南师范大学学报(自然科学版)》 CAS 2016年第1期36-39,共4页 Journal of Hainan Normal University(Natural Science)
关键词 椭圆曲线 自双线性映射 多秘密共享 欺诈攻击 广播窃听攻击 Elliptic curve self-bilinear pairing multi-secret sharing fraud attack broadcast wiretap attack
  • 相关文献

参考文献6

  • 1Shamir A. How to share a secret[ J ]. Communications of the ACM,1979,24(11):612-613.
  • 2Chien H Y, Tseng J K. A practical (t,n) multi-secret sharing scheme[ J ]. IEICE Transactions on Fundamentals of Elec- tronics, Communications and Computer,2000,83-A(12): 2762-2765.
  • 3He J, Dawson E. Multistage secret sharing based on one-way function[ J ]. Electronics Letters,1994,30(19):1591- 1592.
  • 4Chor B, Goldwasser S, Micali S, et al. Verifiable Secret Shar- ing and Achieving Simultaneity in the Presence of Faults[C]. In: Proc. 26th IEEE Symposium on Foundations of Comput- er Sciences(FOCS'85). Los Angeles: IEEE Computer Society, 1985:583-395.
  • 5Lee H S. A self-pairing map and its applications to cryptogra- phy[ J ]. Applied Mathematics and Computation,2004,151: 671-678.
  • 6Liu D, Huang D, Luo P, et al. New schemes for sharing points on an elliptic curve[ J ]. Computers and Mathematics with Applications,2008,56:1556-1561.

同被引文献16

引证文献3

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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