期刊文献+

格基强指定验证者签名方案 被引量:2

Lattice-based Strong Designated Verifier Signature Scheme
下载PDF
导出
摘要 强指定验证者签名只允许指定的验证者验证签名的有效性,它可应用于招标和发放软件许可证等场合.首先利用Boyen提出的基于格的签名方案构造了一个基于格的强指定验证者签名方案,然后在标准模型下基于小整数解(Small integer solution,SIS)问题证明了该方案在适应性选择消息攻击下是存在性不可伪造的.迄今人们提出的基于格的强指定验证者签名方案都是在随机预言模型下可证明安全的,而随机预言模型存在一定的安全缺陷,因此文中提出的基于格的强指定验证者签名方案更有实际意义. A strong designated verifier signature scheme only allows a designated verifier to validate signer's signatures, and it can be applied to public bidding, issuing software license, etc. We constructed a lattice-based strong designated verifier signature scheme by use of the lattice-based signature scheme that Boyen has proposed recentlyl Then we formally proved that the proposed signature scheme was existentially unforgeable against adaptive chosen message attacks under the assumption of the small integer solution ( SIS ) problem in the standard model. The existing lattice-based strong designated verifier signature schemes are all proven to be secure in the random oracle model. However, there are some security vulnerabilities for the random oracle model. Therefore, the proposed lat- tice-based strong designated verifier signature scheme in this paper is more practical.
出处 《小型微型计算机系统》 CSCD 北大核心 2013年第10期2363-2366,共4页 Journal of Chinese Computer Systems
基金 国家"九七三"重点基础研究发展计划项目(2011CB311809)资助 国家自然科学基金项目(61163050)资助 河北省教育厅科研项目(ZD2010102)资助
关键词 强指定验证者签名 原像抽样算法 SIS问题 strong designated verifier signature preimage sampling algorithm SIS problem lattices
  • 相关文献

参考文献12

  • 1Regev O. On lattices, learning with errors, random linear codes, and cryptography [C]. Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC'05), New York: ACM Press, 2005: 94 -103 .
  • 2Wang F, Hu Y, Wang B. Lattice-based strong designate verifier signature and its applications [J]. Malaysian Journal of Computer Science, 2012, 25(1): 11-22.
  • 3Ajtai M. Generating hard instances of lattice problems [C]. Proceedings of the 28th Annual ACM Symposium on Theory of Computing(STOC'96), New York: ACM Press, 1996: 99-108.
  • 4Jakobsson M, Sako K, Impagliazzo R. Designated verifier proofs and their applications [C]. Proceedings of Eurocrypt 1996, Lecture Notes in Computer Science 1070, Berlin: Springer-Verlag, 1996: 143-154.
  • 5Micciancio D, Regev O. Worst-case to average-case reductions based on Gaussian measures [J]. SIAM Journal on Computing, 2007, 37( 1) : 267-302.
  • 6Agrawal S, Boneh D, Boyen X. Efficient lattice (H) IBE in the standard model [C]. Proceedings of Eurocrypt 2010, Lecture Notes in Computer Science 6110 .Berlin , Springer-Verlag ,2010 :553-572.
  • 7Huang Q, Yang G, Wong D S, et al. Efficient strong designated verifier signature schemes without random oracles or delegatability [EB/OL]. http://eprint.iacr. org/2009/518, 2009,10.
  • 8Laguillaumie F, Vergnaud D. Designated verifier signatures: anonymity and efficient construction from any bilinear map [C]. Proceedings of the 4th Conference on Security in Communication Networks ( SCN'04), Lecture Notes in Computer Science 3352, Berlin: Springer-Verlag, 2004: 105-119.
  • 9Alwen J. Peikert C. Generating shorter bases for hard random lattices[J]. Theory of Computing Systems, 2011,48(3): 535-553.
  • 10Boyen X. Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more [C]. Proceedings of the 13 th International Conference on Practice and Theory in Public Key Cryptography (PKC' 10), Lecture Notes in Computer Science 6056, Berlin: Springer-Verlag, 2010: 499-517.

二级参考文献1

共引文献15

同被引文献6

引证文献2

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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