高效的强(n,t,n)可验证秘密共享方案

计算机科学 ›› 2013, Vol. 40 ›› Issue (9): 130-132.

高效的强(n,t,n)可验证秘密共享方案

吴春英,李顺东

陕西师范大学计算机科学学院西安710062;陕西师范大学计算机科学学院西安710062

出版日期:2018-11-16 发布日期:2018-11-16
基金资助:
本文受国家自然科学基金(61070189,61272435)资助

Efficient Strong (n,t,n) Verifiable Secret Sharing Scheme

WU Chun-ying and LI Shun-dong

Online:2018-11-16 Published:2018-11-16

摘要/Abstract

摘要： 年,Harn和Lin提出了强t-一致的概念,并设计了一个强(n,t,n)可验证的秘密共享方案,但该方案的效率较低。提出一个基于范德蒙行列式性质的高效的强(n,t,n)可验证的秘密共享方案,该方案可以抵抗并检验出Harn方案中出现的欺诈行为。同时,新方案无须选取Harn方案中的kn个子多项式,在保证秘密份额满足强t-一致定义的前提下具有较低的计算复杂度。

关键词: 秘密共享,范德蒙行列式,强t-一致,可验证秘密共享方案中图法分类号TP309文献标识码A

Abstract: In 2010,Harn and Lin proposed the conception of strong t-consistency and designed a strong (n,t,n) verifiable secret sharing scheme,but the scheme has a low efficiency．This paper proposed an efficient strong (n,t,n) verifiable secret sharing scheme．Based on the property of Vandermonde determinant,the scheme can resist and verify the fraud proposed in Harn scheme．Meanwhile,our scheme doesn’t need to select the kn sub-polynomials．The new scheme with strong t-consistency has the advantage of a low computational complexity.

Key words: Secret sharing,Vandermonde determinant,Strong t-sonsistency,Verifiable secret sharing scheme

吴春英,李顺东. 高效的强(n,t,n)可验证秘密共享方案[J]. 计算机科学, 2013, 40(9): 130-132. https://doi.org/

WU Chun-ying and LI Shun-dong. Efficient Strong (n,t,n) Verifiable Secret Sharing Scheme[J]. Computer Science, 2013, 40(9): 130-132. https://doi.org/

参考文献

[1] Shamir A．How to share a secret[J]．Communications of theACM,1979,22(11):612-613
[2] Yang Chou-chen,Chang Ting-yi,Hwang Min-Shiang．A(t,n)multi-secret sharing scheme[J]．Applied Mathematics and Computation,2004,151(2):483-490
[3] Qin Hua-wang,Dai Yue-wei,Wang Zhi-quan．A secret sharing based on (t,n) threshold and adversary structure [J]．Int．J．Inf．Secur．,2009(8):379-385
[4] Shao Jun,Cao Zhen-fu．A new efficient (t,n) verifiable multi-secret sharing(VMSS)based on YCH scheme[J]．Applied Mathematics and Computation,2005,168(1):135-140
[5] Pedersen P．A threshold cryptosystem without a trusted party[C]∥Advances in Cryptology,Proceedings of the Eurocrypt’91．Brighton,UK,LNCS,vol．547, Berlin:Springer-Verlag,1991:522-526
[6] Harn L,Lin Chang-lu．Strong (n,t,n) verifiable secret sharing scheme[J]．Information Sciences,2010(180):3059-3064
[7] Chang T Y,Hwang M S,Yang W P．An improvement on the Lin-Wu (t,n) threshold verifiable multi-secret sharing scheme[J]．Applied Mathematics and Computation,2005,163(1):169-178
[8] Stinson D R．密码学原理与实践(第二版)[M]．冯登国,译．北京:电子工业出版社,2003:138-139
[9] 刘木兰,张志芳．秘密共享体制和安全多方计算[M]．北京:电子工业出版社,2008

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed