期刊文献+

安全(t,n)门限数字签名方案 被引量:1

Security(t,n) threshold digital signature scheme
下载PDF
导出
摘要 门限签名是这样一种签名体制,它主要应用于需要将签名权力以门限的方式分散在群组的各成员间的场合中。门限数字签名体制是一般数字签名体制与门限秘密共享方案相结合的产物。对门限数字签名的最新研究成果以及进展进行了追踪,对已有的方案进行分析,首先简单介绍了一种可验证的防欺诈的秘密分享方案;然后,综合运用密码学以及数论知识,基于以上方案提出了一种新的安全的门限数字签名方案,新方案在具有独特的安全性特点的同时,在通信和计算上表现得比较有效。具体表现为系统初始化结构简单,其验证算法计算复杂度小、通信成本低、安全性较好,对于签名信息在网络上的传输和处理具有实用价值。 Threshold digital signature scheme is such a signature scheme that was mainly applies to the situation that we need to share the signing right to the group members through threshold method.Threshold digital signature scheme is the product of the general digital signature scheme with the threshold secret sharing scheme.In this thesis,we trace the newest result and trend of the threshold signature,analyze the current schemes.And finally,we introduce a verified and anti-fraud secret sharing scheme briefly.Then,in applying cryptography and knowledge of number theory,we give a new secure threshold digital signature scheme based on the above programs.The new program has a unique security feature,and makes communications and computing performance more effectively at the same time.The scheme has simple system initialization and structure,less computing complexity of the verification,less communication cost,and better security and practical value in transmission and treatment for security threshold digital signature scheme in the network.
出处 《沈阳师范大学学报(自然科学版)》 CAS 2012年第2期172-175,共4页 Journal of Shenyang Normal University:Natural Science Edition
基金 黑龙江省教育厅科学研究资助项目(12513081)
关键词 数字签名 秘密分享方案 门限数字签名 离散对数问题 digital signature secret sharing scheme threshold digital signature discrete logarithm problem
  • 相关文献

参考文献15

  • 1DESMEDY Y, FRANKEL Y. Shared generation of authenticators and signatures [ C]//Advances in Cryptology-Cvpto'91 Proceedings, LNCS 576, Berlin: Springer-Verlag, 1992:457-469.
  • 2HUANG H F, CHANG C C. A novel efficient (t,n) threshold proxy signature scheme[J]. Information Sciences, 2006, 176(10) :338-349.
  • 3KAYA K, SELCUK A A. Threshold cryptography based on Asmuth-BIoom secret sharing[ J ]. Information Sciences, 2007, 177(19) :148-160.
  • 4YU J, BUYYA R. A taxonomy of workflow management systems for grid computing[ J]. Journal of Grid Computing, 2005, 3(3/4) :171- 200.
  • 5SHAMIR A. How to Share a secret[J]. Communications of the ACM, 1979,22(11 ) :612-613.
  • 6BYUNA E J, CHOIA S J, BAIKB M S, et al. MJSA Markov job scheduler based on availability in desktop grid[ J ]. Future Genera-tion Computer Systems, 2007,23 (4) :616-622.
  • 7何业锋,张建中.防欺诈的动态秘密分享方案[J].西安电子科技大学学报,2004,31(1):153-155. 被引量:7
  • 8PATEL Y, DARLINGTON J. A novel stochastic algorithm for scheduling QoS-constrained workflows in a Web service- oriented grid [ C ]////Pro-ceedings of the 2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology. Hong Kong : IEEE Press, 2006:437-442.
  • 9SONJ H, KIM M H. Improving the performance of time-constrained worktlow processing [ J ]. The Journal of System and Software, 2001,58 ( 3 ) :211-219.
  • 10陈碧琴,熊桂武.组合恒等式的两种新证法[J].沈阳师范大学学报(自然科学版),2004,22(3):169-171. 被引量:2

二级参考文献59

共引文献38

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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