Speedy Cloud-RSA homomorphic scheme for preserving data confidentiality in cloud computing

Homomorphic encryption (HE) technique provides a third party with the ability to execute operations on ciphertexts. This property can be considered as a good solution to overcome some barriers limiting the widespread adoption of cloud services. However, since cloud environments are more threatened b...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of ambient intelligence and humanized computing Ročník 10; číslo 12; s. 4629 - 4640
Hlavní autoři: El Makkaoui, Khalid, Beni-Hssane, Abderrahim, Ezzati, Abdellah
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2019
Springer Nature B.V
Témata:
Algorithms
Artificial Intelligence
Cloud computing
Computational Intelligence
Confidentiality
Consumers
Cybersecurity
Digital signatures
Encryption
Engineering
Original Research
Robotics and Automation
Semantics
User Interfaces and Human Computer Interaction
Fast decryption
Cloud computing
Homomorphic encryption (HE)
Chinese remainder theorem (CRT)
Hensel lifting
Confidentiality
ISSN:1868-5137, 1868-5145
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Homomorphic encryption (HE) technique provides a third party with the ability to execute operations on ciphertexts. This property can be considered as a good solution to overcome some barriers limiting the widespread adoption of cloud services. However, since cloud environments are more threatened by security attacks and since cloud consumers often access to cloud services using resource-constrained devices, the HE schemes have to be promoted at security level and at running time to work efficiently. In El Makkaoui et al. (Cloud-RSA: an enhanced homomorphic encryption scheme. In: Rocha A, Serrhini M, Felgueiras C (eds) Europe and MENA cooperation advances in information and communication technologies. Advances in intelligent systems and computing, vol 520. Springer, Cham, pp 471–480, 2017b ), we boosted RSA scheme at security level, Cloud-RSA. In this paper, we suggest two variants of Cloud-RSA scheme in order to speed up its decryption process. The variants are based on modifying the form of Cloud-RSA modulus and exponents. The first variant uses a modulus formed of two or more distinct primes and employs the Chinese remainder theorem (CRT) to encrypt and decrypt. Whereas, the second variant uses a modulus of the form n = p r q s for r ≥ 2 and s ≥ 1 , and applies the Hensel lifting and the CRT to decrypt. Theoretical and simulation results show that the proposed variants provide a large decryption speedup over Cloud-RSA.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1868-5137
1868-5145
DOI:10.1007/s12652-018-0844-x