Cloud-ElGamal and Fast Cloud-RSA Homomorphic Schemes for Protecting Data Confidentiality in Cloud Computing
- 1 July 2019
- journal article
- research article
- Published by IGI Global Scientific Publishing in International Journal of Digital Crime and Forensics
- Vol. 11 (3) , 90-102
Abstract
Homomorphic encryption (HE) is an encryption form that offers a third-party with the ability to carry out computations on encrypted data. This property can be considered as a great solution to get over some obstacles limiting the wide-spread adoption of cloud computing (CC) services. Since CC environments are threatened by insider/outsider security attacks and since CC consumers often access to CC services using resource-limited devices, the HE schemes need to be promoted at security level and at running time to work effectively. For this reason, at EMENA-TSSL'16 and at WINCOM'16, the authors respectively boosted the RSA and ElGamal cryptosystems at security level, Cloud-RSA and Cloud-ElGamal. At SCAMS'17 and at EUSPN'17, the authors then suggested two fast variants of the Cloud-RSA scheme. All proposed schemes support the multiplicative homomorphism (MH) over the integers. The aim of this article is to compare the Cloud-ElGamal scheme with the Cloud-RSA schemes. This article first briefly presents the HE schemes and analyzes their security. This article then implements the schemes, compare and discuss their efficiency.Keywords
This publication has 20 references indexed in Scilit:
- A comprehensive meta-analysis of cryptographic security mechanisms for cloud computingJournal of Ambient Intelligence and Humanized Computing, 2016
- Factoring $N=p^rq^s$ for Large r and s2016
- Public key encryption secure against related-key attacks and key-leakage attacks from extractable hash proofsJournal of Ambient Intelligence and Humanized Computing, 2015
- Batch Fully Homomorphic Encryption over the Integers2013
- Fully homomorphic encryption using ideal lattices2009
- A New Baby-Step Giant-Step Algorithm and Some Applications to CryptanalysisLecture Notes in Computer Science, 2005
- The number field sieve1993
- Factoring Integers with Elliptic CurvesAnnals of Mathematics, 1987
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978