期刊文献+

基于离散对数的容忍入侵的代理盲签名方案 被引量:1

Intrusion-tolerant proxy blind signature scheme based on discrete logarithm
下载PDF
导出
摘要 为了防御代理盲签名方案中原始签名者的伪造攻击和签名接收者的伪造攻击,该文对签名算法进行了研究。该文基于新的(t,n)秘密共享机制将证书授权中心(Certificate authority,CA)私钥进行分存,使用其身份作为私钥份额的标识,提供私钥保护的容侵性。该方案不是从保护系统或检测入侵出发来保证CA的安全,而是确保当少数部件被攻击或占领后,CA系统的机密信息并没有暴露。研究结果表明:系统中即使一定数量的用户被恶意攻击者攻击后,系统仍可有效地运转。 To defend the forgery attacks of the original signer and signature receiver in the scheme of proxy blind signature,this paper studies the problem of the signature algorithm. Based on the new(t,n) secret sharing mechanism,the private key of the Certificate Authority( CA) is separately stored by using its identity as the mark of private key so that it can provide the intrusion tolerance for the securing Private Keys. Rather than preventing intrusions or attacks to ensure safety of CA,the project ensures that the confidential information of the CA system will not be exposed when a minority of components are attacked. The research results show that even if certain users are spitefully attacked,the system still works properly.
出处 《南京理工大学学报》 EI CAS CSCD 北大核心 2015年第1期34-38,共5页 Journal of Nanjing University of Science and Technology
基金 国家自然科学基金(31270577)
关键词 离散对数 容忍入侵 可撤销匿名性 基于身份 私钥保护 代理盲签名 discrete logarithm intrusion tolerance anonymity-revoking identity-based securing private keys proxy blind signature
  • 相关文献

参考文献9

二级参考文献87

共引文献55

同被引文献13

  • 1Peter Shor. Algorithms for quantum computation :Discrete logarithms and factoring [ A ]. IEEESymposium on Foundations of Computer Science [ C ].Santa Fe, US; IEEE Computer Soceity Press, 1994;124-134.
  • 2You I,Hori Y, Sakurai K. Enhancing SVO logic formobile IPV6 security protocols [ J ]. Journal of WirelessMobile Networks, Ubiquitous Computing, andDependable Applications ( JoWUA ),2011,2(3):26-52.
  • 3Micciancio D, Regev 0. Post-quantum cryptography[M ]. Berlin,Germany : Springer Berlin Heidelberg,2009:147-191.
  • 4Gentry C, Peikert C, Vaikuntanathan V. Trapdoors forhard lattices and new cryptographic constructions [ J ].Electronic Colloquium on Computational Complexity,2008,14:197-206.
  • 5Cash D,Hofheinz D,Kiltz E,et al. Bonsai trees,or howto delegate a lattice basis [ J] . Journal of Cryptology,2012,25(4) :601-639.
  • 6Agrawal S,Boneh D,Boyen X. Efficient lattice( H) IBEin the standard model [ J ]. Advances in Cryptology-Eurocrypt 2010( The Series Lecture Notes in ComputerScience) ,6110:553-572.
  • 7Singh K, Pandu Rangan C, Baneijee A K. Security,privacy,and applied cryptography engineering [ M ].Berlin, Germany: Springer Berlin Heidelberg, 2012:153-172.
  • 8Singh K, Pandu Rangan C, Baneijee A K. Efficientlattice HIBE in the standard model with shorter publicparameters [ J ]. Information and Communication(Technology Lecture Notes in Computer Science),2014,8407:542-553.
  • 9Micciancio D, Regev 0. Worst-case to average-casereductions based on Gaussian measures [ J ]. SIAMJournal on Computing ,2007,37 ( 1 ) :267-302.
  • 10Alwen J, Peikert C. Generating shorter bases for hardrandom lattices [ J ]. Theory of Computing Systems,2011,48(3):535-553.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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