期刊文献+

一种格上基于改进盆景树模型的属性签名方案 被引量:2

Lattice-based attribute signature scheme from improved bonsai trees model
下载PDF
导出
摘要 为了提高数字签名的效率和安全性,使数字签名方案能抵抗量子攻击,引入属性密码体制和格理论,利用Cash等人提出的改进的盆景树签名模型,同时在密钥提取过程中加入用户自己的信息来产生签名私钥,提出了一种格上基于改进盆景树的属性签名方案。经过分析发现该方案不仅提高了签名效率,而且授权机构无法获得私钥来伪造签名。最后,在随机预言机模型下利用SIS问题证明了方案的存在性不可伪造性;与传统的属性签名相比,该方案具有更高的效率和更高的安全性。 In order to improve the efficiency and the security of digital signature,resist quantum attack,this paper introduced the attribute-based cryptosystem and lattice theories,and the improved bonsai trees model in Cash et al's paper. Meanwhile adding users own information to generate the private key,this paper proposed a lattice-based attribute signature scheme based on improved bonsai tree. Through the analysis,this scheme not only improved the efficiency of digital signature but also made the authorization institute has no chance to forge signatures. It proves that the scheme is existential unforgeability under the SIS hard problem in the random oracle model. Compared with the traditional attribute-based signatures,this scheme has higher efficiency and higher security.
作者 汤海婷 汪学明 Tang Haiting;Wang Xueming(College of Computer Science & Technology,Guizhou University,Guiyang 550025,Chin)
出处 《计算机应用研究》 CSCD 北大核心 2018年第6期1789-1792,共4页 Application Research of Computers
基金 国家自然科学基金资助项目(61163049) 贵州省自然科学基金资助项目(黔科合J字[2014]7641)
关键词 盆景树 属性密码体制 小整数解问题 抗量子 效率 lattice bonsai trees attribute-based cryptosystem small integer solution(SIS) problem post-quantum efficiency
  • 相关文献

参考文献4

二级参考文献40

  • 1Shamir A.Identity-based cryptosystems and signature schemes. Advances in Cryptology-Proceedings of CRYPTO’84 . 1985
  • 2Maji H K, Prabhakaran M, Rosulek M. Attribute based sig- natures: Achieving attribute privacy and collusion resis- tance[EB/OL].[2014- l 2-20]. http://eprint.iacr.org/2008/328.
  • 3Li J, Au M H, Susilo W, et al. Attribute-based signature and its applications[C]//Proceedings of 5th ACM Symposium on Information, Computer and Communications Security. New York: ACM Press, 2010: 60-69.
  • 4Herranz J, Laguillaumie F, Libert B, et al. Short attribute-based signatures for threshold predicates[C]//Proceedings of Topics in Cryptology. Berlin: Springer-Verlag, 2012: 51- 67.
  • 5Zeng F, Xu C, Li Q, et al. Attribute-based signature schemewith constant size signature[J]. Journal of Computational Information Systems, 2012, 8(7): 2875-2882.
  • 6Okamoto T, Takashima K. Efficient attribute-based signa- tures for non-monotone predicates in the standard model[C]//Proceedings of 14th International Conference on Practice and Theory in Public Key Cryptography. Berlin: Springer-Verlag, 2011: 35-52.
  • 7Okamoto T, Takashima K. Decentralized attribute-based signatures[C]// Proceedings of 16th International Confer- ence on Practice and Theory in Public Key Cryptography. Berlin: Springer-Verlag, 2013: 125-142.
  • 8Gentry C, Peikert C, Vaikuntanathan V. How to use a short basis: trapdoors for hard lattices and new cryptographic con- structions[C]//Proceedings of 4Oth Annual ACM Symposium on Theory of Computing. New York: ACM Press, 2008: 197-206.
  • 9Regev O. On lattices, learning with errors, random linear codes, and cryptography[C]//Proceedings of 37th Annual ACM Symposium on Theory of Computing. New York: ACM Press, 2005: 84-93.
  • 10Lyubashevsky V, Peikert C, Regev O. On ideal lattices and learning with errors over rings[C]//Proceedings of 29th An- nual International Conference on the Theory and Applica- tions of Cryptographic Techniques. Berlin: Springer-Verlag, 2010: 1-23.

共引文献12

同被引文献6

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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