An increased use of data driven applications and integrated systems have caused an accelerating expansion in data volumes and increase in the number of digital records, over the past few decades. Exponentially growing data volumes being processed by large-scale distributed data-intensive applications have placed an increasing pressure on the underlying storage services for timely and efficient storage and retrieval of the data. The use of cloud storage is among the best strategies to efficiently store growing volumes of data. However, outsourcing data to public cloud storage leads to the challenge of data confidentiality preservation. Data Confidentiality is among the top challenges associated with cloud storage which have contributed substantially as an inhibitor for cloud computing adoption all over the world and is considered a serious concern, especially in case of big data, where securing data in a timely and accurate manner is an arduous task. Our study aims to contribute in anti-cybercrime by protecting the confidentiality of sensitive growing data. We enunciate an optimized confidentially preserving framework on distributed cloud storage, that works for growing data with time-efficiency and minimum memory usage. Our framework uses a merger of Genetic Algorithm (GA), parallel data distribution, and privacy-aware selective encryption techniques. The experiments and comparative analysis depict that our proposed framework outperforms others under consideration, in terms of execution time, memory usage and network throughput respectively.

Privacy-aware genetic algorithm based data security framework for distributed cloud storage / Kamal, Maryam; Amin, Shahzad; Ferooz, Faria; Javed Awan, Mazhar; Abed Mohammed, Mazin; Al-Boridi, Omar; Hameed Abdulkareem, Karrar. - 94:(2022). [10.1016/j.micpro.2022.104673]

Privacy-aware genetic algorithm based data security framework for distributed cloud storage

Maryam Kamal;
2022

Abstract

An increased use of data driven applications and integrated systems have caused an accelerating expansion in data volumes and increase in the number of digital records, over the past few decades. Exponentially growing data volumes being processed by large-scale distributed data-intensive applications have placed an increasing pressure on the underlying storage services for timely and efficient storage and retrieval of the data. The use of cloud storage is among the best strategies to efficiently store growing volumes of data. However, outsourcing data to public cloud storage leads to the challenge of data confidentiality preservation. Data Confidentiality is among the top challenges associated with cloud storage which have contributed substantially as an inhibitor for cloud computing adoption all over the world and is considered a serious concern, especially in case of big data, where securing data in a timely and accurate manner is an arduous task. Our study aims to contribute in anti-cybercrime by protecting the confidentiality of sensitive growing data. We enunciate an optimized confidentially preserving framework on distributed cloud storage, that works for growing data with time-efficiency and minimum memory usage. Our framework uses a merger of Genetic Algorithm (GA), parallel data distribution, and privacy-aware selective encryption techniques. The experiments and comparative analysis depict that our proposed framework outperforms others under consideration, in terms of execution time, memory usage and network throughput respectively.
2022
cloud computing; distributed cloud storage; data confidentially; intelligence genetic algorithm; parallel distribution; optimization; cryptographic framework
01 Pubblicazione su rivista::01a Articolo in rivista
Privacy-aware genetic algorithm based data security framework for distributed cloud storage / Kamal, Maryam; Amin, Shahzad; Ferooz, Faria; Javed Awan, Mazhar; Abed Mohammed, Mazin; Al-Boridi, Omar; Hameed Abdulkareem, Karrar. - 94:(2022). [10.1016/j.micpro.2022.104673]
File allegati a questo prodotto
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1654529
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 11
  • ???jsp.display-item.citation.isi??? 7
social impact