Systems Engineering and Electronics ›› 2025, Vol. 47 ›› Issue (4): 1364-1373.doi: 10.12305/j.issn.1001-506X.2025.04.33

• Communications and Networks • Previous Articles     Next Articles

Efficient and revocable ciphertext-policy attribute-based encryption scheme on lattice

Meixian JIANG1, Juntao GAO1,*, Tao PEI2,3   

  1. 1. School of Telecommunication and Engineering, Xidian University, Xi'an 710071, China
    2. Wuhan Maritime Communication Research Institute, Wuhan 430205, China
    3. School of Cyber Science and Engineering, Wuhan University, Wuhan 430072, China
  • Received:2024-03-12 Online:2025-04-25 Published:2025-05-28
  • Contact: Juntao GAO

Abstract:

To address the problems existing in attribute-based encryption schemes on lattice such as low computational efficiency, inflexible access policy expression, and lack of revocation, an efficient and revocable ciphertext-policy attribute-based encryption scheme on lattice is proposed. It uses small policy matrices and higher base sampling algorithms under the ring learning with errors assumption to reduce cumulative errors and improve computational efficiency of the proposed scheme. By integrating linear secret sharing and the ring learning with errors assumption, flexible and efficient access policy expression is achieved. Additionally, by adding direct revocation to the access policy, the proposed scheme not only has efficient expression, but also has the user revocation function. The proposed scheme can resist the chosen plaintext attack under the ring learning with errors assumption. The simulation results show the effectiveness and practicability of the proposed scheme.

Key words: attribute-based encryption, linear secret sharing, user revocation, ring learning with errors, small policy matrix

CLC Number: 

[an error occurred while processing this directive]