Large Universe Attribute-Based Encryption Scheme from Lattices

TL;DR

This paper introduces the first large universe attribute-based encryption scheme based on lattices, offering quantum resistance, efficiency, and flexible attribute usage, with security proven under the Learning with Errors assumption.

Contribution

It extends large universe ABE to lattice cryptography, providing a quantum-resistant, efficient scheme with short master keys and flexible attribute definitions.

Findings

Secure under Learning with Errors assumption

Master private key is a short matrix

Ciphertext divided into three parts for efficiency

Abstract

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.