A group-key-based sensitive attribute protection in cloud storage using modified random Fibonacci cryptography

Abstract

Cloud computing is an eminent technology for providing a data storage facility with efficient storage, maintenance, management and remote backups. Hence, user data are shifted from customary storage to cloud storage. In this transfer, the sensitive attributes are also shifted to cloud storage with high-end security. Current security techniques are processed with high encryption time and provide identical security of entire data with single key dependent. These processes are taking high computational time and leaks entire information if the key is hacked. The proposed Group Key Based Attribute Encryption using Modified Random Fibonacci Cryptographic (MRFC) technique rectifies these issues. Instead of machine learning technique, data owner preference-based attributes segregation is used to divide an input dataset into sensitive and nonsensitive attribute groups. Based on inter-organization usage and data owner's willingness, sensitive attribute is divided into 'n + 1′ subgroups and each subgroup is encrypted by 'n + 1' group keys. The encrypted sensitive subgroups are merged with non-sensitive attributes and uploaded into a private cloud. The novelties of this paper are, (1) data owner preferred sensitive attribute classification instead of machine learning algorithms, (2) sensitive attribute encryption instead of entire attributes, (3) To reduce encryption time without compromising data owner privacy, (4) To decrypt and access the required subgroup instead of the entire attribute. Our experimental results show that, the proposed method takes minimal processing time, better classification accuracy and minimal memory space with high security to selected attributes as compared to existing classification and security techniques. Hence, sensitive data security and privacy is achieved with minimal processing cost.

Privacy-Preserving Federated Transfer Learning for Driver Drowsiness Detection

“…Full homomorphic encryption is widely used in privacy protection that entrusts a third party to participate in information processing while protecting the local plaintext, i.e., computing the ciphertexts before decrypting is equivalent to executing the same operation on the plaintext after decrypting [31]. CKKS is a full homomorphic encryption method that adds noise at the end of the truncated ciphertext.…”

A Fast Text-to-Image Encryption-Decryption Algorithm for Secure Network Communication

“…Efficient and robust encryption should have a high sensitivity to its secret key, meaning that even slight changes in the secret key should result in totally different cipher images. Moreover, with a slightly changed key, the method must be impossible to decrypt a cipher image or obtain some plain text patterns [34][35][36][37][38][39]. This is particularly useful for defending against brute force attacks.…”

Cloud computing platform: Performance analysis of prominent cryptographic algorithms

“…Moreover, Brute force attacks on MD-5 hashes are fast, and MD-5 dictionary tables are big and have many collisions. 49 MD-5 algorithm was designed by Rivest 50 with three variants, that is, MD-2, 51 MD-4, 52 and MD5, all following almost the same structure. MD-2 is formulated basically for the 8 bit machines.…”

“…The weakness of MD‐5 algorithm is that it does not provide security over collision attacks. Moreover, Brute force attacks on MD‐5 hashes are fast, and MD‐5 dictionary tables are big and have many collisions 49 …”