Survey of Post-Quantum Lattice-Based Ciphertext-Policy Attribute-Based Encryption Schemes for Cloud Storage: Taxonomy, Open Issues, and Future Directions

Ciphertext Policy Attribute-Based Encryption (CP-ABE) is one of the most prevalent cryptographic primitives for realizing privacy and fine-grained access control in cloud computing. However, most of the existing CP-ABE schemes constructed using Paring-Based Cryptography (PBC) from Discrete Logarithm Problem (DLP) or Diffie Hellman Problem (DHP) assumptions are susceptible to quantum attacks, whereas CP-ABE schemes constructed using lattice-based cryptography based on Learning with Errors (LWE) and Ring-LWE (R-LWE) assumptions are quantum-safe and ensure fine-grained access control. This paper comprehensively surveys the existing Lattice-based CP-ABE (LCP-ABE) schemes based on LWE and R-LWE assumptions. Further, this paper analyzes and compares the security and performance features of existing LCP-ABE schemes. Finally, this paper identifies the open issues and future directions that need further investigation on LCP-ABE schemes.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Services Computing
Published
2024-10-14
DOI
https://doi.org/10.1109/tsc.2024.3479930
Citations
16
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
5.56
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Survey of Post-Quantum Lattice-Based Ciphertext-Policy Attribute-Based Encryption Schemes for Cloud Storage: Taxonomy, Open Issues, and Future Directions

G. Sravya, Syam Kumar Pasupuleti, R. Padmavathy
16 citations
IEEE Transactions on Services Computing
Cryptography and Data Security
5.56
article

Survey of Post-Quantum Lattice-Based Ciphertext-Policy Attribute-Based Encryption Schemes for Cloud Storage: Taxonomy, Open Issues, and Future Directions

G. Sravya, Syam Kumar Pasupuleti, R. Padmavathy
article en
16 citations

Abstract

Ciphertext Policy Attribute-Based Encryption (CP-ABE) is one of the most prevalent cryptographic primitives for realizing privacy and fine-grained access control in cloud computing. However, most of the existing CP-ABE schemes constructed using Paring-Based Cryptography (PBC) from Discrete Logarithm Problem (DLP) or Diffie Hellman Problem (DHP) assumptions are susceptible to quantum attacks, whereas CP-ABE schemes constructed using lattice-based cryptography based on Learning with Errors (LWE) and Ring-LWE (R-LWE) assumptions are quantum-safe and ensure fine-grained access control. This paper comprehensively surveys the existing Lattice-based CP-ABE (LCP-ABE) schemes based on LWE and R-LWE assumptions. Further, this paper analyzes and compares the security and performance features of existing LCP-ABE schemes. Finally, this paper identifies the open issues and future directions that need further investigation on LCP-ABE schemes.

IEEE Transactions on Services ComputingVol. 17(6)
National Institute of Technology Warangal (IN), Institute for Development and Research in Banking Technology (IN)
Partnerships for the goals
Openalex Percentile: Top 4%
Cryptography and Data Security
5.56
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Survey of Post-Quantum Lattice-Based Ciphertext-Policy Attribute-Based Encryption Schemes for Cloud Storage: Taxonomy, Open Issues, and Future Directions — G. Sravya, Syam Kumar Pasupuleti, et al. · IEEE Transactions on Services Computing (2024) | TGRS Research Map | TGRS