期刊文献+

无可信中心的可公开验证多秘密共享 被引量:19

Publicly Verifiable Multi-Secret Sharing Without Trusted Centers
在线阅读 下载PDF
导出
摘要 多秘密共享是通过一次计算过程就可以实现同时对多个秘密进行共享的密码体制,在一般的多秘密共享中,都需要可信中心的参与,由可信中心进行秘密份额的分发.然而,在很多情况下,无法保证可信中心的存在,即使存在可信中心,它也很容易遭受敌手的攻击,成为系统的盲点.该文提出了一个无可信中心的可公开验证多个秘密共享方案,共享的多个随机秘密是由参与成员共同产生的,密钥份额的有效性不仅可以被份额持有者自己验证,而且可以被其他任何成员验证,这使方案具有更广的应用背景,可用于设计电子投票协议、密钥托管协议等.为了适用于无线自组网等新的网络环境,该文也讨论了无可信中心的条件下动态撤出和增加成员的问题. A multi-secret sharing scheme is a cryptographic scheme in which multiple secrets canbe simultaneously shared during one computational process.However,in a normal multi-secretsharing scheme,we need the participation of a trusted center,which completes the distribution of secret shares.Sometimes,however,we cannot guarantee the existence of a trusted center.Even if there is a trusted center,it is easily targeted for an adversary and become a blind spot of thesystem.A publicly verifiable multi-secret sharing scheme without trusted centers is proposed inthis paper.Shared multiple secrets are jointly generated by the participations.The validity of shares can be verified not only by shareholders themselves but also by any other members.Therefore,this scheme has wider application prospects,such as the designs of electronic voting protocol,key escrow protocol etc.In order to make the scheme adapt to new network circumstance such as ad hoc networks,we also discuss the problem of how to dynamically withdraw and add members without trusted centers in this scheme.
出处 《计算机学报》 EI CSCD 北大核心 2014年第5期1030-1038,共9页 Chinese Journal of Computers
基金 国家自然科学基金(61272425 61303197 61202475) 青岛市科技计划项目(12-1-4-2-(16)-jch 12-1-4-2-(14)-jch 13-1-4-151-jch) 华为科技基金(YB2013120027) 信息安全国家重点实验室开放课题项目 山东省计算机网络重点实验室开放课题项目(SDKLCN-2013-03)资助~~
关键词 秘密共享 多秘密共享 可信中心 可公开验证方案 安全性 网络安全 信息安全 secret sharing multi-secret sharing trusted center publicly verifiable scheme security network security information security
  • 相关文献

参考文献15

  • 1Shamir A. How to share a secret. Communications of the ACM, 1979, 22(11): 612-613.
  • 2BlakleyGR. Safeguarding eryptographic keys//Proceedings of the National Computer Conference. New York, USA, 1979:313-317.
  • 3Feldman P. A practical scheme for non-interactive verifiable secret sharing//Proceedings of the 28th IEEE Symposium on the Foundations of Computer Science. Los Angeles, USA, 1987:427-437.
  • 4Pedersen T. Non-interactive and information-theoretic secure verifiable secret sharing//Proceedings of the CRYPTO' 91. Snata Barbara, USA, 1991:129-140.
  • 5Stadler M. Publicly verifiable secret sharing/ /Proceedings of the EUROCRYPT'96. Saragossa, Spain, 1996.. 190-199.
  • 6Sehoenmakers B. A simple publicly verifiable secret sharing scheme and its application to electronic voting//Proceedings of the CRYPTO'99. Santa Barbara, USA, 1999:148-164.
  • 7Gennaro R, Jarecki S, Krawczyk H, Rabin T. Secure distributed key generation for discrete-log based cryptosystems //Proceedings of the Eurocrypt'99. Prague, Czech Republic, 1999:295-310.
  • 8He J, Dawson E. Multistage secret-sharing scheme based on one-way function. Electronics Letters, 1994, 30(19): 1591- 1592.
  • 9Yang C C, Chang T Y, Hwang M S. A (t,n) multi-secret sharing scheme. Applied Mathematics and Computations, 2004, 151(2) : 483-490.
  • 10Dehkordi M H, Mashhadi S. New efficient and practical verifiable multi-secret sharing scheme. Information Sciences, 2008, 178(9): 2262-2274.

同被引文献133

引证文献19

二级引证文献31

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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