An Efficient Ciphertext Policy Attribute-Based Encryption Scheme from Lattices and Its Implementation

Qian, Xinyuan; Wu, Wenyuan

doi:10.1109/icccs52626.2021.9449182

Cited by 4 publications

(7 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Data owners are given the right to control the authorized users who are able to decrypt the data. Chandrasekaran and Balakrishnan [67] suggested an ABE scheme for big data technology in the cloud; however, their scheme is constructed based on attribute union and quadratic residue with a fundamental arithmetic theorem. The scheme is said to be efficient because the probability for a set of user attribute to occur as a squared value is lower.…”

Section: Ongoing Challenges and Future Suggestionsmentioning

confidence: 99%

“…Affum et al [65] studied the R-LWE-based CP-ABE scheme to support a 5G content-centric network. Qian and Wu [67] enhanced tree structure by proposing a basic access tree (BAT) to express any disjunctive normal form (DNF). Varri et al [68] extended CP-ABE to searchability over encrypted data; however, their scheme is constructed from the overhead LWE problem.…”

mentioning

confidence: 99%

“…Similar to KP-ABE, recent quantum-resistant CP-ABE schemes are mainly constructed based on lattice-based cryptography. The hardness assumption of the quantum-resistant CP-ABE schemes [33,[54][55][56][57][58][59][60][61][62][63][64][65][66][67][68] is from average-case to worst-case problems. In order to solve the inefficiency of LWE due to the inherent quadratic overhead problem, R-LWE is implemented in some of the schemes [58][59][60][61]63,65,66] to reduce the computation cost and transaction bandwidth.…”

mentioning

confidence: 99%

“…In order to solve the inefficiency of LWE due to the inherent quadratic overhead problem, R-LWE is implemented in some of the schemes [58][59][60][61]63,65,66] to reduce the computation cost and transaction bandwidth. Like KP-ABE schemes, most CP-ABE schemes [33,54,[56][57][58][59][60][61][63][64][65][66][67][68] only analyzed their threat model secure against the selective approach and proven IND-CPA secure. Only Wang [55] and Tsabary [62] CP-ABE schemes were tested under the adaptive model to achieve IND-CCA.…”

mentioning

confidence: 99%

“…Efficient quantum-resistant ABE schemes without lattice-based cryptography. Recent quantum-resistant KP-ABE schemes [41][42][43][44][45][46][47][48][49][50][51] and CP-ABE schemes [33,[54][55][56][57][58][59][60][61][62][63][64][65][66][67][68] are primarily constructed based on lattice-based cryptography. While lattice-based cryptography has only been secured in the inefficiency of large dimensions, it is intriguing to further investigate whether a practical quantum-resistant ABE scheme may be built from other quantum algorithms, such as supersingular elliptic curve isogeny or multivariate approach.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Attribute-Based Encryption in Securing Big Data from Post-Quantum Perspective: A Survey

2022

View full text Add to dashboard Cite

Attribute-based encryption (ABE) cryptography is widely known for its potential to solve the scalability issue of recent public key infrastructure (PKI). It provides a fine-grained access control system with high flexibility and efficiency by labeling the secret key and ciphertext with distinctive attributes. Due to its fine-grained features, the ABE scheme is a protection layer in securing users’ data and privacy in big data processing and analytics. However, quantum computing, new technology on the horizon that will transform the security and privacy environment, has begun to appear. Like the conventional ABE schemes, present cryptography is not excluded from the impacts of quantum technology as they are not made to be quantum-resistant. While most recent surveys generally touched on the generic features of attribute-based encryption schemes such as user revocation, scalability, flexibility, data confidentiality, and scope in pairing-based ABE schemes, this survey investigated quantum-resistant ABE schemes in securing big data. This survey reviews the challenges faced by the recent ABE cryptography in the post-quantum era and highlights its differences from the conventional pairing-based ABE schemes. Subsequently, we defined the criteria of an ideal quantum-resistant ABE scheme. Additionally, existing works on quantum-resistant ABE schemes are reviewed based on their algorithms design, security and functionalities. Lastly, we summarized quantum-resistant ABE schemes’ ongoing challenges and future works.

show abstract

Section: Ongoing Challenges and Future Suggestionsmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

Attribute-Based Encryption in Securing Big Data from Post-Quantum Perspective: A Survey

2022

View full text Add to dashboard Cite

show abstract

Lattice‐Based CP‐ABE Access Control for SDS Constraint with Lazy Assignment of Attributes and Attribute Revocation

Guo,

Abduxkur,

Helil

2024

IET Information Security

View full text Add to dashboard Cite

Ciphertext‐policy attribute‐based encryption (CP‐ABE) is a cryptographic scheme suitable for secure data sharing on cloud storage. The CP‐ABE based on lattice theory has the property of resisting quantum attack. Some data objects uploaded to the cloud by the same data owner may cause conflicts of interest, or their combination may expose sensitive information. This paper proposes a revocable CP‐ABE scheme on the lattice, based on ring learning with error (R‐LWE) problem, to enforce access control constraints on user access to such data objects. In this scheme, first, the access policies of such data objects are amended by adding dummy attributes. Second, we control the secret key components associated with the dummy attributes or revoke the dummy attributes to prevent users from continuously accessing specific parts or all data objects from this kind of data set. Finally, we carry on the efficiency and security analysis of the scheme. The analysis results show that the scheme is efficient and safe.

show abstract

A Fine-Grained Data Encryption Scheme Based on Shortest Vector Problem in the Cloud Computing Environment

Yang,

Jiang

2023

2023 8th International Conference on Signal and Image Processing (ICSIP)

View full text Add to dashboard Cite

An Efficient Ciphertext Policy Attribute-Based Encryption Scheme from Lattices and Its Implementation

Cited by 4 publications

References 26 publications

Attribute-Based Encryption in Securing Big Data from Post-Quantum Perspective: A Survey

Attribute-Based Encryption in Securing Big Data from Post-Quantum Perspective: A Survey

Lattice‐Based CP‐ABE Access Control for SDS Constraint with Lazy Assignment of Attributes and Attribute Revocation

A Fine-Grained Data Encryption Scheme Based on Shortest Vector Problem in the Cloud Computing Environment

Contact Info

Product

Resources

About