A data structure encryption algorithm based on circular queue to enhance data security

Albu-Rghaif, Ali; Jassim, Abbood Kirebut; Abboud, Ali J.

doi:10.1109/isces.2018.8340522

Cited by 11 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is mainly used for text messages. The results of the proposed algorithm had given a 50% lower complexity when compared to Multiple Circular Queue Algorithm (MCQA) [25].…”

Section: Fibonacci Cryptographymentioning

confidence: 99%

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

Sumathi

Sangeetha

2020

Complex Intell. Syst.

View full text Add to dashboard Cite

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.

show abstract

“…This is mainly used for text messages. The results of the proposed algorithm had given a 50% lower complexity when compared to Multiple Circular Queue Algorithm (MCQA) [25].…”

Section: Fibonacci Cryptographymentioning

confidence: 99%

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

Sumathi

Sangeetha

2020

Complex Intell. Syst.

View full text Add to dashboard Cite

show abstract

“…Some low complexity algorithms based on circular shifting are available in some literature. A low complexity circular queue data structure security algorithm is developed in [25] by employing multiple complicating variable factors. A content‐based symmetric key algorithm is also available where a bitwise circular shift operation and folding method is employed to ensure the secrecy of the key [26].…”

Section: Data Security and Encryptionmentioning

confidence: 99%