{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,28]],"date-time":"2025-06-28T04:07:23Z","timestamp":1751083643520,"version":"3.41.0"},"publisher-location":"Cham","reference-count":59,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319710440"},{"type":"electronic","value":"9783319710457"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71045-7_3","type":"book-chapter","created":{"date-parts":[[2017,11,24]],"date-time":"2017-11-24T16:16:50Z","timestamp":1511540210000},"page":"44-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Practical Homomorphic Encryption Over the Integers for Secure Computation in the Cloud"],"prefix":"10.1007","author":[{"given":"James","family":"Dyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Dyer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,25]]},"reference":[{"key":"3_CR1","unstructured":"Acar, A., et al.: A survey on homomorphic encryption schemes: theory and implementation (2017). arXiv:1704.03578 [cs.CR]"},{"key":"3_CR2","unstructured":"Aguilar-Melchor, C., et al.: A comparison of open-source homomorphic libraries with multi-precision plaintext moduli, WHEAT 2016, July 2016. https:\/\/wheat2016.lip6.fr\/ricosset.pdf"},{"key":"3_CR3","unstructured":"Aumasson, J.-P.: On the pseudo-random generator ISAAC. Cryptology ePrint Archive: 2006\/438 (2006)"},{"key":"3_CR4","unstructured":"Bellare, M., Rogaway, P.: Introduction to Modern Cryptography. Lecture Notes (2005)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., et al.: A concrete security treatment of symmetric encryption. In: Proceedings of FOCS 1997, pp. 394\u2013403 (1997)","DOI":"10.1109\/SFCS.1997.646128"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology \u2014 CRYPTO 1998","author":"M Bellare","year":"1998","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 26\u201345. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055718"},{"issue":"111","key":"3_CR7","doi-asserted-by":"crossref","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":"3_CR8","unstructured":"Bogos, S., et al.: Cryptanalysis of a Homomorphic Encryption Scheme. Cryptology ePrint Archive: 2016\/775 (2016)"},{"key":"3_CR9","unstructured":"Boneh, D., Shoup, V.: A Graduate Course in Applied Cryptography. Draft 0.2 (2015)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Bonte, C., et al.: Faster homomorphic function evaluation using non-integral base encoding. Cryptology ePrint Archive: 2017\/333 (2017)","DOI":"10.1007\/978-3-319-66787-4_28"},{"key":"3_CR11","unstructured":"Bos, J.W., et al.: Privacy-friendly Forecasting for the Smart Grid using Homomorphic Encryption and the Group Method of Data Handling. Cryptology ePrint Archive: 2016\/1117 (2016)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-642-22792-9_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from Ring-LWE and security for key dependent messages. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 505\u2013524. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_29"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., et al.: (Leveled) Fully homomorphic encryption without bootstrapping. In: Proceedings of ITCS 2012, pp. 309\u2013325 (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Catalano, D., Fiore, D.: Boosting linearly-homomorphic encryption to evaluate degree-2 functions on encrypted data. Cryptology ePrint Archive: 2014\/813 (2014)","DOI":"10.1145\/2810103.2813624"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Catalano, D., Fiore, D.: Using linearly-homomorphic encryption to evaluate degree- 2 functions on encrypted data. In: Proceedings of CCS 2015, pp. 1518\u20131529. ACM (2015)","DOI":"10.1145\/2810103.2813624"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Chen, Y., Nguyen, P.Q.: Faster algorithms for approximate common divisors: breaking fully homomorphic encryption challenges over the integers. In: Proceedings of EUROCRYPT 2012, pp. 502\u2013519 (2012)","DOI":"10.1007\/978-3-642-29011-4_30"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Cohn, H., Heninger, N.: Approximate common divisors via lattices. In: Proceedings of ANTSX, vol. 1, pp. 271\u2013293 (2012)","DOI":"10.2140\/obs.2013.1.271"},{"issue":"4","key":"3_CR18","doi-asserted-by":"crossref","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)","journal-title":"J. Cryptol."},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-642-22792-9_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"J-S Coron","year":"2011","unstructured":"Coron, J.-S., Mandal, A., Naccache, D., Tibouchi, M.: Fully homomorphic encryption over the integers with shorter public keys. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 487\u2013504. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_28"},{"key":"3_CR20","unstructured":"CryptoExperts. FV-NFLib. https:\/\/github.com\/CryptoExperts\/FV-NFLlib"},{"key":"3_CR21","unstructured":"Dautelle, J.-M.: JScience. Version 4.3.1, September 2014. http:\/\/jscience.org"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M Dijk van","year":"2010","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 24\u201343. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_2"},{"key":"3_CR23","unstructured":"van Dijk, M., Juels, A.: On the impossibility of cryptography alone for privacy-preserving cloud computing. In: Proceedings of HotSec 2010, pp. 1\u20138 (2010)"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-662-46800-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"L Ducas","year":"2015","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 617\u2013640. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24"},{"key":"3_CR25","unstructured":"Ducas, L., Micciancio, D.: FHEW. A fully homomorphic encryption library. https:\/\/github.com\/lducas\/FHEW"},{"key":"3_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10\u201318. Springer, Heidelberg (1985). https:\/\/doi.org\/10.1007\/3-540-39568-7_2"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-03168-7_14","volume-title":"Privacy Enhancing Technologies","author":"Z Erkin","year":"2009","unstructured":"Erkin, Z., Franz, M., Guajardo, J., Katzenbeisser, S., Lagendijk, I., Toft, T.: Privacy-preserving face recognition. In: Goldberg, I., Atallah, M.J. (eds.) PETS 2009. LNCS, vol. 5672, pp. 235\u2013253. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03168-7_14"},{"key":"3_CR28","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive: 2012\/144 (2012)"},{"issue":"A","key":"3_CR29","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1112\/S1461157016000218","volume":"19","author":"SD Galbraith","year":"2016","unstructured":"Galbraith, S.D., et al.: Algorithms for the approximate common divisor problem. LMS J. Comput. Math. 19(A), 58\u201372 (2016)","journal-title":"LMS J. Comput. Math."},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of STOC 2009, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Goldreich, O., et al.: How to play ANY mental game. In: Proceedings of STOC 1987, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"issue":"2","key":"3_CR32","doi-asserted-by":"crossref","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)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., et al.: Reusable garbled circuits and succinct functional encryption. In: Proceedings of STOC 2013, pp. 555\u2013564 (2013)","DOI":"10.1145\/2488608.2488678"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/978-3-662-46800-5_25","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"S Halevi","year":"2015","unstructured":"Halevi, S., Shoup, V.: Bootstrapping for HElib. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 641\u2013670. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_25"},{"key":"3_CR35","unstructured":"Halevi, S., Shoup, V.: HELib. https:\/\/github.com\/shaih\/HElib"},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-44670-2_6","volume-title":"Cryptography and Lattices","author":"N Howgrave-Graham","year":"2001","unstructured":"Howgrave-Graham, N.: Approximate integer common divisors. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 51\u201366. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44670-2_6"},{"key":"3_CR37","unstructured":"Jenkins, B.: ISAAC: a fast cryptographic random number generator (1996). http:\/\/burtleburtle.net\/bob\/rand\/isaacafa.html"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Joye, M., Libert, B.: Efficient cryptosystems from 2 $$^{k}$$ -th power residue symbols. In: Proceedings of EUROCRYPT 2013, pp. 76\u201392 (2013)","DOI":"10.1007\/978-3-642-38348-9_5"},{"key":"3_CR39","unstructured":"Kipnis, A., Hibshoosh, E.: Efficient methods for practical fully homomorphic symmetrickey encryption, randomization and verification. Cryptology ePrint Archive: 2012\/637 (2012)"},{"key":"3_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-14623-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"T Kleinjung","year":"2010","unstructured":"Kleinjung, T., et al.: Factorization of a 768-Bit RSA modulus. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 333\u2013350. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_18"},{"key":"3_CR41","unstructured":"Laine, K., et al.: Simple Encrypted Arithmetic Library - SEAL. Version 2.2 (2017). https:\/\/sealcrypto.codeplex.com\/"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Lauter, K., et al.: Can homomorphic encryption be practical? In: Proceedings of CCSW 2011, pp. 113\u2013124 (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"3_CR43","doi-asserted-by":"crossref","unstructured":"Massey, J.L.: Guessing and entropy. In: Proceedings of ISIT 1994, p. 204 (1994)","DOI":"10.1109\/ISIT.1994.394764"},{"key":"3_CR44","unstructured":"Moshkovitz, D.: An alternative proof of the Schwartz-Zippel lemma. In: Electronic Colloquium on Computational Complexity (ECCC), p. 96 (2010)"},{"key":"3_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"key":"3_CR46","doi-asserted-by":"crossref","unstructured":"Popa, R.A., et al.: CryptDB: protecting confidentiality with encrypted query processing. In: Proceedings of SOSP 2011, pp. 85\u2013100 (2011)","DOI":"10.1145\/2043556.2043566"},{"key":"3_CR47","unstructured":"Rabin, M.O.: Digitalized signatures and public-key functions as intractable as factorization. Technical report. MIT\/LCS\/TR-212, p. 12 (1979)"},{"key":"3_CR48","unstructured":"Ricosset, T.: HElib-MP. https:\/\/github.com\/tricosset\/HElib-MP"},{"issue":"2","key":"3_CR49","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., et al.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"issue":"11","key":"3_CR50","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., et al.: On data banks and privacy homomorphisms. Found. Secure Comput. 4(11), 169\u2013180 (1978)","journal-title":"Found. Secure Comput."},{"key":"3_CR51","volume-title":"An Introduction to Nonassociative Algebras","author":"RD Schafer","year":"1966","unstructured":"Schafer, R.D.: An Introduction to Nonassociative Algebras, vol. 22. Dover, New York (1966)"},{"key":"3_CR52","unstructured":"Stephen, J.J., et al.: Practical confidentiality preserving big data analysis. In: Proceedings of HotCloud 2014, p. 10 (2014)"},{"key":"3_CR53","doi-asserted-by":"crossref","unstructured":"Tetali, S.D., et al.: MRCrypt: static analysis for secure cloud computations. In: Proceedings of OOPSLA 2013, pp. 271\u2013286 (2013)","DOI":"10.1145\/2509136.2509554"},{"key":"3_CR54","unstructured":"Thomson, I.: Microsoft researchers smash homomorphic encryption speed barrier, 9 February 2016. https:\/\/www.theregister.co.uk\/2016\/02\/09\/researchers_break_homomorphic_encryption\/"},{"key":"3_CR55","doi-asserted-by":"crossref","unstructured":"Varia, M., et al.: HETest: a homomorphic encryption testing framework. Cryptology ePrint Archive: 2015\/416 (2015)","DOI":"10.1007\/978-3-662-48051-9_16"},{"key":"3_CR56","unstructured":"Vivek, S.: Homomorphic encryption API software library, 21 February 2017. http:\/\/heat-h2020-project.blogspot.co.uk\/2017\/02\/homomorphic-encryptionapi-software.html"},{"issue":"2","key":"3_CR57","first-page":"288","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)","journal-title":"Stud. Sci. Math. Hung."},{"key":"3_CR58","unstructured":"Yu, A., et al.: Efficient integer vector homomorphic encryption (2015). https:\/\/courses.csail.mit.edu\/6.857\/2015\/files\/yu-lai-payor.pdf"},{"key":"3_CR59","doi-asserted-by":"crossref","unstructured":"Zhou, H., Wornell, G.: Efficient homomorphic encryption on integer vectors and its applications. In: Proceedings of ITA 2014, pp. 1\u20139 (2014)","DOI":"10.1109\/ITA.2014.6804228"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71045-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T13:52:23Z","timestamp":1751032343000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-71045-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319710440","9783319710457"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71045-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}