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

被引:0
作者
Khalid El Makkaoui
Abderrahim Beni-Hssane
Abdellah Ezzati
机构
[1] LAVETE Laboratory,LAROSERI Laboratory, Computer Science Department, Sciences Faculty
[2] FST,undefined
[3] Univ Hassan 1,undefined
[4] Chouaïb Doukkali University,undefined
来源
Journal of Ambient Intelligence and Humanized Computing | 2019年 / 10卷
关键词
Cloud computing; Confidentiality; Homomorphic encryption (HE); Fast decryption; Chinese remainder theorem (CRT); Hensel lifting;
D O I
暂无
中图分类号
学科分类号
摘要
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=prqs\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n=p^rq^s$$\end{document} for r≥2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$r\ge 2$$\end{document} and s≥1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$s \ge 1$$\end{document}, 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.
引用
收藏
页码:4629 / 4640
页数:11
相关论文
共 40 条
  • [1] Alam Masoom(2017)Garbled role-based access control in the cloud Journal of Ambient Intelligence and Humanized Computing 9 1153-1166
  • [2] Emmanuel Naina(2000)Cryptanalysis of RSA with private key IEEE Trans Inf Theory 46 1339-1349
  • [3] Khan Tanveer(2002) less than CryptoBytes 5 1-9
  • [4] Xiang Yang(2017)Fast variants of RSA Proc Comput Sci 113 33-40
  • [5] Hassan Houcine(1985)Fast Cloud-RSA scheme for promoting data confidentiality in the cloud computing IEEE Trans Inf Theory 31 469-472
  • [6] Boneh D(2016)A public key cryptosystem and a signature scheme based on discrete logarithms J Ambient Intell Hum Comput 7 681-692
  • [7] Durfee G(2016)Public key encryption secure against related-key attacks and key-leakage attacks from extractable hash proofs J Ambient Intell Hum Comput 7 731-760
  • [8] Boneh D(1987)A comprehensive meta-analysis of cryptographic security mechanisms for cloud computing Ann Math 126 649-673
  • [9] Shacham H(2017)Factoring integers with elliptic curves J Math Cryptol 11 117-130
  • [10] El Makkaoui K(1982)Cryptanalysis of an RSA variant with moduli Electron Lett 18 905-907