Advertisement

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

  • Khalid El MakkaouiEmail author
  • Abderrahim Beni-Hssane
  • Abdellah Ezzati
Original Research

Abstract

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^rq^s\) for \(r\ge 2\) and \(s \ge 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.

Keywords

Cloud computing Confidentiality Homomorphic encryption (HE) Fast decryption Chinese remainder theorem (CRT) Hensel lifting 

Notes

Acknowledgements

We would like to acknowledge professor MIFDAL Mohamed from Chou-aïb Doukkali University for the proofreading of this research work and the anonymous reviewers for their helpful comments.

References

  1. Alam M, Emmanuel N, Khan T et al (2017) Garbled role-based access control in the cloud. J Ambient Intell Hum Comput.  https://doi.org/10.1007/s12652-017-0573-6 CrossRefGoogle Scholar
  2. Armbrust M, Fox A, Griffith R et al (2009) Above the clouds: a Berkeley view of cloud computing, UC Berkeley Technical ReportGoogle Scholar
  3. Bennasar H, Bendahmane A, Essaaidi M (2017) An overview of the state-of-the-art of cloud computing cyber-security. In: El Hajji S, Nitaj A, Souidi E (eds) Codes, cryptology and information security. Lecture Notes in Computer Science, vol 10194. Springer, Cham, pp 56–67CrossRefGoogle Scholar
  4. Bleichenbacher D, May A (2006) New attacks on RSA with small secret CRT-exponents. In: Yung M et al (eds) Public key cryptography-PKC 2006. Lecture Notes in Computer Science, vol 3958. Springer, Berlin, pp 1–13Google Scholar
  5. Boneh D, Durfee G (2000) Cryptanalysis of RSA with private key \(d\) less than \(N^{0.292}\). IEEE Trans Inf Theory 46:1339–1349.  https://doi.org/10.1109/18.850673 CrossRefzbMATHGoogle Scholar
  6. Boneh D, Shacham H (2002) Fast variants of RSA. CryptoBytes 5:1–9Google Scholar
  7. Cheon JH et al (2013) Batch fully homomorphic encryption over the integers. In: Johansson T, Nguyen PQ (eds) Advances in cryptology-EUROCRYPT 2013. Lecture Notes in Computer Science, vol 7881. Springer, Berlin, pp 315–335CrossRefGoogle Scholar
  8. Collins T, Hopkins D, Langford S et al (1997) Public key cryptographic apparatus and method. US Patent 5,848,159Google Scholar
  9. El Makkaoui K, Beni-Hssane A, Ezzati A (2016) Cloud-ElGamal: an efficient homomorphic encryption scheme. In: 2016 International conference on wireless networks and mobile communications, WINCOM 2016, pp 63–66Google Scholar
  10. El Makkaoui K, Beni-Hssane A, Ezzati A et al (2017) Fast Cloud-RSA scheme for promoting data confidentiality in the cloud computing. Proc Comput Sci 113:33–40CrossRefGoogle Scholar
  11. El Makkaoui K, Ezzati A, Beni-Hssane A (2016) Securely adapt a Paillier encryption scheme to protect the data confidentiality in the cloud environment. In: 2016 International conference on big data and advanced wireless technologies, BDAW 2016Google Scholar
  12. El Makkaoui K, Ezzati A, Beni-Hssane A (2017) 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–480Google Scholar
  13. ElGamal T (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory 31:469–472.  https://doi.org/10.1109/TIT.1985.1057074 MathSciNetCrossRefzbMATHGoogle Scholar
  14. Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: 41st annual ACM symposium on theory of computing, STOC’09, pp 169–178Google Scholar
  15. Goldwasser S, Micali S (1982) Probabilistic encryption and how to play mental poker keeping secret all partial information. In: Proceedings of the fourteenth annual ACM symposium on Theory of computing. ACM, pp 365–377Google Scholar
  16. Hu C, Liu P, Guo S (2016) Public key encryption secure against related-key attacks and key-leakage attacks from extractable hash proofs. J Ambient Intell Hum Comput 7:681–692.  https://doi.org/10.1007/s12652-015-0329-0 CrossRefGoogle Scholar
  17. Kiraz MS (2016) A comprehensive meta-analysis of cryptographic security mechanisms for cloud computing. J Ambient Intell Hum Comput 7:731–760.  https://doi.org/10.1007/s12652-016-0385-0 CrossRefGoogle Scholar
  18. Lenstra AK, Lenstra HW, Manasse MS et al (1993) The number field sieve. In: Lenstra AK, Lenstra HW (eds) The development of the number field sieve. Lecture Notes in Mathematics, vol 1554. Springer, Berlin, pp 11–42Google Scholar
  19. Lenstra HW Jr (1987) Factoring integers with elliptic curves. Ann Math 126:649–673.  https://doi.org/10.2307/1971363 MathSciNetCrossRefzbMATHGoogle Scholar
  20. Lim S, Kim S, Yie I et al (2000) A generalized Takagi-cryptosystem with a modulus of the form \(p^{r}q^ {s}\). In: Roy B, Okamoto E (eds) Progress in cryptology—INDOCRYPT 2000. Lecture Notes in Computer Science, vol 1977. Springer, Berlin, pp 283–294Google Scholar
  21. Lu Y, Peng L, Sarkar S (2017) Cryptanalysis of an RSA variant with moduli \(N=p^{r}q^{l}\). J Math Cryptol 11:117–130.  https://doi.org/10.1515/jmc-2016-0025 MathSciNetCrossRefzbMATHGoogle Scholar
  22. McGregor C, Nimmo J, Stothers W (2010) Fundamentals of university mathematics. Elsevier, New YorkCrossRefGoogle Scholar
  23. Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: Stern J (eds) Advances in cryptology—EUROCRYPT ’99. Lecture Notes in Computer Science, vol 1592. Springer, Berlin, pp 223–238Google Scholar
  24. Quisquater JJ, Couvreur C (1982) Fast decipherment algorithm for RSA public-key cryptosystem. Electron Lett 18:905–907.  https://doi.org/10.1049/el:19820617 CrossRefGoogle Scholar
  25. Rivest RL, Adleman L, Dertouzos ML (1978) On data banks and privacy homomorphisms. Found Secure Comput 4:169–180MathSciNetGoogle Scholar
  26. Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21:120–126.  https://doi.org/10.1145/359340.359342 MathSciNetCrossRefzbMATHGoogle Scholar
  27. Silverman RD, Wagstaff SS (1993) A practical analysis of the elliptic curve factoring algorithm. Math Comput 61:445–462.  https://doi.org/10.2307/2152967 MathSciNetCrossRefzbMATHGoogle Scholar
  28. Takagi T (1998) Fast RSA-type cryptosystem modulo \(p^{k} q\). In: Krawczyk H (eds) Advances in cryptology—CRYPTO ’98. Lecture Notes in Computer Science, vol 1462. Springer, Berlin, pp 318–326Google Scholar
  29. van Dijk M, Gentry C , Halevi S et al (2010) Fully homomorphic encryption over the integers. In: Gilbert H (eds) Advances in cryptology—EUROCRYPT 2010. Lecture Notes in Computer Science, vol 6110. Springer, Berlin, pp 24–43Google Scholar
  30. Wang X, Xu G, Wang M et al (2015) Mathematical foundations of public key cryptography. CRC Press, Boca RatonCrossRefGoogle Scholar
  31. Wang Y (2016) Octonion algebra and noise-free fully homomorphic encryption (FHE) schemes. IACR Cryptology ePrint Archive, Report 2016/068. http://eprint.iacr.org/. Accessed 19 Nov 2017
  32. Wiener MJ (1990) Cryptanalysis of short RSA secret exponents. IEEE Trans Inf Theory 36:553–558.  https://doi.org/10.1109/18.54902 MathSciNetCrossRefzbMATHGoogle Scholar
  33. Xiang C, Tang C (2015) Efficient outsourcing schemes of modular exponentiations with checkability for untrusted cloud server. J Ambient Intell Hum Comput 6:131–139.  https://doi.org/10.1007/s12652-014-0254-7 CrossRefGoogle Scholar
  34. Yi X, Paulet R, Bertino E (2014) Homomorphic encryption and applications. Springer, HeidelbergCrossRefGoogle Scholar
  35. Yu J, Wang X, Gao W (2015) Improvement and applications of secure outsourcing of scientific computations. J Ambient Intell Hum Comput 6:763–772.  https://doi.org/10.1007/s12652-015-0280-0 CrossRefGoogle Scholar
  36. Yun D.Y (1974) The Hensel lemma in algebraic manipulation. Massachusetts Inst of Tech Cambridge Project MACGoogle Scholar
  37. Zhang W, Liu S, Zhong W et al (2015) How to build a faster private information retrieval protocol? J Ambient Intell Hum Comput 6:549–555.  https://doi.org/10.1007/s12652-014-0239-6 CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  • Khalid El Makkaoui
    • 1
    Email author
  • Abderrahim Beni-Hssane
    • 2
  • Abdellah Ezzati
    • 1
  1. 1.LAVETE Laboratory, FST, Univ Hassan 1SettatMorocco
  2. 2.LAROSERI Laboratory, Computer Science Department, Sciences FacultyChouaïb Doukkali UniversityEl JadidaMorocco

Personalised recommendations