Industries have embraced cloud computing for their daily operations due to the volume of data they create. As data generation and consumption have increased, the challenges and opportunities have also increased. Researchers have proposed various cryptographic schemes to secure data on the cloud. Regardless of the multiple cryptographic schemes proposed, security remains an obstacle to cloud computing’s widespread adoption. Also, these cryptographic schemes’ run times are proportional to data sizes, motivating excessive CPU engagement during execution of huge data, which has consequences for the need for high bandwidth to transfer data to the cloud. This systematic review tries to uncover the most often used cryptographic schemes and their run time trends to attain confidentiality and privacy of cloud data. The study considered published articles from well-known databases such as Taylor & Francis, Scopus, Research Gate, Web of Science, IEEE Xplore, Science Direct, Hindawi, Google Scholar, Sage, Emerald, Wiley Online Library, and ACM from 2016 to 2022. The Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) guidelines were used to select 73 published works for this study using keyword searching. Data security and cloud security were the security challenges that received the greatest attention in the study with encryption techniques as the most common solution. From the study, 90% of the schemes used to secure data on the cloud produced linear run times. The investigation discovered that nonlinear symmetric stream cipher methods were infrequently employed to protect the secrecy and privacy of cloud data.
The 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 confidentiality 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 complexity with a low and unpredicted trend of execution times. It achieves confidentiality and privacy 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.
The cloud is becoming a hub for sensitive data as technology develops, making it increasingly vulnerable, especially as more people get access. Data should be protected and secured since a larger number of individuals utilize the cloud for a variety of purposes. Confidentiality and privacy of data is attained through the use of cryptographic techniques. While each cryptographic method completes the same objective, they all employ different amounts of CPU, memory, throughput, encryption, and decryption times. It is necessary to contrast the various possibilities in order to choose the optimal cryptographic algorithm. An integrated data size of 5n*102 (KB (∈ 1,2,4,10,20,40) is evaluated in this article. Performance metrics including run time, memory use, and throughput time were used in the comparison. To determine the effectiveness of each cryptographic technique, the data sizes were run fifteen (15) times, and the mean simulation results were then reported. In terms of run time trend, NCS is superior to the other algorithms according to Friedman’s test and Bonferroni’s Post Hoc test.
12 February 2024 in Journal of Cyber Security and Mobility
Due to the recent explosion in the amount of data being created by various social media platforms, e-commerce websites, and other businesses, a paradigm shift from on-site data centers to the cloud is required. Concerns about privacy and secrecy have been a major obstacle to the mainstream adoption of cloud computing. The best approach to protect the confidentiality and privacy of cloud data is by using cryptographic techniques. Researchers have developed several cryptographic algorithms, but they all have lengthy, linear, predictable, memory-intensive execution times. The performance of the CPU, memory, run-time trend, and throughput of the three cryptographic schemes: Enhanced RSA (ERSA), Non-Deterministic Cryptographic Scheme (NCS), and Enhanced Homomorphic Scheme (EHS) are compared using RAsys. The experiment’s results demonstrated that NCS and EHS produced non-linear and non-deterministic run times. Again, NCS and EHS produced the lowest throughput and memory consumption for text and numeric data types when data sizes of 5n*102(KB(∈1,2,4,10,20,40) were processed. However, ERSA produced a run-time trend that was deterministic, linear, and predictable
Cloud computing alludes to the on-demand availability of personal computer framework resources, primarily information storage and processing power, without the customer’s direct personal involvement. Cloud computing has developed dramatically among many organizations due to its benefits such as cost savings, resource pooling, broad network access, and ease of management; nonetheless, security has been a major concern. Researchers have proposed several cryptographic methods to offer cloud data security; however, their execution times are linear and longer. A Security Key 4 Optimization Algorithm (SK4OA) with a non-linear run time is proposed in this paper. The secret key of SK4OA determines the run time rather than the size of the data as such is able to transmit large volumes of data with minimal bandwidth and able to resist security attacks like brute force since its execution timings are unpredictable. A data set from Kaggle was used to determine the algorithm’s mean and standard deviation after thirty (30) times of execution. Data sizes of 3KB, 5KB, 8KB, 12KB, and 16 KB were used in this study. There was an empirical analysis done against RC4, Salsa20, and Chacha20 based on encryption time, decryption time, throughput and memory utilization. The analysis showed that SK4OA generated lowest mean non-linear run time of 5.545±2.785 when 16KB of data was executed. Additionally, SK4OA’s standard deviation was greater, indicating that the observed data varied far from the mean. However, RC4, Salsa20, and Chacha20 showed smaller standard deviations making them more clustered around the mean resulting in predictable run times.
Data security is a crucial concern that ought to be managed to help protect vital data. Cryptography is one of the conventional approaches for securing data and is generally considered a fundamental data security component that provides privacy, integrity, confidentiality, and authentication. In this paper, a hybrid data security algorithm is proposed by integrating traditional RSA and Gaussian Interpolation formulas. The integration raises the security strength of RSA to the fifth degree. The Gaussian First Forward Interpolation is used to encrypt the ASCII values of the message after which the traditional RSA is used to encrypt and decrypt the message in the second and third levels. The last stage employs Gaussian Backward Interpolation to decrypt the data again. The integration helps to cater to the factorization problem of the traditional RSA. Comparative analysis was performed using four different algorithms; RSA, SRNN, 2-Key pair algorithms, and the proposed algorithm. It is proven that when the data size is small the encryption and decryption times are lower for the proposed algorithm but higher when the data size is big.