期刊文献+

一种简单的可验证秘密共享方案 被引量:7

Simple verifiable secret sharing scheme
下载PDF
导出
摘要 分析了两种有效的可验证秘密共享方案:Feldman s VSS方案和Pedersen s VSS方案。但是它们都是门限方案,当推广到一般接入结构时,效率都很低。为此,提出了一个一般接入结构上的可验证秘密共享方案。参与者的共享由秘密分发者随机生成,采用秘密信道发送。每个授权子集拥有一个的公开信息,通过公开的信息,参与者能够验证属于自己份额的共享的有效性。该方案具有两种形式:一种是计算安全的,另一种是无条件安全的。其安全性分别等同于Feldman sVSS方案和Pedersen sVSS方案,但在相同的安全级别下,新方案更有效。 Two effective Verifiable Secret Sharing (VSS) schemes including the Feldman's VSS scheme and the Pedersen's VSS scheme were analyzed. But as they are the threshold schemes, it is inefficient for them to be applied to the general access structure. Then, a new VSS scheme for the general access structure was proposed. The dealer created the shares randomly, and sent them to the participants by secret channel. Each authorized subset of the access structure had a public message, through which the validity of the shares could be verified respectively. This scheme has two types: one is computationally secure and the other is unconditionally secure. Their security is equal to that of the Feldman's scheme and the Pedemen's scheme respectively. But, it is more efficient to implement the new scheme on the same level of security.
出处 《计算机应用》 CSCD 北大核心 2006年第8期1821-1823,共3页 journal of Computer Applications
基金 国家自然科学基金资助项目(60573171) 安徽省青年教师科研资助项目(2005JQ1036)
关键词 秘密共享 门限方案 接入结构 公钥密码 secret sharing threshold schemes access structure public cryptography
  • 相关文献

参考文献10

  • 1BLAKLEY GR.Safeguarding cryptographic keys[A].Proceedings of the 1979 AFIPS National Computer Conference[C].AFIPS Press,1979,Vol 48:313 -317.
  • 2SHAMIR A.How to share a secret[J].Communications of the ACM,1979,22(1):612 -613.
  • 3ITO M,SAITO A,NISHIZCKI T.Secret sharing scheme realizing general access structure[A].Proceedings of IEEE Global Telecommunication Conference Globecom[C].1987,Vol 87:99-102.
  • 4BENALOH JC,LEICHTER J.Generalized secret sharing and monotone functions[A].Advances in Cryptology-CRYPTO'88[C].1990,LNCS 403:27 -35.
  • 5CHOR B,GOLDWASSER S,MICALI S,et al.Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults[A].Proceedings of IEEE FOCS'85[C].1985.383-395.
  • 6GOLDREICH O,MICALI S,WIGDERSON A.How to play any mental game[A].Proceeding of the Nineteenth annual ACM Symp[C].Theory of Computing,1987.218-229.
  • 7BEN-OR M,GOLDWASSER S,WIGDERSON A.Completeness theorems for non-cryptographic fault-tolerant distributed computation[A].ACM STOC[C].1988.1 -10.
  • 8RABIN T,BEN-OR M.Verifiable Secret Sharing and Multiparty Protocols with Honest Majority[A].ACM STOC[C].1989.73-85.
  • 9FELDMAN P.A Practical Scheme for Non-interactive Verifiable Secret Sharing[A].Proceedings of the 28 IEEE Symposium on Foundation of Computer Science(FOCS)[C].IEEE,1987.427-437.
  • 10PEDERSEN TP.Non-interactive and information-theoretic secure verifiable secret sharing[A].Advances in Cryptology-CRYPTO'91[C].Berlin:Springer,1991.129-140.

同被引文献47

引证文献7

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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