期刊文献+

基于Newton插值的具有前向安全性的可验证多秘密共享方案

A Verifiable Multi-secret Sharing Scheme with Forward Security Based on Newton Interpolation
下载PDF
导出
摘要 基于Newton插值,提出一个新的可验证的具有前向安全性的(t,n)门限秘密共享方案。方案中,利用Newton插值法构造多项式进行秘密的分发和恢复秘密;利用椭圆曲线上的双线性对理论,验证分发者的诚实性和分发过程的有效性;方案具有前向安全性,假设敌手窃取前一时间段的秘密也无法获取任何有效信息,有效地降低了秘密泄露带来的风险。 Based on Newton interpolation,a new verifiable(t,n)threshold secret sharing scheme with forward security is proposed.In the scheme,Newton interpolation method is used to construct polynomial for secret distribution and recovery.The scheme uses the bilinear pair theory on the elliptic curve to verify the honesty of the distributor and the effectiveness of the distribution process.It has forward security,and the adversary cannot get any effective information even if he steals the previous period of secret,which effectively reduces the risk of secret leakage.
作者 刘勇 杜伟章 LIU Yong;DU Weizhang(School of Computer and Communication Engineering,Changsha University of Science and Technology,Changsha 410114,China)
机构地区 长沙理工大学
出处 《微型电脑应用》 2023年第3期139-141,共3页 Microcomputer Applications
关键词 多秘密共享 Newton插值 双线性对 前向安全性 multi-secret sharing Newton interpolation bilinear pairing forward security
  • 相关文献

参考文献5

二级参考文献40

  • 1朱莹,蔡光兴.一种基于RSA群签名方案的安全性分析及改进[J].湖北工业大学学报,2009,24(1):68-70. 被引量:5
  • 2李凤银,禹继国,鞠宏伟.一种基于RSA的群签名方案[J].计算机工程与设计,2006,27(16):2955-2957. 被引量:11
  • 3王彩芬,刘军龙,贾爱库,于成尊.具有前向安全性质的秘密共享方案[J].电子与信息学报,2006,28(9):1714-1716. 被引量:4
  • 4Shamir A. How to Share a Secret [ J ]. Communications of the ACM 1979,22(11) :612-613.
  • 5Blakley G R. Safeguarding Cryptographic Keys [ C ]// Proceedings of National Computer Conference. New York,USA: [ s. n. ] ,1979:313-317.
  • 6Chor B ,Goldwasser S, Micali S, et al. Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults [ C]//Proceedings of the 26th IEEE Symposium on Foundations of Computer Science.[ S. 1. ] : IEEE Press, 1985:383-395.
  • 7Stadler M. Publicly Verifiable Secret Sharing [ C ]// Proceedings of Cryptology-Eurocryptp ' 96. Berlin, Germany : Springer-Verlag, 1996 : 191 -199.
  • 8Kaya K,Selcuk A. A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem [ C]// Proceedings of INDOCRYPT' 08. Berlin, Germany: Springer-Verlag, 2008:414-425.
  • 9Tian Youliang, Peng Changgen, Ma Jianfeng. Publicly Verifiable Secret Sharing Schemes Using Bilinear Pairings [J]. International Journal of Network Security,2012,14 ( 3 ) : 142-148.
  • 10Li Fei,Gao Wei,Wang Yi-lei. An Efficient Certificateless Threshold Decryption Schemes Based on Pairings [J]. Journal of Computers ,2012,7 ( 12 ) :2987-2996.

共引文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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