Attribute-Based Encryption Scheme Supporting Tree-Access Structure on Ideal Lattices

• Published in: Cloud Computing and Security pp. 519 - 527
• Main Authors: Yu, Jinxia, Yang, Chaochao, Tang, Yongli, Yan, Xixi
• Format: Book Chapter
• Language: English
• Published: Cham Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Attribute-based encryption; Ideal lattices; Tree-access structure
• ISBN: 3030000117; 9783030000110
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-030-00012-7_47

Attribute-based encryption (ABE) has been an active research area in cryptography due to its attractive applications. But almost all ABE scheme are based on bilinear maps, which leave them vulnerable to quantum cryptanalysis. The cryptographic system based on lattices is considered to be able to resist the quantum attack, and the computational efficiency is high. Therefore, the encryption scheme based on lattice theory has received wide attention in recent years. At present, the research of the attribute based encryption scheme on ideal lattices is lacking, and there are many problems need to be solved. Lots of existing schemes support only a single access policy and cannot support flexible expressions. For solving the problem of designing access structure in attribute-based encryption scheme under quantum environment, combined with Zhu’s scheme, an attribute-based encryption scheme supporting tree access structures on ideal lattices is introduced. The scheme adopts tree-access structure to express access strategy, the leaf nodes of the tree represent attributes, and the non-leaf nodes represent logical operators. The access tree can express the access policy flexibly by Shamir threshold secret sharing technology, including “and”, “or”, “threshold” operation. The scheme is proved to be secure against chosen plaintext attack under the standard mode. The analysis shows that our scheme can resist the quantum attack and realize the flexible access strategy with the better performance.