Title: MultiPrime cloud-RSA: a fast homomorphic encryption scheme for data confidentiality protection in clouds

Authors: Khalid El Makkaoui; Abderrahim Beni-Hssane; Abdellah Ezzati

Addresses: LAVETE Laboratory, FST, Univ Hassan 1, B.P.: 577, 26000 Settat, Morocco ' LAROSERI Laboratory, Department of Computer Science, Sciences Faculty, Chouaïb Doukkali University, El Jadida, Morocco ' LAVETE Laboratory, FST, Univ Hassan 1, B.P.: 577, 26000 Settat, Morocco

Abstract: Concerns over data confidentiality are amongst the main barriers limiting the widespread adoption of cloud solutions. Indeed, scientists have invented a new promising form of encryption, homomorphic encryption (HE), which can be considered as a powerful tool to get over these concerns. Since cloud environments are more vulnerable to attacks and since cloud consumers frequently access to cloud computing services using light-weight devices, the HE schemes must be promoted, in terms of security level and running time, to operate efficiently. In El Makkaoui et al. (2017), we boosted the normal RSA cryptosystem at security level, cloud-RSA. In this paper, we suggest a new fast variant of the Cloud-RSA scheme, MultiPime cloud-RSA, to accelerate its decryption process. The variant uses a modulus of the form n = Π^k _i=1 p_i for k ≥ 2 and employs the Chinese remaindering to decrypt. Theoretical and simulation results show that the new variant offers a large decryption speed-up over the cloud-RSA scheme whilst maintaining a recommended security level.

Keywords: cloud-RSA scheme; cloud computing; confidentiality; multiplicative homomorphism; Chinese remainder theorem; CRT; fast decryption.

DOI: 10.1504/IJIE.2019.101128

International Journal of Intelligent Enterprise, 2019 Vol.6 No.2/3/4, pp.217 - 229

Received: 03 Jan 2018
Accepted: 25 Sep 2018
Published online: 24 Jul 2019 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article