期刊文献+

一个新的可验证的(t,n)多秘密共享方案 被引量:2

A new verifiable(t,n) multi-secret sharing scheme
下载PDF
导出
摘要 针对X-Y-W方案不能抵抗参与者欺诈的缺陷,基于证书和双子密钥思想提出一个新的可验证的(t,n)多秘密共享方案.其优点是:系统不需要安全信道,降低了通信代价,可防止分发者和参与者的欺诈,能动态地增加新的所需共享的密钥等.与现有的方案相比,该方案具有更低的通信量和存储量,效率更高. According to the defects that the X-Y-W scheme can not withstand the cheating among the participants,a new verifiable(t,n) multi-secret sharing scheme is presented based on certificate and double secret shadow.This scheme meets some advantages,such as it does not need a secure channel in the system,can reduce communication costs,/ the cheating can be prevented from the dealer and the participants,and new shared secret can be dynamically increased etc.Comparing with the existing schemes,lower communication traffic and storage make the proposed scheme more efficient.
出处 《陕西师范大学学报(自然科学版)》 CAS CSCD 北大核心 2012年第5期1-4,共4页 Journal of Shaanxi Normal University:Natural Science Edition
基金 国家自然科学基金资助项目(61173190) 陕西省自然科学基金资助项目(2009JM8002) 陕西省教育厅科学研究计划项目(2010JK829 2010JK398) 中央高校基本科研业务费专项资金项目(GK201002041)
关键词 密码学 证书 多秘密共享 cryptography certificate multi-secret sharing
  • 相关文献

参考文献6

二级参考文献37

共引文献46

同被引文献19

  • 1HE J, DAWSON E. Multi-stage secret sharing scheme based on one- way function [ J]. Electronic Letters, 1994, 30(19) : 1591 - 1594.
  • 2SHAMIR A. How to share a secret[ J]. Communications of the ACM, 1979,22 (11):612-613.
  • 3HARN L. Comment: multistage secret sharing scheme based on one- way function [ J]. Electronic Letters, 1995, 31 (4) : 262 - 262.
  • 4HE J, DAWSON E. Multisecret sharing scheme based on one-way function[ J]. Electronic Letters, 1995, 31 (2) : 93 - 95.
  • 5CHANG T, HWANG M, YANG W. A new multi-stage secret sharingscheme using one-way function[ J]. ACM SIGOPS Operating Systems Review, 2005, 39(1) : 48 - 55.
  • 6CHOR B, GOLDWASSER S, MICALI S, et al. Verifiable secret sha- ring and achieving simultaneity in the presence of faults [ C]// SFCS '85: Proceedings of the 26th Annual Symposium on Founda- tions of Computer Science. Washington, DC: IEEE Computer Socie- ty, 1985:383 -395.
  • 7HARN L. Efficient sharing(broadcasting) of multiple secret[ J]. Computer and Digitial Techniques, 2005, 152(3) : 237 - 240.
  • 8LINT Y, WU T C. ( t, n) threshold verifiable multi-secret sharing scheme based on factorization intractability and discrete logarithm modulo a composite problem [ J]. Computer and Digitial Tech- niques, 2009, 156(5) : 264 - 268.
  • 9HE W H, WU T S. Comment on Lin-Wu ( t, n) -threshold verifiable multi-secret sharing scheme[ J]. Computer and Digitial Techniques, 2011, 158(3) : 139.
  • 10CHANG T Y, HAWANG M S, YANG W P. An improvement on the Lin-Wu (t, n)- threshold verifiable multi-secret sharing scheme [J]. Applied Mathematics and Computation, 2012, 170(1) : 169 - 178.

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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