期刊文献+

一个改进的可验证的多秘密共享方案 被引量:5

Improved verifiable multi-secret sharing scheme
下载PDF
导出
摘要 基于ZZZ(Zhao Jianjie,Zhang Jianzhong,Zhao Rong),提出了一个改进的可验证的多秘密共享方案,其安全性基于RSA密码体制的安全性和离散对数问题的难处理。新方案不仅具有原方案的全部优点,如系统不需要安全信道,可有效识别参与者的欺诈等,而且可以防止分发者的欺诈行为。在秘密分发阶段,只用了一个Lagrange插值多项式,降低了构建秘密的复杂度。 This paper presents an improved verifiable multi-secret sharing scheme based on ZZZ(Zhao Jianjie,Zhang Jianzhong,Zhao Rong),its security relies on RSA cryptosystem and the intractability of the discrete logarithm.It not only has all merits about ZZZ,such as the system does not need a secure channel and can identify the cheating of the participants etc,but also can prevent the dealer from cheating.The secret distribution only uses one Lagrange interpolation polynomial in the scheme,which lowers the complexity of constructing secret.
出处 《计算机工程与应用》 CSCD 2012年第14期94-97,共4页 Computer Engineering and Applications
基金 国家自然科学基金(No.61173190) 陕西省自然科学基金(No.2009JM8002) 陕西省教育厅科学研究计划(自然科学项目(No.2010JK829 No.2010JK398)) 中央高校基本科研业务费专项资金资助(No.GK201002041)
关键词 密码学 可验证多秘密共享 RSA 欺诈 cryptosystem verifiable multi-secret sharing RSA cheating
  • 相关文献

参考文献12

  • 1Shamir A.How to share a secret[J].Communication of the ACM, 1979,22( 11 ) :612-613.
  • 2Blakley G R.Safeguarding cryptographic keys[C]//Proc of AFIPS 1979,National Computer Conference.New York, USA:AFIPS Press, 1979,48:313-317.
  • 3Chien H Y,Jan J K,Tseng Y M.A practical (t, n)multi- secret sharing scheme[J].IEICE Transactions on Funda- mentals, 2000, E83-A(12) : 2762-2765.
  • 4Yang C C, Chang T Y, Hwang M S.A (t, n) multi-secret sharing scheme[J].Applied Mathematics and Computa- tion,2004, 151 (2) :483-490.
  • 5Zhao J J,Zhang J Z,Zhao R.A practical verifiable multi- secret sharing scheme[J].Computer Standards & Interfaces, 2007,29(1) : 138-141.
  • 6Ham L.Efficient sharing(broadcasting)of multiply secret[J]. Computers and Digital Techniques, 1995,142 (3) : 237-240.
  • 7庞辽军,王育民.基于RSA密码体制(t,n)门限秘密共享方案[J].通信学报,2005,26(6):70-73. 被引量:32
  • 8Shao J, Cao Z F.A new efficient (t, n)Verifiable Multi- Secret Sharing(VMSS) based on YCH scheme[J].Applied Mathematics and Computation, 2005,168(1 ) : 135-140.
  • 9王家玲,朱艳琴,罗喜召.对一种VMSS方案的分析与改进[J].计算机应用与软件,2010,27(7):8-10. 被引量:5
  • 10Rosen K H.Elementary number theory and its applica- tions [M].England: Addison-Wesley, 1993.

二级参考文献22

  • 1Shamir A.How to Share a Secret[J].Communications of the ACM,1979,22(11):612-613.
  • 2Blakley G.Safeguarding Cryptographic Keys[C]//Proceedings of the National Computer Conference,Montvale:NCC,1979:242-268.
  • 3Chor B,Goldwasser S.Verifiable secret sharing and achieving simultaneity in the presence of faults[C]//Proceedings of 26thIEEE symposium on Foundations of computer science.Portland:IEEE,1985:383-395.
  • 4Feldman P.A practical scheme for non-interactive verifiable secret sharing[C]//Proceeding of 28thIEEE ymposium on Foundations of computer science.Canada:IEEE,1987:427-437.
  • 5Stadler.Public verifiable secret sharing[C]//Advances in cryptology EUROCRYPT'96.Spring-Verlag,Berlin:EUROCRYPT,1996:190-199.
  • 6Yang C C,Chang T Y,Hwang M S.A(t,n) multi-secret sharing scheme.Applied Mathematics and Computation 151(2004):483-490.
  • 7Harn L.Efficient sharing(broadcasting) of multiple secret.Computers and Digital Techniques,1995,142(3):237-240.
  • 8Chen L,Gollman D,Mitchell C J,et al,Secret sharing with reusable polynomials[C]//Proceedings of the Second Australisian Conference on Information Security and Privacy-ACISP'97.ACISP,Australia,1997.
  • 9Shao J,Cao Z F.A new efficient(t,n) verificable multi-secret sharing(VMSS) based on YCH scheme.Applied Mathematics and Computation 2005,168:135-140.
  • 10Jianjie Zhao,Jianzhong Zhang,Rong Zhao.A practical verifiable multi secret sharing scheme[J].Computer standards and Interfaces,2007,29:138-141.

共引文献35

同被引文献36

引证文献5

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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