New Multi-authority Attribute-based Encryption Scheme on Lattices
YAN Xixi① LIU Yuan① LI Zichen② TANG Yongli① YE Qing①
①(School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454003, China) ②(School of Information Engineering, Beijing Institute of Graphic Communication, Beijing 102600, China)
Abstract：To resolve the problem of poor security on quantum attack in attribute-based encryption over the bilinear maps, a new multi-authority attribute-based encryption scheme on lattices is proposed. Firstly, the SamepleLeft algorithm was used to extract the user’s private key, so it can reduce the size of private key which is related to the dimensions of concatenation matrix and the quantity of users’ attributes. Secondly, aiming at the problem of single access policy, the new scheme employed the Shamir secret sharing scheme which is used to construct an access tree to realized “AND, OR, THRESHOLD” operations on attributes, so the ciphertext can be generated by any access structure, and the expressive skill of access policy is more extensive. Lastly, the security of the proposed scheme could reduce to the hardness of decisional learning with errors problem under standard model. Comparative analysis shows that, the size of public parameters, master secret key, user’s private key and ciphertext are all optimized, and it has better performance than single authority schemes in some degree. Furthermore, from perspective of security and practicability, the new multi-authority attribute-based encryption scheme is more suitable for the demand of cloud environment.
SAHAI A and WATERS B. Fuzzy identity-based encryption [C]. Advances in Cryptology-Eurocrypt 2005. Berlin, Heidelberg, May 2005: 457-473.
[2]
AJTAI M and DWORK C. A public-key cryptosystem with worst-case/average-case equivalence[C]. Proceedings of ACM Symposium on Theory of Computing(STOC). EI Paso, Texas, USA, May 1997: 284-293.
[3]
REGEV O. On lattices, learning with errors, random linear codes, and cryptography[C]. Proceedings of the Symposium on Theory of Computing, Baltimore, USA, 2005: 84-93.
[4]
AGRAWAL S, BOYEN X, VAIKUNTANATHAN V, et al. Functional encryption for threshold functions (or fuzzy IBE) from lattices[C]. Proceedings of International Conference on Practice and Theory in Public Key Cryptography. Darmstadt, Germany, 2012: 280-297.
[5]
BOYEN X. Attribute-based functional encryption on lattices[C]. Proceedings of the 10th Theory of Cryptography Conference, Lecture Notes in Computer Science, Tokyo, Japan, 2013, 7785: 122-142.
[6]
LIU Ximeng, MA Jianfeng, XIONG Jinbo, et al. Threshold attribute-based encryption with attribute hierarchy for lattices in the standard model[J]. IET Information Security, 2014, 8(4): 217-223. doi: 10.1049/iet-ifs.2013.0111.
[7]
ZHAO Jian, GAO Haiying, and ZHANG Junqi. Attribute- based encryption for circuits on lattices[J]. Tsinghua Science and Technology, 2014, 45(5): 463-469. doi: 10.3969/j.issn. 1007-0214.2014.05.005.
[8]
WANG Yongtao. Lattice ciphertext policy attribute-based encryption in the standard model[J]. International Journal of Network Security, 2014, 16(6): 444-451. doi: 10.6633/IJNS. 201411.16(6).6.
[9]
ZHU Wei-ling, YU Jianping, WANG Ting, et al. Efficient attribute-based encryption from R-LWE[J]. Chinese Journal of Electronics, 2014, 23(4): 778-782.
WU Liqiang, YANG Xiaoyuan, and HAN Yiliang. An efficient FIBE scheme based on ideal lattices[J]. Chinese Journal of Computers, 2015, 38(4): 775-782. doi: 10.3724/ SP.J.1016.2015.00775.
[11]
TAN S F and SAMAUDIN A. Lattice ciphertext-policy attribute-based encryption from ring-LWE[C]. Proceedings of International Symposium on Technology Management and Emerging Technologies, Langkawai Island, Malaysia, 2015: 258-262.
YANG Haibin. A new hierarchical identity-based encryption scheme based on lattices[J]. Journal of Wuhan University (Nature Science Edition), 2016, 62(2): 155-160. doi: 10.14188 /j.1671-8836.2016.02.009.
[14]
CHEN Zehong, ZHANG Peng, ZHANG Fangguo, et al. Ciphertext policy attribute-based encryption supporting unbounded attribute space from R-LWE[J]. KSII Transactions on Interent and Information Systems, 2017, 11(4): 2292-2309. doi: 10.3837/tiis.2017.04.025.
[15]
CHASE M. Multi-authority attribute based encryption[C]. Proceedings of Theory of Cryptography Conference. (TCC ’07), Amsterdam, Netherlands, 2007: 515-534.
[16]
ZHANG Guoyan, QIN Jing, and QAZI S. Multi-authority attribute-based encryption scheme from lattices[J]. Journal of Universal Computer Science, 2015, 21(3): 483-501. doi: 10.3217/jucs-021-03-0483.
[17]
GENTRY C, PEIKERT C, and VAIKUNTANATHAN V. Trapdoors for hard lattice and new cryptographic constructions[C]. Proceedings of the Symposium on Theory of Computing, Victoria, Canada, 2008: 197-206.
[18]
AGRAWAL S, BONEH D, and BOYEN X. Efficient lattice (H)IBE in the standard model[C]. Proceedings of Eurocrypt 2010, Lecture Notes in Computer Science, Riviera, France, May 2010, 6110: 553-572.
