期刊文献+

可撤销的高效格基代理签名

Efficient Lattice-based Proxy Signature Supporting Revocation
下载PDF
导出
摘要 江明明等在2014年提出的格上代理签名方案,不能提供代理授权的公开可验证性,且需要安全信道来传输授权信息。针对这一问题,引入授权证书,提供了代理授权的公开可验证性,解除了原方案对安全信道的依赖。同时,改变原方案的授权方式,将代理签名的签名操作次数从2次降到了1次,提高了方案效率。另外,改进方案还引入了一个撤销列表,实现了代理授权在有效期内的撤销功能。分析表明,相比较于江明明等人的方案,新方案从安全性和效率上,都有了较大的改进。 Jiang's lattice-based proxy signature scheme couldn't provide public verifiability of delegation,and depends on the existence of secure channel to transmit delegation information. To solve this problem,an improved scheme was presented by introducing the warrant to realize the delegation's public verifiability and getting rid of the dependence on secure channel. Furthermore,in the new proxy signature algorithm,authorization method was changed,and the basic signature operation downed from two times to one time,so that the scheme's efficiency was further improved. In addition,a revocation list was introduced,and the delegation revocation was achieved during the period of validity. The proposed scheme has with better security and efficiency compared to Jiang's scheme.
出处 《四川大学学报(工程科学版)》 EI CAS CSCD 北大核心 2016年第1期139-145,共7页 Journal of Sichuan University (Engineering Science Edition)
基金 国家自然科学基金资助项目(61402015) 河北省教育厅青年基金资助项目(QN2015084) 廊坊市科技支撑计划资助项目(2014011029) 廊坊师范学院博士基金资助项目(LSLB201408)
关键词 基于格的密码体制 代理签名 授权撤销 无陷门签名 后量子密码 lattice-based cryptography proxy signature delegation revocation signature without trapdoor post quantum cryptography
  • 相关文献

参考文献16

  • 1Mambo M, Usuda K, Okamoto E. Proxy signatures : Delega- tion of the power to sign messages [ J ]. IEICE Transactions on Fundamentals of Electronics, Communications and Com- puter Sciences, 1996,79 (9) : 1338 - 1354.
  • 2Shum K, Wei V K. A strong proxy signature scheme with proxy signer privacy protection [ C ]//WET ICE 2002. Pisca- taway: IEEE,2002 : 55 - 56.
  • 3Shao Z. Proxy signature schemes based on factoring [ J ]. In- formation Processing Letters ,2003,85 ( 3 ) : 137 - 143.
  • 4Malkin T, Obana S, Yung M. The hierarchy of key evolving signatures and a characterization of proxy signatures [ C ]// Advances in Cryptology--EUROCRYPT 2004. Interlaken: Springer,2004:306 - 322.
  • 5Li X, Chen K,Sun L. Certificateless signature and proxy sig- nature schemes from bilinear pairings [ J ]. Lithuanian Math- ematical Journal ,2005,45 ( 1 ) :76 - 83.
  • 6Schuldt J C N, Matsuura K, Paterson K G. Proxy signatures secure against proxy key exposure [ C ]//Public Key Cryp- tography-PKC 2008. Barcelona: Springer,2008 : 141 - 161.
  • 7Boldyreva A, Palacio A,Warinschi B. Secure proxy signature schemes for delegation of signing rights[J]. Journal of Cryp- tology,2012,25( 1 ) :57 - 115.
  • 8Jiang Y, Kong F, Ju X. Lattice-based proxy signature [ C ]/// CIS 2010. Nanning:IEEE,2010:382 - 385.
  • 9夏峰,杨波,马莎,孙微微,张明武.基于格的代理签名方案[J].湖南大学学报(自然科学版),2011,38(6):84-88. 被引量:9
  • 10Kim K S, Hong D, Jeong I R. Identity-based proxy signature from lattices [ J ]. Journal of Communications and Networks, 2013,15(1) :1 -7.

二级参考文献30

  • 1MAMBO M, USUDA K, OKAMOTO E. Proxy signatures for delegating signing operation[C]//Proc 3rd ACM Confer- ence on Computer and Communications Security. New York z ACM, 1996:48-57.
  • 2SHOR P W. Polynomial-time algorithm for prime faetorization and discrete logarithm on a quantum computer[J]. SIAM Journal on Computing, 1997, 26(5) :1484-1509.
  • 3GENTRY C,PEIKERT C, VAIKUNTANATHAN V. Trap- doors for hard lattices and new cryptographic constructions[C]//Proc 40th ACM Symp on Theory of Computing (STOC). New York: ACM, 2008:197-206.
  • 4REGEV O. On lattices, learning with errors, random linear codes, and cryptography[J]. Journal of the ACM, 2009, 56 (6):1-40.
  • 5PEIKERT C. Public-key cryptosystems from the worst-case shortest vector problem[C]//Proc 41st ACM Symp on Theory of Computing (STOC). New Yorkz ACM, 2009:333-342.
  • 6AGRAWAL S, BONEH D,BOYEN X. Efficient lattice (H) IBE in the standard model[ C]//Advances in Cryptology-Euro- crypt 2010. Berlin.. Springer Verlag, 2010: 553-572.
  • 7LYUBASHEVSKY V,PEIKERT C,REGEV O. On ideal lat- tices and learning with errors over rings[C]//Advances in Cryptology-Euroerypt 2010. Berlin: Springer Verlag, 2010, 1 -23.
  • 8LENSTRA A K, LENSTRA H W, LOV'ASZ L. Factoring polynomials with rational coefficients [J]. Math Ann, 1982, 2.61(4) ,515-534.
  • 9MICCIANCIO D, REGEV O. Worst-case to average-case re- ductions based on gaussian measures[J]. SIAM J Comput, 2007, 37(1) :267-302.
  • 10AITAI M. Generating hard instances of the short basis prob- lem[C]// ICALP 1999. Berlin~ Springer Verlag, 1999 : 1-9.

共引文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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