Title | An Efficient Ciphertext Policy Attribute-Based Encryption Scheme from Lattices and Its Implementation |
Publication Type | Conference Paper |
Year of Publication | 2021 |
Authors | Qian, Xinyuan, Wu, Wenyuan |
Conference Name | 2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS) |
Keywords | access tree, attribute-based encryption, Ciphertext policy attribute-based encryption, Conferences, Encryption, Human Behavior, lattice-based cryptography, Lattices, M-LWE, Measurement, Numerical models, policy-based governance, pubcrawl, Resists, Scalability, wireless networks |
Abstract | Lattice-based Attribute-based encryption is a well-known cryptographic mechanism that can resist quantum attacks and has the ability of fine-grained access control, and it has a wide range of application scenarios in current Internet of Thing (IoT) era. However, lack of efficiency and existing the problem of large ciphertext expansion rate are the main disadvantages impede the applications of this mechanism. Thus, we propose an efficient and practical ciphertext policy attribute-based encryption (CP-ABE) scheme from lattices in the paper. In this scheme, to make the secret key reusable, we adjust access tree and propose a basic access tree structure, which can be converted from disjunctive normal form, and combine it with a light post-quantum scheme of Kyber. In addition, the compression method and plaintext expansion method are introduced to optimize the scheme. Our CP-ABE scheme is secure against chosen plaintext attack under the hardness of module learning with errors problem. We implement our scheme and compare it with three recent related schemes in terms of security, function and communication cost. Experiments and comparisons show that our CP-ABE scheme has advantages in high encryption efficiency, small matrix dimension, small key sizes, and low ciphertext expansion rate, which has some merit in practice. |
DOI | 10.1109/ICCCS52626.2021.9449182 |
Citation Key | qian_efficient_2021 |