期刊文献+

一种基于格的属性多重加密方案 被引量:4

An Attribute Multiple Encryption Scheme Based on Lattices
下载PDF
导出
摘要 为提高属性加密系统的运行效率和加解密的安全性,提出采用格理论代替双线性对来减少加解密过程的运算量。根据格上的密文策略属性加密方案和属性动态多重加密方案,给出一种属性多重加密方案。该方案能同时加密多条消息,提高系统运行效率并且抵抗量子密码的攻击。对方案的正确性进行严格推导证明,并利用可证明安全将方案的安全性规约到学习错误困难问题中。分析结果表明,该方案是正确并且可行的。 In order to improve the operating efficiency and the security of encryption and decryption of attribute encryption system,the theory of lattice instead of bilinear pairings is used to reduce the computational complexity of encryption and decryption process.According to the scheme of ciphertext policy attribute encryption from lattices and the scheme of dynamic multi-attribute encryption,a multiple encryption scheme is proposed based on lattices.This scheme has the capability to encrypt multiple messages at the same time and improve the operating efficiency of the system,and it can also against quantum attack.The correctness of the scheme is strictly derived,and the security of the scheme is reduced to Learning With Errors(LWE) hard problem using provable security.The analysis result shows that the proposed scheme is correct and feasibile.
出处 《计算机工程》 CAS CSCD 北大核心 2018年第2期193-196,共4页 Computer Engineering
基金 国家自然科学基金([2011]61163049) 贵州省自然科学基金(黔科合J字[2014]7641)
关键词 学习错误问题 多重秘密共享 属性加密 抗量子 Learning With Errors(LWE) problem multiple secret sharing attribute encryption post-quantum lattice
  • 相关文献

参考文献2

二级参考文献29

  • 1Maji 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.
  • 2Li 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.
  • 3Herranz 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.
  • 4Zeng 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.
  • 5Okamoto 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.
  • 6Okamoto 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.
  • 7Gentry 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.
  • 8Regev 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.
  • 9Lyubashevsky 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.
  • 10Lindner R, Peikert C. Better key sizes (and attacks) for lwe-based encryption[C]//Proceedings of Cryptographers' Track at the RSA Conference. New York: Springer-Verlag, 2011: 319-339.

共引文献24

同被引文献42

引证文献4

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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