Name
Abstract | ||
|---|---|---|
Attribute-based encryption (ABE) is a standard method for achieving access control using cryptography, and is related to many other powerful primitives such as functional encryption. While classical pairing based ABE schemes support only boolean formulas as access policy, the first ABE scheme for arbitrary polynomial size circuits is given in [GVW13], and its security is based on LWE assumption. However, the GVW13 scheme is a key policy ABE (KP-ABE), and whether their method can be used to construct a ciphertext policy ABE (CP-ABE) scheme is currently unknown.In this paper, we present the first direct construction (not from universal circuits) of CP-ABE scheme for circuits. Similar to the two-to-one recoding technique used in GVW13, we introduce three-to-one recoding, and use it to construct our scheme, which can be proved for selective security assuming that LWE problem is hard, for arbitrary polynomial size circuits. Compared with universal circuit based constructions, our scheme is simpler and has lesser decryption cost. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/978-3-030-41579-2_22 | INFORMATION AND COMMUNICATIONS SECURITY (ICICS 2019) |
Keywords | DocType | Volume |
Ciphertext policy attribute-based encryption, ABE for circuits, LWE, Lattice-based cryptography | Conference | 11999 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 3 | |