Efficient Attribute-Based Encryption from R-LWE

Abstract

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 lattice-based ABE schemes from the Learning with errors (LWE) have appeared, but they are not efficient enough for practical applications. Thus we propose an efficient attribute-based encryption based on the Learning with errors over Rings (R-LWE), which is called ABE<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R-LWE</inf>. The security analysis shows that ABE<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R-LWE</inf> 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<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R-LWE</inf> is more efficient than previous ABE cryptosystems on lattices.