Visible to the public A Noise-Free Homomorphic Encryption based on Chaotic System

TitleA Noise-Free Homomorphic Encryption based on Chaotic System
Publication TypeConference Paper
Year of Publication2020
AuthorsMahmood, Z. H., Ibrahem, M. K.
Conference Name2020 1st. Information Technology To Enhance e-learning and Other Application (IT-ELA
Keywordschaotic system, cloud computing, Correlation, cryptography, data privacy, EMORE, EMORE algorithm, encrypted data, Encryption, encryption-decryption time, enhanced matrix operation, FHE, floating-point number, fully homomorphic encryption, homomorphic encryption, homomorphism property, human factors, Metrics, modular arithmetic operation, Noise Free, noise-free algorithm, noise-free homomorphic encryption, outsourced data computing, outsourcing, positive randomness properties, pubcrawl, reliability, reliable cloud computing environment, reliable encryption, research topics, Resiliency, Scalability, secure Cloud computing environment, secure encryption, security analysis, Sensitivity, symmetric algorithm, Symmetric matrices
AbstractFully homomorphic encryption (FHE) was one of the most prominent research topics of the last ten years. And it is considered as a major cryptographic tool in a secure and reliable cloud computing environment. The reason behind that because it allows computations over encrypted data, without decrypting the original message. This paper developed a new symmetric (FHE) algorithm based on Enhanced Matrix Operation for Randomization and Encryption (EMORE) algorithm using a chaotic system. The proposed algorithm was considered a noise-free algorithm. It generates the ciphertext in a floating-point number's format, overcomes the problem of plaintext ring and modular arithmetic operation in EMORE by the hardness of a chaotic system, and provides another level of security in terms of randomness properties, sensitivity to the initial condition, and large key size (\textbackslashtextgreater2100) of a chaotic system. Besides that, the proposed algorithm provides the confidentiality and privacy of outsourced data computing through homomorphism property of it. By using both numerical and statistical tests, these tests proved that the proposed algorithm has positive randomness properties and provide secure and reliable encryption (through encryption-decryption time, key sensitivity, keyspace, and correlation). Finally, the simulation results show that the execution time of the proposed algorithm is faster about 7.85 times than the EMORE algorithm.
Citation Keymahmood_noise-free_2020