期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种新的门限秘密共享方案 被引量：4

A new threshold secret sharing scheme
下载PDF
导出
摘要 一个(k,n)门限秘密共享方案允许把一个秘密S分成n份Si(1≤i≤n),每一份交由一个用户Pi,使得任意k个或多于k个用户联合起来可以恢复秘密S,而任意少于k个用户却不能。在现实生活中,它有着非常广泛的应用。文章介绍了Shamir秘密共享方案,并设计了一种新的基于线性方程组求解的门限秘密共享方案。该方案满足完备、理想特性;与Shamir门限方案相比,其安全性相当;但在计算、重构以及更新共享时更有效。 A （k, n） threshold secret sharing scheme is a method of splitting a secret S into shares Si（1≤i≤n） and distributing them to users Pi so that any group of k or more users can pool their shares together to recover S but no group of k-1 or fewer users can do so. It is widely employed in the real world. In this paper, the Shamir＇s secret sharing scheme is simply introduced, and a new threshold secret sharing scheme based on solving the linear equations is presented. This new scheme is perfect and ideal. Compared with the Shamir＇s threshold scheme, it is far more efficient to compute, reconstruct and renew the shares with equivalent levels of security.
作者 石润华 黄刘生
机构地区 安徽大学计算机科学与技术学院 中国科学技术大学计算机科学与技术系
出处 《合肥工业大学学报（自然科学版）》 CAS CSCD 北大核心 2006年第2期164-168,共5页 Journal of Hefei University of Technology：Natural Science
基金 国家自然科学基金资助项目(60573171) 安徽省青年教师科研基金资助项目(2005JQ1036) 安徽大学计算机学院创新团队资助项目
关键词 门限方案 秘密共享 信息率 完备 threshold scheme secret sharing information rate perfection ideal
分类号 TP309 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献11

  • 1Blakley G R.Safeguarding cryptographic keys[A].Proceeding of AFIPS 1979 National Computer Conference[C].Reston:American Federation of Information Processing Societies,1979.313-317.
  • 2Shamir A.How to share a secret[J].Commun of the ACM,1979,22:612-613.
  • 3Ito M,Saito A,Nishizcki T.Secret sharing scheme realizing general access structure[A].Proceedings of IEEE Globecom'87[C].Tokyo,1987.99-102.
  • 4Benaloh J C,Leichter J.Generalized secret sharing and monotone functions[A].Goldwasser S.Avdances in Cryptology-Crypto' 88,LNCS 403[C].Heidelberg:Springer-Verlag,1990.27-35.
  • 5Herzberg A,Jarecki S,Krawczyk H,et al.Proactive secret sharing or:How to cope with perpetual leakage[A].Coppersmith D.Advances in Cryptology-Crypto'95,the 15th Annual International Cryptology Conference[C].Heidelberg:Springeer-Verlag,1995.457-469.
  • 6Canetti R Gennaro R,Herzberg A,et al.Proactive security:long-term protection against break-ins[J].CryptoBytes,1997,3(1):1-8.
  • 7Jarecki.Proactive secret sharing and public key cryptosystems[D].Cambridge:Department of Electrical Engineering and Computer Science,Massachusetts Institute of Technology,1995.
  • 8许春香,魏仕民,肖国镇.定期更新防欺诈的秘密共享方案[J].计算机学报,2002,25(6):657-660. 被引量：27
  • 9P Feldman.A practical scheme for non-interactive verifiable secret sharing[A].Proceedings of the 28th Annual IEEE Symposium on Foundation of Computer Science[C].New York:IEEE Computer Society Press,1987.427-437.
  • 10Pedersen T P.Non-interactive and information-theoretic secure verifiable secret sharing[A].Davies D W.Advances in Cryptology-Crypto'91[C].Berlin:SpringerVerlag,1991.129-140.

二级参考文献3

共引文献26

同被引文献39

  • 1刘锋,张建中.可公开验证的动态秘密分享机制[J].微电子学与计算机,2005,22(12):104-105. 被引量：2
  • 2高照锋,叶延风,庄毅.基于椭圆曲线密码体制的先应式秘密共享方案[J].计算机技术与发展,2007,17(7):131-134. 被引量：1
  • 3CHOR B, GOLDWASSER S, M1CAL S, et al. Verifiable secret sharing and achieving simultaneity in the presence of faults [ C]//Proc of IEEE FOCS'85. New York: IEEE Press, 1985 : 383-395.
  • 4PEDERSEN T P. Non-interactive and information-theoretic secure verifiable secret sharing [C]//Proceeding of the llth Annual International Cryptology Conference. London: Springer-Verlag, 1991, 576: 129-139.
  • 5GENNARO R, RABIN M, RABIN T. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography[ C] //Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing. New York: ACM Press, 1998: 101-111.
  • 6NIKOV V, NIKOVA S. On proactive secret sharing schemes [ M ] //Lecture Notes in Computer Science. Berlin: Springer Verlag, 2004, 3357: 308-325.
  • 7ASAEDA H, RAHMAN M, TOYAMA Y. Structuring proactive secret sharing in mobile ad-hoc networks [ C ]//International Symposium on Wireless Pervasive Computer (ISWPC). Phuket, Thailand: IEEE, 2006: 1-6.
  • 8HERZBERG A, JARECKI S, KRAWCZYK H. Proactive secret sharing or: how to cope with perpetual leakage [C]// Coppersmith Advances in Cryptology CRYPTO'95. Berlin: Springer Verlag, 1995: 339-352.
  • 9Shamir A.How to share a secret[J].Commun of the ACM,1979,22(11):612-613.
  • 10Blakley G R.Safeguarding cryptographic keys[C]//AFIPS Conference Proceedings,1979,48:313-317.

引证文献4

二级引证文献8

合肥工业大学学报（自然科学版）
2006年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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