{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,27]],"date-time":"2026-10-27T20:26:08Z","timestamp":1793132768927,"version":"4.5.0"},"reference-count":85,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T00:00:00Z","timestamp":1549670400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/I028099\/1"],"award-info":[{"award-number":["EP\/I028099\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/M004953\/1"],"award-info":[{"award-number":["EP\/M004953\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program","doi-asserted-by":"crossref","award":["2016YFB1000103"],"award-info":[{"award-number":["2016YFB1000103"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10207-019-00427-0","type":"journal-article","created":{"date-parts":[[2019,2,9]],"date-time":"2019-02-09T06:23:24Z","timestamp":1549693404000},"page":"549-579","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Practical homomorphic encryption over the integers for secure computation in the cloud"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0617-8817","authenticated-orcid":false,"given":"James","family":"Dyer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Dyer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jie","family":"Xu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,2,9]]},"reference":[{"issue":"4","key":"427_CR1","doi-asserted-by":"publisher","first-page":"79:1","DOI":"10.1145\/3214303","volume":"51","author":"A Acar","year":"2018","unstructured":"Acar, A., Aksu, H., Uluagac, A.S., Conti, M.: A survey on homomorphic encryption schemes: theory and implementation. ACM Comput. Surv. 51(4), 79:1\u201379:35 (2018). \n                    https:\/\/doi.org\/10.1145\/3214303","journal-title":"ACM Comput. Surv."},{"key":"427_CR2","doi-asserted-by":"publisher","unstructured":"Aggarwal, N., Gupta, C., Sharma, I.: Fully homomorphic symmetric scheme without bootstrapping. In: Proceedings of 2014 International Conference on Cloud Computing and Internet of Things (CCIOT 2014), pp. 14\u201317 (2014). \n                    https:\/\/doi.org\/10.1109\/CCIOT.2014.7062497","DOI":"10.1109\/CCIOT.2014.7062497"},{"key":"427_CR3","unstructured":"Aguilar-Melchor, C., Killijian, M.O., Lefebvre, C., Lepoint, T., Ricosset, T.: A Comparison of open-source homomorphic libraries with multi-precision plaintext moduli (2016). WHEAT 2016. \n                    https:\/\/wheat2016.lip6.fr\/ricosset.pdf"},{"key":"427_CR4","unstructured":"Amazon Web Services, Inc.: Amazon EMR (2018). \n                    http:\/\/aws.amazon.com\/elasticmapreduce\/"},{"key":"427_CR5","unstructured":"Aumasson, J.P.: On the pseudo-random generator ISAAC. Cryptology ePrint Archive, Report 2006\/438 (2006). \n                    https:\/\/eprint.iacr.org\/2006\/438"},{"key":"427_CR6","doi-asserted-by":"publisher","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A Concrete security treatment of symmetric encryption. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS 1997), pp. 394\u2013403. IEEE (1997). \n                    https:\/\/doi.org\/10.1109\/SFCS.1997.646128","DOI":"10.1109\/SFCS.1997.646128"},{"key":"427_CR7","doi-asserted-by":"publisher","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Proceedings of the 18th Annual Cryptology Conference (CRYPTO 1998), pp. 26\u201345. Springer (1998). \n                    https:\/\/doi.org\/10.1007\/BFb0055718","DOI":"10.1007\/BFb0055718"},{"key":"427_CR8","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security (CCS 2012), pp. 784\u2013796. ACM (2012). \n                    https:\/\/doi.org\/10.1145\/2382196.2382279","DOI":"10.1145\/2382196.2382279"},{"key":"427_CR9","unstructured":"Bellare, M., Rogaway, P.: Introduction to modern cryptography. Lecture Notes (2005)"},{"issue":"111","key":"427_CR10","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","volume":"24","author":"ER Berlekamp","year":"1970","unstructured":"Berlekamp, E.R.: Factoring polynomials over large finite fields. Math. Comput. 24(111), 713\u2013735 (1970)","journal-title":"Math. Comput."},{"key":"427_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-88702-7","volume-title":"Post-Quantum Cryptography, Chap. Introduction to Post-quantum Cryptography","author":"DJ Bernstein","year":"2009","unstructured":"Bernstein, D.J.: Post-Quantum Cryptography, Chap. Introduction to Post-quantum Cryptography, pp. 1\u201314. Springer, Berlin (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-540-88702-7_1"},{"key":"427_CR12","unstructured":"Bogos, S., Gaspoz, J., Vaudenay, S.: Cryptanalysis of a homomorphic encryption scheme. Cryptology ePrint Archive, Report 2016\/775 (2016). \n                    https:\/\/eprint.iacr.org\/2016\/775"},{"issue":"1","key":"427_CR13","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s12095-017-0243-8","volume":"10","author":"S Bogos","year":"2018","unstructured":"Bogos, S., Gaspoz, J., Vaudenay, S.: Cryptanalysis of a homomorphic encryption scheme. Cryptogr. Commun. 10(1), 27\u201339 (2018). \n                    https:\/\/doi.org\/10.1007\/s12095-017-0243-8","journal-title":"Cryptogr. Commun."},{"key":"427_CR14","unstructured":"Boneh, D., Shoup, V.: A Graduate Course in Applied Cryptography. Draft 0.2 (2015)"},{"key":"427_CR15","unstructured":"Bonte, C., Bootland, C., Bos, J.W., Castryck, W., Iliashenko, I., Vercauteren, F.: Faster Homomorphic function evaluation using non-integral base encoding. Cryptology ePrint Archive, Report 2017\/333 (2017). \n                    https:\/\/eprint.iacr.org\/2017\/333"},{"key":"427_CR16","unstructured":"Bos, J.W., Castryck, W., Iliashenko, I., Vercauteren, F.: Privacy-friendly forecasting for the smart grid using homomorphic encryption and the group method of data handling. Cryptology ePrint Archive, Report 2016\/1117 (2016). \n                    https:\/\/eprint.iacr.org\/2016\/1117"},{"key":"427_CR17","doi-asserted-by":"publisher","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) Proceedings of the 32nd Annual Cryptology Conference (CRYPTO 2012), pp. 868\u2013886. Springer (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"427_CR18","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Proceedings of the 3rd Conference on Innovations in Theoretical Computer Science (ITCS 2012), pp. 309\u2013325. ACM (2012). \n                    https:\/\/doi.org\/10.1145\/2090236.2090262","DOI":"10.1145\/2090236.2090262"},{"key":"427_CR19","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2011), pp. 97\u2013106. IEEE (2011). \n                    https:\/\/doi.org\/10.1109\/FOCS.2011.12","DOI":"10.1109\/FOCS.2011.12"},{"key":"427_CR20","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) Proceedings of the 31st Annual Cryptology Conference (CRYPTO 2011), pp. 505\u2013524. Springer (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-22792-9_29","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"427_CR21","unstructured":"Catalano, D., Fiore, D.: Boosting linearly-homomorphic encryption to evaluate degree-2 functions on encrypted data. Cryptology ePrint Archive, Report 2014\/813 (2014). \n                    https:\/\/eprint.iacr.org\/2014\/813"},{"key":"427_CR22","doi-asserted-by":"publisher","unstructured":"Catalano, D., Fiore, D.: Using linearly-homomorphic encryption to evaluate degree-2 functions on encrypted data. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security (CCS 2015), pp. 1518\u20131529. ACM (2015). \n                    https:\/\/doi.org\/10.1145\/2810103.2813624","DOI":"10.1145\/2810103.2813624"},{"key":"427_CR23","doi-asserted-by":"publisher","unstructured":"Chen, L., Ben, H., Huang, J.: An encryption depth optimization scheme for fully homomorphic encryption. In: Proceedings of the 2014 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI 2014), pp. 137\u2013141. IEEE (2014). \n                    https:\/\/doi.org\/10.1109\/IIKI.2014.35","DOI":"10.1109\/IIKI.2014.35"},{"key":"427_CR24","doi-asserted-by":"publisher","unstructured":"Chen, Y., Nguyen, P.Q.: Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers. In: D. Pointcheval, T. Johansson (eds.) Proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2012), pp. 502\u2013519. Springer (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-29011-4_30","DOI":"10.1007\/978-3-642-29011-4_30"},{"key":"427_CR25","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Coron, J., Kim, J., Lee, M.S., Lepoint, T., Tibouchi, M., Yun, A.: Batch fully homomorphic encryption over the integers. In: Johansson, T., Nguyen, P.Q. (eds.) Proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2013), pp. 315\u2013335. Springer (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-38348-9_20","DOI":"10.1007\/978-3-642-38348-9_20"},{"key":"427_CR26","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ins.2015.03.019","volume":"310","author":"JH Cheon","year":"2015","unstructured":"Cheon, J.H., Kim, J., Lee, M.S., Yun, A.: CRT-based fully homomorphic encryption over the integers. Inf. Sci. 310, 149\u2013162 (2015). \n                    https:\/\/doi.org\/10.1016\/j.ins.2015.03.019","journal-title":"Inf. Sci."},{"key":"427_CR27","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Stehl\u00e9, D.: Fully homomophic encryption over the integers revisited. In: Oswald, E., Fischlin, M. (eds.) Proceedings of the 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2015), Part I, pp. 513\u2013536. Springer (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-662-46800-5_20","DOI":"10.1007\/978-3-662-46800-5_20"},{"key":"427_CR28","doi-asserted-by":"publisher","unstructured":"Cohn, H., Heninger, N.: Approximate common divisors via lattices. In: Proceedings of the 10th Algorithmic Number Theory Symposium (ANTS-X), vol. 1, pp. 271\u2013293. Mathematical Sciences Publishers (2012). \n                    https:\/\/doi.org\/10.2140\/obs.2013.1.271","DOI":"10.2140\/obs.2013.1.271"},{"issue":"4","key":"427_CR29","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s001459900030","volume":"10","author":"D Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. J. Cryptol. 10(4), 233\u2013260 (1997). \n                    https:\/\/doi.org\/10.1007\/s001459900030","journal-title":"J. Cryptol."},{"key":"427_CR30","doi-asserted-by":"publisher","unstructured":"Coron, J., Lepoint, T., Tibouchi, M.: Scale-invariant fully homomorphic encryption over the integers. In: Krawczyk, H. (ed.) Proceedings of the 17th International Conference on Practice and Theory in Public-Key Cryptography (PKC 2014), pp. 311\u2013328. Springer (2014). \n                    https:\/\/doi.org\/10.1007\/978-3-642-54631-0_18","DOI":"10.1007\/978-3-642-54631-0_18"},{"key":"427_CR31","doi-asserted-by":"publisher","unstructured":"Coron, J., Mandal, A., Naccache, D., Tibouchi, M.: Fully homomorphic encryption over the integers with shorter public keys. In: Rogaway, P. (ed.) Proceedings of the 31st Annual Cryptology Conference (CRYPTO 2011), pp. 487\u2013504. Springer (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-22792-9_28","DOI":"10.1007\/978-3-642-22792-9_28"},{"key":"427_CR32","doi-asserted-by":"publisher","unstructured":"Coron, J., Naccache, D., Tibouchi, M.: Public key compression and modulus switching for fully homomorphic encryption over the integers. In: Pointcheval, D., Johansson, T. (eds.) Proceedings of the 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2012), pp. 446\u2013464. Springer (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-29011-4_27","DOI":"10.1007\/978-3-642-29011-4_27"},{"key":"427_CR33","unstructured":"CryptoExperts: FV-NFLib. \n                    https:\/\/github.com\/CryptoExperts\/FV-NFLlib"},{"key":"427_CR34","unstructured":"Dautelle, J.M.: JScience (2014). \n                    http:\/\/jscience.org"},{"key":"427_CR35","doi-asserted-by":"publisher","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Proceedings of the 29th Annual International Conference on Theory and Applications of Cryptographic Techniques (EUROCRYPT 2010), pp. 24\u201343. Springer (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-13190-5_2","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"427_CR36","unstructured":"van Dijk, M., Juels, A.: On the impossibility of cryptography alone for privacy-preserving cloud computing. In: Proceedings of the 5th USENIX Workshop on Hot Topics in Security (HotSec 2010), pp. 1\u20138. USENIX Association (2010). \n                    https:\/\/www.usenix.org\/legacy\/events\/hotsec10\/tech\/full_papers\/vanDijk.pdf"},{"key":"427_CR37","doi-asserted-by":"publisher","unstructured":"Ducas, L., Micciancio, D.: FHEW: Bootstrapping homomorphic encryption in less than a second. In: Oswald, E. , Fischlin, M. (eds.) Proceedings of the 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2015), Part I, pp. 617\u2013640. Springer (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"427_CR38","unstructured":"Ducas, L., Micciancio, D.: FHEW (2017). \n                    https:\/\/github.com\/lducas\/FHEW"},{"key":"427_CR39","doi-asserted-by":"publisher","unstructured":"Dyer, J., Dyer, M., Xu, J.: Practical Homomorphic Encryption Over the Integers for Secure Computation in the Cloud. In: O\u2019Neill, M. (ed.) Proceedings of the 16th IMA International Conference on Cryptography and Coding (IMACC 2017), Lecture Notes in Computer Science, vol. 10655, pp. 44\u201376. Springer (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-71045-7_3","DOI":"10.1007\/978-3-319-71045-7_3"},{"issue":"4","key":"427_CR40","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985). \n                    https:\/\/doi.org\/10.1109\/TIT.1985.1057074","journal-title":"IEEE Trans. Inf. Theory"},{"key":"427_CR41","doi-asserted-by":"publisher","unstructured":"Erkin, Z., Franz, M., Guajardo, J., Katzenbeisser, S., Lagendijk, I., Toft, T.: Privacy-preserving face recognition. In: Goldberg, I., Atallah, M.J. (eds.) Proceedings of the 9th International Symposium on Privacy Enhancing Technologies (PETS 2009), pp. 235\u2013253. Springer (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-642-03168-7_14","DOI":"10.1007\/978-3-642-03168-7_14"},{"key":"427_CR42","unstructured":"Fan, J., Vercauteren, F.: Somewhat Practical Fully Homomorphic Encryption. Cryptology ePrint Archive, Report 2012\/144 (2012). \n                    https:\/\/eprint.iacr.org\/2012\/144"},{"issue":"A","key":"427_CR43","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1112\/S1461157016000218","volume":"19","author":"SD Galbraith","year":"2016","unstructured":"Galbraith, S.D., Gebregiyorgis, S.W., Murphy, S.: Algorithms for the approximate common divisor problem. LMS J. Comput. Math. 19(A), 58\u201372 (2016). \n                    https:\/\/doi.org\/10.1112\/S1461157016000218","journal-title":"LMS J. Comput. Math."},{"key":"427_CR44","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing (STOC 2009), pp. 169\u2013178. ACM (2009). \n                    https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"427_CR45","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC 1987), pp. 218\u2013229. ACM (1987). \n                    https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"427_CR46","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Kalai, Y., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: Reusable garbled circuits and succinct functional encryption. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing (STOC 2013), pp. 555\u2013564. ACM (2013). \n                    https:\/\/doi.org\/10.1145\/2488608.2488678","DOI":"10.1145\/2488608.2488678"},{"issue":"2","key":"427_CR47","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci. 28(2), 270\u2013299 (1984). \n                    https:\/\/doi.org\/10.1016\/0022-0000(84)90070-9","journal-title":"J. Comput. Syst. Sci."},{"key":"427_CR48","unstructured":"Halevi, S., Shoup, V.: HELib. \n                    https:\/\/github.com\/shaih\/HElib"},{"key":"427_CR49","doi-asserted-by":"publisher","unstructured":"Halevi, S., Shoup, V.: Bootstrapping for HELib. In: Oswald, E., Fischlin, M. (eds.) Proceedings of the 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2015), pp. 641\u2013670. Springer (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-662-46800-5_25","DOI":"10.1007\/978-3-662-46800-5_25"},{"key":"427_CR50","doi-asserted-by":"publisher","unstructured":"Howgrave-Graham, N.: Approximate integer common divisors. In: Revised Papers from the International Conference on Cryptography and Lattices (CaLC 2001), pp. 51\u201366. Springer (2001). \n                    https:\/\/doi.org\/10.1007\/3-540-44670-2_6","DOI":"10.1007\/3-540-44670-2_6"},{"key":"427_CR51","doi-asserted-by":"publisher","first-page":"119","DOI":"10.4086\/toc.2011.v007a008","volume":"7","author":"P Hrube\u0161","year":"2011","unstructured":"Hrube\u0161, P., Yehudayoff, A.: Arithmetic complexity in algebraic extensions. Theory Comput. 7, 119\u2013129 (2011)","journal-title":"Theory Comput."},{"key":"427_CR52","unstructured":"Jenkins, B.: ISAAC: a fast cryptographic random number generator (1996). \n                    http:\/\/burtleburtle.net\/bob\/rand\/isaacafa.html"},{"key":"427_CR53","doi-asserted-by":"publisher","unstructured":"Joye, M., Libert, B.: Efficient cryptosystems from \n                    \n                      \n                    \n                    $$2^k$$\n                    \n                      \n                        \n                          2\n                          k\n                        \n                      \n                    \n                  -th power residue symbols. In: Proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2013), pp. 76\u201392. Springer (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-38348-9_5","DOI":"10.1007\/978-3-642-38348-9_5"},{"key":"427_CR54","unstructured":"Kipnis, A., Hibshoosh, E.: Efficient methods for practical fully homomorphic symmetric-key encrypton, randomization and verification. Cryptology ePrint Archive, Report 2012\/637 (2012). \n                    https:\/\/eprint.iacr.org\/2012\/637"},{"key":"427_CR55","doi-asserted-by":"publisher","unstructured":"Kleinjung, T., Aoki, K., Franke, J., Lenstra, A.K., Thom\u00e9, E., Bos, J.W., Gaudry, P., Kruppa, A., Montgomery, P.L., Osvik, D.A., Te Riele, H., Timofeev, A., Zimmermann, P.: Factorization of a 768-bit RSA Modulus. In: Proceedings of the 30th Annual Cryptology Conference (CRYPTO 2010), pp. 333\u2013350. Springer (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-14623-7_18","DOI":"10.1007\/978-3-642-14623-7_18"},{"key":"427_CR56","unstructured":"Laine, K., Chen, H., Player, R., Wernsing, J., Naehrig, M., Dowlin, N., Cetin, G., Xia, S., Rindal, P.: Simple Encrypted Arithmetic Library\u2014SEAL (2017). \n                    https:\/\/sealcrypto.codeplex.com\/"},{"key":"427_CR57","doi-asserted-by":"publisher","unstructured":"Lauter, K., Naehrig, M., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop (CCSW 2011), pp. 113\u2013124. ACM (2011). \n                    https:\/\/doi.org\/10.1145\/2046660.2046682","DOI":"10.1145\/2046660.2046682"},{"key":"427_CR58","doi-asserted-by":"publisher","unstructured":"Massey, J.L.: Guessing and entropy. In: Proceedings of 1994 IEEE International Symposium on Information Theory (ISIT 1994), p. 204. IEEE (1994). \n                    https:\/\/doi.org\/10.1109\/ISIT.1994.394764","DOI":"10.1109\/ISIT.1994.394764"},{"key":"427_CR59","unstructured":"Microsoft: HDInsight (2018). \n                    http:\/\/azure.microsoft.com\/en-gb\/services\/hdinsight\/"},{"key":"427_CR60","unstructured":"Microsoft: Microsoft Azure for Research (2018). \n                    https:\/\/www.microsoft.com\/en-us\/research\/academic-program\/microsoft-azure-for-research\/"},{"key":"427_CR61","unstructured":"Moshkovitz, D.: An Alternative Proof of the Schwartz\u2013Zippel Lemma. In: Electronic Colloquium on Computational Complexity (ECCC), p. 96 (2010)"},{"key":"427_CR62","unstructured":"Nuida, K., Kurosawa, K.: (Batch) Fully homomorphic encryption over integers for non-binary message spaces. Cryptology ePrint Archive, Report 2014\/777 (2014). \n                    https:\/\/eprint.iacr.org\/2014\/777"},{"key":"427_CR63","doi-asserted-by":"publisher","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) Proceedings of the 18th International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT 1999), pp. 223\u2013238. Springer (1999). \n                    https:\/\/doi.org\/10.1007\/3-540-48910-X_16","DOI":"10.1007\/3-540-48910-X_16"},{"key":"427_CR64","doi-asserted-by":"publisher","unstructured":"Pisa, P.S., Abdalla, M., Duarte, O.C.M.B.: Somewhat homomorphic encryption scheme for arithmetic operations on large integers. In: Proceedings of the 2012 Global Information Infrastructure and Networking Symposium (GIIS 2012), pp. 1\u20138. IEEE (2012). \n                    https:\/\/doi.org\/10.1109\/GIIS.2012.6466769","DOI":"10.1109\/GIIS.2012.6466769"},{"key":"427_CR65","doi-asserted-by":"publisher","unstructured":"Popa, R.A., Redfield, C., Zeldovich, N., Balakrishnan, H.: CryptDB: Protecting Confidentiality with Encrypted Query Processing. In: Proceedings of the 23rd ACM Symposium on Operating Systems Principles (SOSP 2011), pp. 85\u2013100. ACM (2011). \n                    https:\/\/doi.org\/10.1145\/2043556.2043566","DOI":"10.1145\/2043556.2043566"},{"key":"427_CR66","unstructured":"Rabin, M.O.: Digitalized signatures and public-key functions as intractable as factorization. Technical Report MIT\/LCS\/TR-212, MIT (1979)"},{"key":"427_CR67","doi-asserted-by":"publisher","unstructured":"Ramaiah, Y.G., Kumari, G.V.: Efficient public key homomorphic encryption over integer plaintexts. In: Proceedings of the 2012 International Conference on Information Security and Intelligent Control, pp. 123\u2013128 (2012). \n                    https:\/\/doi.org\/10.1109\/ISIC.2012.6449723","DOI":"10.1109\/ISIC.2012.6449723"},{"key":"427_CR68","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 84\u201393. ACM (2005). \n                    https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"427_CR69","unstructured":"Ricosset, T.: HElib-MP. \n                    https:\/\/github.com\/tricosset\/HElib-MP"},{"issue":"11","key":"427_CR70","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Found. Secure Comput. 4(11), 169\u2013180 (1978)","journal-title":"Found. Secure Comput."},{"issue":"2","key":"427_CR71","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978). \n                    https:\/\/doi.org\/10.1145\/359340.359342","journal-title":"Commun. ACM"},{"key":"427_CR72","volume-title":"An Introduction to Nonassociative Algebras","author":"RD Schafer","year":"1966","unstructured":"Schafer, R.D.: An Introduction to Nonassociative Algebras, vol. 22. Dover, Mineola (1966)"},{"issue":"3","key":"427_CR73","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1305\/ndjfl\/1093958259","volume":"6","author":"TW Scharle","year":"1965","unstructured":"Scharle, T.W.: Axiomatization of propositional calculus with sheffer functors. Notre Dame J. Formal Logic 6(3), 209\u2013217 (1965). \n                    https:\/\/doi.org\/10.1305\/ndjfl\/1093958259","journal-title":"Notre Dame J. Formal Logic"},{"key":"427_CR74","doi-asserted-by":"publisher","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic encryption with relatively small key and ciphertext sizes. In: Proceedings of the 13th International Conference on Practice and Theory in Public Key Cryptography (PKC 2010), pp. 420\u2013443. Springer (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-13013-7_25","DOI":"10.1007\/978-3-642-13013-7_25"},{"issue":"1","key":"427_CR75","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10623-012-9720-4","volume":"71","author":"NP Smart","year":"2014","unstructured":"Smart, N.P., Vercauteren, F.: Fully homomorphic SIMD operations. Des. Codes Cryptogr. 71(1), 57\u201381 (2014). \n                    https:\/\/doi.org\/10.1007\/s10623-012-9720-4","journal-title":"Des. Codes Cryptogr."},{"key":"427_CR76","unstructured":"Stephen, J.J., Savvides, S., Seidel, R., Eugster, P.: Practical confidentiality preserving big data analysis. In: Proceedings of the 6th USENIX Workshop on Hot Topics in Cloud Computing (HotCloud 14). USENIX Association (2014). \n                    https:\/\/www.usenix.org\/conference\/hotcloud14\/workshop-program\/presentation\/stephen"},{"key":"427_CR77","doi-asserted-by":"publisher","unstructured":"Tetali, S.D., Lesani, M., Majumdar, R., Millstein, T.: MrCrypt: static analysis for secure cloud computations. In: Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages & Applications (OOPSLA 2013), pp. 271\u2013286. ACM (2013). \n                    https:\/\/doi.org\/10.1145\/2509136.2509554","DOI":"10.1145\/2509136.2509554"},{"key":"427_CR78","unstructured":"Thomson, I.: Microsoft researchers smash homomorphic encryption speed barrier. The Register (2016). \n                    https:\/\/www.theregister.co.uk\/2016\/02\/09\/researchers_break_homomorphic_encryption\/"},{"key":"427_CR79","unstructured":"Varia, M., Yakoubov, S., Yang, Y.: HETest: A homomorphic encryption testing framework. Cryptology ePrint Archive, Report 2015\/416 (2015). \n                    https:\/\/eprint.iacr.org\/2015\/416"},{"key":"427_CR80","unstructured":"Vivek, S.: Homomorphic encryption API software library. \n                    http:\/\/heat-h2020-project.blogspot.co.uk\/2017\/02\/homomorphic-encryption-api-software.html"},{"issue":"2","key":"427_CR81","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1556\/012.2015.52.2.1311","volume":"52","author":"D Viz\u00e1r","year":"2015","unstructured":"Viz\u00e1r, D., Vaudenay, S.: Cryptanalysis of chosen symmetric homomorphic schemes. Stud. Sci. Math. Hung. 52(2), 288\u2013306 (2015). \n                    https:\/\/doi.org\/10.1556\/012.2015.52.2.1311","journal-title":"Stud. Sci. Math. Hung."},{"key":"427_CR82","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity: A Uniform Approach","author":"H Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity: A Uniform Approach. Springer, Berlin (1999)"},{"key":"427_CR83","doi-asserted-by":"publisher","unstructured":"Wang, D., Guo, B., Shen, Y., Cheng, S.J., Lin, Y.H.: A faster fully homomorphic encryption scheme in big data. In: Proceedings of the 2017 IEEE 2nd International Conference on Big Data Analysis (ICBDA 2017), pp. 345\u2013349 (2017). \n                    https:\/\/doi.org\/10.1109\/ICBDA.2017.8078836","DOI":"10.1109\/ICBDA.2017.8078836"},{"key":"427_CR84","unstructured":"Yu, A., Lai, W.L., Payor, J.: Efficient integer vector homomorphic encryption (2015). \n                    https:\/\/courses.csail.mit.edu\/6.857\/2015\/files\/yu-lai-payor.pdf"},{"key":"427_CR85","doi-asserted-by":"publisher","unstructured":"Zhou, H., Wornell, G.: Efficient homomorphic encryption on integer vectors and its applications. In: Proceedings of the 2014 Information Theory and Applications Workshop (ITA 2014), pp. 1\u20139. IEEE (2014). \n                    https:\/\/doi.org\/10.1109\/ITA.2014.6804228","DOI":"10.1109\/ITA.2014.6804228"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-019-00427-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-019-00427-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-019-00427-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,8]],"date-time":"2020-02-08T19:08:26Z","timestamp":1581188906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-019-00427-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,9]]},"references-count":85,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["427"],"URL":"https:\/\/doi.org\/10.1007\/s10207-019-00427-0","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,9]]},"assertion":[{"value":"9 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"This study was funded by Engineering and Physical Sciences Research Council (EP\/I028099\/1 & EP\/M004953\/1) and National Key Research and Development Program of China (2016YFB1000103). Usage of Microsoft\u2019s Azure cloud was funded by a Microsoft Azure for Research sponsorship.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}},{"value":"Ethical approval: This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}