期刊文献+

对一种VMSS方案的分析与改进 被引量:5

ANALYSIS AND IMPROVEMENT ON A VERIFIABLE MULTI-SECRET SHARING SCHEME
下载PDF
导出
摘要 多秘密共享方案是指一次可共享多个秘密的秘密共享方案。Massoud Hadian Dehkordi和Samaneh Mashhadi提出了一个有效的可验证多秘密共享方案(DM-VMSS)。该方案无需安全通道,且各参与者自己选择各自的秘密份额,故无需验证秘密分发者的诚实性。对DM-VMSS方案进行了安全性分析,首先指出该方案的一个安全缺陷,即:秘密分发者虽无法通过伪造各参与者的秘密份额进行欺骗,但可通过公开无效的函数值使得参与者恢复无效的秘密,而对秘密分发者的这种行为参与者无法察觉。然后对原方案进行改进,在验证阶段加入可检验出秘密分发者的欺骗行为的验证方程,以避免上述安全缺陷和攻击。 Multi-secret sharing scheme is a secret sharing scheme in which several secrets can be shared during one secret sharing process.Massoud Hadian Dehkordi and Samaneh Mashhadi proposed an efficient threshold verifiable multi-secret sharing scheme.We call it DM-VMSS.In this scheme,there is no need for a secure channel and each participant chooses her/his secret share by her/himself.So the honesty of the dealer is Absolutely free from validation.In this paper we analyze the security of DM-VMSS scheme.First,we point out a secure flaw in this scheme,that is,although the dealer couldn't become a cheater by falsifying secret shares of each participant,he can publish ineffective function value and which can lead the participants to recover an invalid secret but not be aware of such action of the dealer.Then,we provide an improvement on the scheme to avoid the secure limitation and attacks by adding a validation equation to DM-VMSS scheme in validating phase which is capable of detecting the deceived action of the dealer.
出处 《计算机应用与软件》 CSCD 2010年第7期8-10,共3页 Computer Applications and Software
基金 国家自然科学基金(60673041)
关键词 秘密共享 可验证秘密共享 多秘密共享 Secret sharing Verifiable secret sharing Multi-secret sharing
  • 相关文献

参考文献11

  • 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.

同被引文献25

  • 1庞辽军,王育民.基于RSA密码体制(t,n)门限秘密共享方案[J].通信学报,2005,26(6):70-73. 被引量:32
  • 2赵建杰,张建中.一种新的可验证的多秘密分享方案[J].计算机工程与应用,2007,43(4):131-133. 被引量:8
  • 3石润华,黄刘生.一种公开的可验证秘密共享方案[J].计算机应用研究,2007,24(3):146-148. 被引量:1
  • 4Shamir A.How to share a secret[J].Communication of the ACM, 1979,22( 11 ) :612-613.
  • 5Blakley G R.Safeguarding cryptographic keys[C]//Proc of AFIPS 1979,National Computer Conference.New York, USA:AFIPS Press, 1979,48:313-317.
  • 6Chien 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.
  • 7Yang 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.
  • 8Zhao J J,Zhang J Z,Zhao R.A practical verifiable multi- secret sharing scheme[J].Computer Standards & Interfaces, 2007,29(1) : 138-141.
  • 9Ham L.Efficient sharing(broadcasting)of multiply secret[J]. Computers and Digital Techniques, 1995,142 (3) : 237-240.
  • 10Shao 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.

引证文献5

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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