Hybrid Algorithm for Symmetric Based Fully Homomorphic Encryption

Abstract
Fully Homomorphic Encryption (FHE) supports realistic computations on encrypted data and hence it is widely proposed to be used in cloud computing to protect the integrity and privacy of data stored in the cloud. The existing symmetric-based FHE schemes suffer from insecurity against known plaintext/ciphertext attacks and generate a large ciphertext size that required a large bandwidth to transfer the ciphertext over the network. To ameliorate these weaknesses is the aim of this paper. A hybrid algorithm for symmetric-based Fully Homomorphic Encryption that combines N-prime model and Matrix Operation for Randomization and Encryption with Secret Information Moduli Set (MORESIMS) is proposed. The results show that the proposed hybrid symmetric-based FHE framework satisfied homomorphism properties with robust inbuilt security that resists known plaintext, ciphertext and statistical attacks. The ciphertext size produced by the proposed hybrid framework is less than 4 times of its equivalent plaintext size with a considerable encryption execution time and fast decryption time. Thus, guaranteed to provide optimum performance and reliable solutions for securing integrity and privacy of user’s data in the cloud.
Description
Keywords
Citation