期刊文献+

格上无证书代理重签名 被引量:1

A Certificateless Proxy Re-signature Scheme Based on Lattice
下载PDF
导出
摘要 代理重签名作为一种特殊的数字签名,在电子认证和电子商务方面越来越重要.格密码作为抵抗量子攻击密码体制的代表之一,具有更高的安全性和更高的计算效率,因此基于格出现了一系列代理重签名方案.Tian M M给出了拥有较高效率的身份基代理重签名方案,但该方案中代理重密钥需要委托者和受托者的私钥才能生成,且需要基于身份密钥托管.本文针对这两点不足进行改进,利用无抽样技术和格上的陷门生成算法、原像取样算法,构造了效率较高的格上无证书代理重签名方案.在随机预言机模型下证明了新方案的正确性,并且基于小整数解问题SIS的困难性证明了新方案对外部攻击和内部攻击在选择身份和选择消息下是存在不可伪造的.与已有格上的代理重签名相比,该方案能抵抗中间人攻击,具有更好的安全性和较高的效率. As a special digital signature,proxy re-signature schemes are becoming more and more important in electronic authentication and e-commerce.As one of the cryptosystems having resistance against quantum attack,lattice-based ciphers have high security and computational efficiency,therefore,a number of proxy re-signature schemes based on lattice have been designed.An identity-based proxy re-signature scheme with high efficiency was proposed by Tian M M.In Tian's scheme,the generation of the proxy key requires to use the private key of the assignor and that of the trustee,and needs the identity-based key escrow.This study improves these two deficiencies and proposes a certificateless proxy re-signature scheme.The new scheme utilizes the technique of rejection samplings,as well as the algorithm of trapdoor generation and original image sampling on lattice.The correctness of the proposed scheme is proved in the random oracle model.Based on the hardness of the small integer solution(SIS)problem,it is proved that this scheme is unforgeable for external and internal attacks under the adaptive chosen-message and adaptive chosen-identity models.Compared with the existing agent re-signature schemes,this scheme can resist man-in-the-middle attack,with better security and higher efficiency.
作者 范祯 欧海文 裴焘 FAN Zhen;OU Hai-Wen;PEI Tao(CSIC No.722 Research Insititue,Wuhan 430079,China;Beijing Electronic Science and Technology Institute,Beijing 100071,China)
出处 《密码学报》 CSCD 2020年第1期15-25,共11页 Journal of Cryptologic Research
关键词 小整数解问题 无证书代理重签名 lattice small integer solution problem certificateless proxy re-signature
  • 相关文献

参考文献2

二级参考文献19

  • 1Blaze M, Bleumer G, and Strauss M. Divertible protocols and atomic proxy cryptography[J]. Lecture Notes in Computer Science (LNCS), 1998, 1403: 127-144.
  • 2Ateniese G and Hohenberger S. Proxy re-signatures: new definitions, algorithms, and applications[C]. ACMConference on Computer and Communications Security 2005, Alexandria, VA, USA, 2005: 310-319.
  • 3Libert B and Vergnaud D. Multi-use unidirectional proxy re-signatures[C]. ACM Conference on Computer and Communications Security 2008, Alexandria, Virginia, USA, 2008: 511-520.
  • 4Sbao Jun, Feng Min, Zhu Bin, et al.. The security model of unidirectional proxy re-signature with private re-signature key[J]. Lecture Notes in Computer Science (LNCS), 2010, 6168: 216-232.
  • 5Schnorr C P. Efficient identification and signatures for smart cards[J]. Lecture Notes in Computer Science (LNCb-, 1990, 435: 688-689.
  • 6Gentry C, Peikert C hard lattices and and Vaikuntanathan V. Trapdoors for new cryptographic Symposium on Theory of Computing 2008 Columbia, Canada, 2008: 197-206. constructions[C]. Victoria. British.
  • 7Cash D, Hofheinz D, Kiltz E, et al.. Bonsai trees, or how to delegate a lattice basis[J]. Lecture Notes in Computer Science (LNCb, 2010, 6110: 523-552.
  • 8AgrawM S, Boneh D, and Boyen X. Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE[J]. Lecture Notes in Computer Science (LNCS), 2010, 6223: 98-115.
  • 9Boneh D and Freeman D. Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures[J]. Lecture Notes in Computer Science (LNCS), 2011, 6571: 1-16.
  • 10Lyubashevsky V. Lattice signatures without trapdoors[J]. Lecture Notes in Computer Science (LNCS), 2012, 7237: 738-755.

共引文献10

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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