Ensuring confidentiality and privacy of cloud data using a non-deterministic cryptographic scheme

Simple item page
dc.contributor.authorDawson, John Kwao
dc.contributor.authorTwum, Frimpong
dc.contributor.authorHayfron-Acquah, James Benjamin
dc.contributor.authorMissah, Yaw Marfo
dc.contributor.orcid0000-0002-7436-5550
dc.contributor.orcid0000-0002-1869-7542
dc.contributor.orcid0000-0001-6935-9431
dc.contributor.orcid0000-0002-2926-681X
dc.date.accessioned2023-12-06T14:39:39Z
dc.date.available2023-12-06T14:39:39Z
dc.date.issued2023-02-09
dc.descriptionAn article published by Dawson JK, Twum F, Hayfron Acquah JB, Missah YM (2023) Ensuring confidentiality and privacy of cloud data using a non-deterministic cryptographic scheme. PLoS ONE 18(2): e0274628. https://doi.org/10.1371/journal.pone.0274628
dc.description.abstractThe amount of data generated by electronic systems through e-commerce, social networks, and data computation has risen. However, the security of data has always been a challenge.The problem is not with the quantity of data but how to secure the data by ensuring its confi dentiality and privacy. Though there are several research on cloud data security, this study proposes a security scheme with the lowest execution time. The approach employs a non linear time complexity to achieve data confidentiality and privacy. A symmetric algorithm dubbed the Non-Deterministic Cryptographic Scheme (NCS) is proposed to address the increased execution time of existing cryptographic schemes. NCS has linear time complex ity with a low and unpredicted trend of execution times. It achieves confidentiality and pri vacy of data on the cloud by converting the plaintext into Ciphertext with a small number of iterations thereby decreasing the execution time but with high security. The algorithm is based on Good Prime Numbers, Linear Congruential Generator (LGC), Sliding Window Algorithm (SWA), and XOR gate. For the implementation in C#, thirty different execution times were performed and their average was taken. A comparative analysis of the NCS was performed against AES, DES, and RSA algorithms based on key sizes of 128kb, 256kb, and 512kb using the dataset from Kaggle. The results showed the proposed NCS execution times were lower in comparison to AES, which had better execution time than DES with RSA having the longest. Contrary, to existing knowledge that execution time is relative to data size, the results obtained from the experiment indicated otherwise for the proposed NCS algorithm. With data sizes of 128kb, 256kb, and 512kb, the execution times in milliseconds were 38, 711, and 378 respectively. This validates the NCS as a Non-Deterministic Cryptographic Algorithm. The study findings hence are in support of the argument that data size does not determine the execution time of a cryptographic algorithm but rather the size of the security key.
dc.description.sponsorshipKNUST
dc.identifier.citationDawson JK, Twum F, Hayfron Acquah JB, Missah YM (2023) Ensuring confidentiality and privacy of cloud data using a non-deterministic cryptographic scheme. PLoS ONE 18(2): e0274628. https://doi.org/10.1371/journal. pone.0274628
dc.identifier.urihttps://doi.org/10.1371/journal.pone.0274628
dc.identifier.urihttps://ir.knust.edu.gh/handle/123456789/14675
dc.language.isoen
dc.publisherPLOS One
dc.titleEnsuring confidentiality and privacy of cloud data using a non-deterministic cryptographic scheme
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
journal.pone.0274628.pdf
Size:
3.35 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description:
Download
Collections
Articles