{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T23:56:37Z","timestamp":1772063797673,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T00:00:00Z","timestamp":1526601600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Ambient Intell Human Comput"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s12652-018-0844-x","type":"journal-article","created":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T02:21:46Z","timestamp":1526610106000},"page":"4629-4640","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Speedy Cloud-RSA homomorphic scheme for preserving data confidentiality in cloud computing"],"prefix":"10.1007","volume":"10","author":[{"given":"Khalid","family":"El Makkaoui","sequence":"first","affiliation":[]},{"given":"Abderrahim","family":"Beni-Hssane","sequence":"additional","affiliation":[]},{"given":"Abdellah","family":"Ezzati","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,18]]},"reference":[{"issue":"4","key":"844_CR1","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1007\/s12652-017-0573-6","volume":"9","author":"Masoom Alam","year":"2017","unstructured":"Alam M, Emmanuel N, Khan T et al (2017) Garbled role-based access control in the cloud. J Ambient Intell Hum Comput. \n                    https:\/\/doi.org\/10.1007\/s12652-017-0573-6","journal-title":"Journal of Ambient Intelligence and Humanized Computing"},{"key":"844_CR2","unstructured":"Armbrust M, Fox A, Griffith R et al (2009) Above the clouds: a Berkeley view of cloud computing, UC Berkeley Technical Report"},{"key":"844_CR3","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-319-55589-8_4","volume-title":"Codes, Cryptology and Information Security","author":"H. Bennasar","year":"2017","unstructured":"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\u201367"},{"key":"844_CR4","first-page":"1","volume-title":"Public Key Cryptography - PKC 2006","author":"Daniel Bleichenbacher","year":"2006","unstructured":"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\u201313"},{"key":"844_CR5","doi-asserted-by":"publisher","first-page":"1339","DOI":"10.1109\/18.850673","volume":"46","author":"D Boneh","year":"2000","unstructured":"Boneh D, Durfee G (2000) Cryptanalysis of RSA with private key \n                    \n                      \n                    \n                    $$d$$\n                    \n                      \n                        d\n                      \n                    \n                   less than \n                    \n                      \n                    \n                    $$N^{0.292}$$\n                    \n                      \n                        \n                          N\n                          \n                            0.292\n                          \n                        \n                      \n                    \n                  . IEEE Trans Inf Theory 46:1339\u20131349. \n                    https:\/\/doi.org\/10.1109\/18.850673","journal-title":"IEEE Trans Inf Theory"},{"key":"844_CR6","first-page":"1","volume":"5","author":"D Boneh","year":"2002","unstructured":"Boneh D, Shacham H (2002) Fast variants of RSA. CryptoBytes 5:1\u20139","journal-title":"CryptoBytes"},{"key":"844_CR7","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-38348-9_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"Jung Hee Cheon","year":"2013","unstructured":"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\u2013335"},{"key":"844_CR8","unstructured":"Collins T, Hopkins D, Langford S et al (1997) Public key cryptographic apparatus and method. US Patent 5,848,159"},{"key":"844_CR9","doi-asserted-by":"crossref","unstructured":"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\u201366","DOI":"10.1109\/WINCOM.2016.7777192"},{"key":"844_CR10","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.procs.2017.08.282","volume":"113","author":"K Makkaoui El","year":"2017","unstructured":"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\u201340","journal-title":"Proc Comput Sci"},{"key":"844_CR11","doi-asserted-by":"crossref","unstructured":"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 2016","DOI":"10.1145\/3010089.3016026"},{"key":"844_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013480","DOI":"10.1007\/978-3-319-46568-5_48"},{"key":"844_CR13","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal T (1985) A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans Inf Theory 31:469\u2013472. \n                    https:\/\/doi.org\/10.1109\/TIT.1985.1057074","journal-title":"IEEE Trans Inf Theory"},{"key":"844_CR14","doi-asserted-by":"crossref","unstructured":"Gentry C (2009) Fully homomorphic encryption using ideal lattices. In: 41st annual ACM symposium on theory of computing, STOC\u201909, pp 169\u2013178","DOI":"10.1145\/1536414.1536440"},{"key":"844_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013377","DOI":"10.1145\/800070.802212"},{"key":"844_CR16","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/s12652-015-0329-0","volume":"7","author":"C Hu","year":"2016","unstructured":"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\u2013692. \n                    https:\/\/doi.org\/10.1007\/s12652-015-0329-0","journal-title":"J Ambient Intell Hum Comput"},{"key":"844_CR17","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s12652-016-0385-0","volume":"7","author":"MS Kiraz","year":"2016","unstructured":"Kiraz MS (2016) A comprehensive meta-analysis of cryptographic security mechanisms for cloud computing. J Ambient Intell Hum Comput 7:731\u2013760. \n                    https:\/\/doi.org\/10.1007\/s12652-016-0385-0","journal-title":"J Ambient Intell Hum Comput"},{"key":"844_CR18","first-page":"11","volume-title":"Lecture Notes in Mathematics","author":"A. K. Lenstra","year":"1993","unstructured":"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\u201342"},{"key":"844_CR19","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"HW Lenstra Jr","year":"1987","unstructured":"Lenstra HW Jr (1987) Factoring integers with elliptic curves. Ann Math 126:649\u2013673. \n                    https:\/\/doi.org\/10.2307\/1971363","journal-title":"Ann Math"},{"key":"844_CR20","unstructured":"Lim S, Kim S, Yie I et al (2000) A generalized Takagi-cryptosystem with a modulus of the form \n                    \n                      \n                    \n                    $$p^{r}q^ {s}$$\n                    \n                      \n                        \n                          \n                            p\n                            r\n                          \n                          \n                            q\n                            s\n                          \n                        \n                      \n                    \n                  . In: Roy B, Okamoto E (eds) Progress in cryptology\u2014INDOCRYPT 2000. Lecture Notes in Computer Science, vol 1977. Springer, Berlin, pp 283\u2013294"},{"key":"844_CR21","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1515\/jmc-2016-0025","volume":"11","author":"Y Lu","year":"2017","unstructured":"Lu Y, Peng L, Sarkar S (2017) Cryptanalysis of an RSA variant with moduli \n                    \n                      \n                    \n                    $$N=p^{r}q^{l}$$\n                    \n                      \n                        \n                          N\n                          =\n                          \n                            p\n                            r\n                          \n                          \n                            q\n                            l\n                          \n                        \n                      \n                    \n                  . J Math Cryptol 11:117\u2013130. \n                    https:\/\/doi.org\/10.1515\/jmc-2016-0025","journal-title":"J Math Cryptol"},{"key":"844_CR22","doi-asserted-by":"publisher","DOI":"10.1533\/9780857092243","volume-title":"Fundamentals of university mathematics","author":"C McGregor","year":"2010","unstructured":"McGregor C, Nimmo J, Stothers W (2010) Fundamentals of university mathematics. Elsevier, New York"},{"key":"844_CR23","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: Stern J (eds) Advances in cryptology\u2014EUROCRYPT \u201999. Lecture Notes in Computer Science, vol 1592. Springer, Berlin, pp 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"844_CR24","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1049\/el:19820617","volume":"18","author":"JJ Quisquater","year":"1982","unstructured":"Quisquater JJ, Couvreur C (1982) Fast decipherment algorithm for RSA public-key cryptosystem. Electron Lett 18:905\u2013907. \n                    https:\/\/doi.org\/10.1049\/el:19820617","journal-title":"Electron Lett"},{"key":"844_CR25","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Adleman L, Dertouzos ML (1978) On data banks and privacy homomorphisms. Found Secure Comput 4:169\u2013180","journal-title":"Found Secure Comput"},{"key":"844_CR26","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21:120\u2013126. \n                    https:\/\/doi.org\/10.1145\/359340.359342","journal-title":"Commun ACM"},{"key":"844_CR27","doi-asserted-by":"publisher","first-page":"445","DOI":"10.2307\/2152967","volume":"61","author":"RD Silverman","year":"1993","unstructured":"Silverman RD, Wagstaff SS (1993) A practical analysis of the elliptic curve factoring algorithm. Math Comput 61:445\u2013462. \n                    https:\/\/doi.org\/10.2307\/2152967","journal-title":"Math Comput"},{"key":"844_CR28","doi-asserted-by":"crossref","unstructured":"Takagi T (1998) Fast RSA-type cryptosystem modulo \n                    \n                      \n                    \n                    $$p^{k} q$$\n                    \n                      \n                        \n                          \n                            p\n                            k\n                          \n                          q\n                        \n                      \n                    \n                  . In: Krawczyk H (eds) Advances in cryptology\u2014CRYPTO \u201998. Lecture Notes in Computer Science, vol 1462. Springer, Berlin, pp 318\u2013326","DOI":"10.1007\/BFb0055738"},{"key":"844_CR29","doi-asserted-by":"crossref","unstructured":"van Dijk M, Gentry C , Halevi S et al (2010) Fully homomorphic encryption over the integers. In: Gilbert H (eds) Advances in cryptology\u2014EUROCRYPT 2010. Lecture Notes in Computer Science, vol 6110. Springer, Berlin, pp 24\u201343","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"844_CR30","doi-asserted-by":"publisher","DOI":"10.1201\/b19324","volume-title":"Mathematical foundations of public key cryptography","author":"X Wang","year":"2015","unstructured":"Wang X, Xu G, Wang M et al (2015) Mathematical foundations of public key cryptography. CRC Press, Boca Raton"},{"key":"844_CR31","unstructured":"Wang Y (2016) Octonion algebra and noise-free fully homomorphic encryption (FHE) schemes. IACR Cryptology ePrint Archive, Report 2016\/068. \n                    http:\/\/eprint.iacr.org\/\n                    \n                  . Accessed 19 Nov 2017"},{"key":"844_CR32","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1109\/18.54902","volume":"36","author":"MJ Wiener","year":"1990","unstructured":"Wiener MJ (1990) Cryptanalysis of short RSA secret exponents. IEEE Trans Inf Theory 36:553\u2013558. \n                    https:\/\/doi.org\/10.1109\/18.54902","journal-title":"IEEE Trans Inf Theory"},{"key":"844_CR33","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s12652-014-0254-7","volume":"6","author":"C Xiang","year":"2015","unstructured":"Xiang C, Tang C (2015) Efficient outsourcing schemes of modular exponentiations with checkability for untrusted cloud server. J Ambient Intell Hum Comput 6:131\u2013139. \n                    https:\/\/doi.org\/10.1007\/s12652-014-0254-7","journal-title":"J Ambient Intell Hum Comput"},{"key":"844_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12229-8","volume-title":"Homomorphic encryption and applications","author":"X Yi","year":"2014","unstructured":"Yi X, Paulet R, Bertino E (2014) Homomorphic encryption and applications. Springer, Heidelberg"},{"key":"844_CR35","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1007\/s12652-015-0280-0","volume":"6","author":"J Yu","year":"2015","unstructured":"Yu J, Wang X, Gao W (2015) Improvement and applications of secure outsourcing of scientific computations. J Ambient Intell Hum Comput 6:763\u2013772. \n                    https:\/\/doi.org\/10.1007\/s12652-015-0280-0","journal-title":"J Ambient Intell Hum Comput"},{"key":"844_CR36","unstructured":"Yun D.Y (1974) The Hensel lemma in algebraic manipulation. Massachusetts Inst of Tech Cambridge Project MAC"},{"key":"844_CR37","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/s12652-014-0239-6","volume":"6","author":"W Zhang","year":"2015","unstructured":"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\u2013555. \n                    https:\/\/doi.org\/10.1007\/s12652-014-0239-6","journal-title":"J Ambient Intell Hum Comput"}],"container-title":["Journal of Ambient Intelligence and Humanized Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-018-0844-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12652-018-0844-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12652-018-0844-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,30]],"date-time":"2019-10-30T17:19:45Z","timestamp":1572455985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12652-018-0844-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,18]]},"references-count":37,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["844"],"URL":"https:\/\/doi.org\/10.1007\/s12652-018-0844-x","relation":{},"ISSN":["1868-5137","1868-5145"],"issn-type":[{"value":"1868-5137","type":"print"},{"value":"1868-5145","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,18]]},"assertion":[{"value":"15 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}