Efficient Attribute-Based Encryption from R-LWE  

作　　者：ZHU Weiling YU Jianping WANG Ting ZHANG Peng XIE Weixin 

机构地区：[1]ATR Key Laboratory of National Defense Technology, Shenzhen University

出　　处：《Chinese Journal of Electronics》2014年第4期778-782,共5页电子学报（英文版）

基　　金：supported by the National Natural Science Foundation of China(No.61171072,No.61001058);the Science&Technology Projects of Shenzhen(No.CXB201104210002A)

摘　　要：Attribute-based encryption(ABE) has been an active research area in cryptography due to its attractive applications. But almost all attribute-based encryption schemes are based on bilinear maps, which leave them vulnerable to quantum cryptanalysis. The latticebased ABE schemes from the Learning with errors(LWE)have appeared, but they are not efficient enough for practical applications. Thus we propose an efficient attributebased encryption based on the Learning with errors over Rings(R-LWE), which is called ABE R-LWE. The security analysis shows that ABE R-LWE scheme is secure in the selective-set model under the R-LWE assumption, whose security can reduce to the hardness of the shortest vector problem in the worst case on ideal lattices. The efficiency analysis indicates that ABE R-LWE is more efficient than previous ABE cryptosystems on lattices.Attribute-based encryption （ABE） has been an active research area in cryptography due to its attractive applications. But almost all attribute-based encryption schemes are based on bilinear maps, which leave them vulnerable to quantum cryptanalysis. The latticebased ABE schemes from the Learning with errors （LWE） have appeared, but they are not efficient enough for prac- tical applications. Thus we propose an efficient attribute- based encryption based on the Learning with errors over Rings （R-LWE）, which is called ABER-LWE. The security analysis shows that ABER-LWE scheme is secure in the selective-set model under the R-LWE assumption, whose security can reduce to the hardness of the shortest vector problem in the worst case on ideal lattices. The efficiency analysis indicates that ABER-LWE is more efficient than previous ABE cryptosystems on lattices.

关 键 词：Attribute-based encryption LATTICE R- LWE. 

分 类 号：TN918.4[电子电信—通信与信息系统]