期刊文献+

一种可验证和高效的多秘密共享门限方案 被引量:3

Verifiable and Efficient Multi-secret Sharing Threshold Scheme
下载PDF
导出
摘要 已公开的门限多秘密共享方案大都是利用RSA,ECC等公钥体制来提高安全性,其占用的资源较多,速度慢。提出了一种新的多秘密共享(t,n)门限方案,该方案是在shamir秘密共享方案的基础上,利用拉格朗日插值多项式方法进行秘密分割和重构,利用NTUR算法和单向散列函数进行数据合法性验证。方案设计简单、计算量小、存储量少,能有效检测出各种欺骗、伪造行为,以确保恢复的秘密是安全和可信的。 In most of the multi-secret sharing schemes already published,RSA,ECC or other public key cryptosystems are used to improve security.But such schemes would take up lots of resources and result in low speed.We proposed a new multi-secret sharing(t,n) threshold scheme based on shamir secret-sharing scheme,using the Lagrange interpolating polynomial to split and reconstruct the secrets and the NTRU and one-way hashing function to verify the validity of data.The scheme is simple in design and requires limited calculation and limited storage space.It can detect effectively a variety of cheating or forgery behaviors and guarantee that the reconstruction of the secret is the secure and trustworthy.
出处 《计算机科学》 CSCD 北大核心 2011年第1期100-103,共4页 Computer Science
基金 国家自然科学基金项目(60973139)资助
关键词 多秘密共享 NTUR算法 门限方案 可验证 Multi-secret sharing NTRU algorithm Threshold scheme Verifiable
  • 相关文献

参考文献15

二级参考文献60

共引文献48

同被引文献28

  • 1张文芳,何大可,缪祥华,王小敏.基于NTRU公钥密码体制的无线局域网安全方案[J].计算机应用研究,2006,23(1):111-113. 被引量:4
  • 2张文芳,余位驰,何大可,王小敏.一种基于格理论的数字签名方案[J].计算机科学,2006,33(3):93-96. 被引量:4
  • 3Shamir A. How to Share a Secret [ J ]. Communications of the ACM 1979,22(11) :612-613.
  • 4Blakley G R. Safeguarding Cryptographic Keys [ C ]// Proceedings of National Computer Conference. New York,USA: [ s. n. ] ,1979:313-317.
  • 5Chor 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.
  • 6Stadler M. Publicly Verifiable Secret Sharing [ C ]// Proceedings of Cryptology-Eurocryptp ' 96. Berlin, Germany : Springer-Verlag, 1996 : 191 -199.
  • 7Kaya 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.
  • 8Tian Youliang, Peng Changgen, Ma Jianfeng. Publicly Verifiable Secret Sharing Schemes Using Bilinear Pairings [J]. International Journal of Network Security,2012,14 ( 3 ) : 142-148.
  • 9Li Fei,Gao Wei,Wang Yi-lei. An Efficient Certificateless Threshold Decryption Schemes Based on Pairings [J]. Journal of Computers ,2012,7 ( 12 ) :2987-2996.
  • 10田有亮,彭长根.基于双线性对的可验证秘密共享方案[J].计算机应用,2007,27(B12):125-127. 被引量:5

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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