Open Access iconOpen Access

ARTICLE

crossmark

Repeated Attribute Optimization for Big Data Encryption

Abdalla Alameen*

Department of Computer Science, College of Arts and Sciences, Prince Sattam Bin Abdulaziz University, Al-Kharj, Saudi Arabia

* Corresponding Author: Abdalla Alameen. Email: email

Computer Systems Science and Engineering 2022, 40(1), 53-64. https://doi.org/10.32604/csse.2022.017597

Abstract

Big data denotes the variety, velocity, and massive volume of data. Existing databases are unsuitable to store big data owing to its high volume. Cloud computing is an optimal solution to process and store big data. However, the significant issue lies in handling access control and privacy, wherein the data should be encrypted and unauthorized user access must be restricted through efficient access control. Attribute-based encryption (ABE) permits users to encrypt and decrypt data. However, for the policy to work in practical scenarios, the attributes must be repeated. In the case of specific policies, it is not possible to avoid attribute repetition even after the application of Boolean optimization approaches to obtain a Boolean formula. For these policies, there exists a variety of evaluated secret shares for the repeated attributes. Therefore, the calculation of cipher text for these irreducible policies seems to be lengthy and computationally intensive. To address this problem, an improved meta-heuristic-based repeated attributes optimization on cipher-text policy-ABE (CP-ABE) is developed in this study. Here, the improved meta-heuristic concept is developed in the encryption phase, which returns the optimized single share value of each repeated attribute after considering all the attribute shares. The optimization process not only minimizes the encryption cost but also the communication cost. Herein, the improved sun flower optimization (SFO), called the newly updated SFO (NU-SFO) is used to perform the repeated attribute optimization in CP-ABE. Finally, the performance evaluation confirms the reliability and robustness of the developed scheme through comparisons with traditional constructions.

Keywords


Cite This Article

APA Style
Alameen, A. (2022). Repeated attribute optimization for big data encryption. Computer Systems Science and Engineering, 40(1), 53-64. https://doi.org/10.32604/csse.2022.017597
Vancouver Style
Alameen A. Repeated attribute optimization for big data encryption. Comput Syst Sci Eng. 2022;40(1):53-64 https://doi.org/10.32604/csse.2022.017597
IEEE Style
A. Alameen, "Repeated Attribute Optimization for Big Data Encryption," Comput. Syst. Sci. Eng., vol. 40, no. 1, pp. 53-64. 2022. https://doi.org/10.32604/csse.2022.017597



cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2044

    View

  • 1129

    Download

  • 1

    Like

Share Link