2014/05/14 by Shangping Wang, Wang, Shangping, Fang Feng +1
Computer Science · #81T25 #94A60 #Complexity and Algorithms in Graphs #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Internet Traffic Analysis and Secure E-voting #cs.CR #msc:81T25 #msc:94A60
paper · pdf · doi:10.48550/arxiv.1405.3394
18 pages
arxiv created 2014/05/14 · openalex publication_date 2014/05/14 · arxiv updated 2014/05/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We propose a large universe attribute-based encryption (ABE ) scheme from lattices. It is inspired by Brent Waters' scheme which is a large universe attribute-based encryption using bilinear map. It is a very practical scheme but this scheme may not be security with the developing quantum computer. So we extend their good idea of large universe attribute-based encryption to lattices based cryptosystem. And our scheme is the first large universe ABE scheme from lattices. In a large universe ABE system any string can be used as attribute and attributes need not be determined at system setup. This is a desirable feature. And the master private key of our scheme is too short too a matrix. Moreover, our scheme is high efficient due to the ciphertext of our scheme is divided into three parts. Finally, under Learning with Errors assumption, we prove our scheme is secure under the select attribute attack.