{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T17:12:06Z","timestamp":1767978726563,"version":"3.49.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319067339","type":"print"},{"value":"9783319067346","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06734-6_20","type":"book-chapter","created":{"date-parts":[[2014,5,21]],"date-time":"2014-05-21T00:22:02Z","timestamp":1400631722000},"page":"318-335","source":"Crossref","is-referenced-by-count":91,"title":["A Comparison of the Homomorphic Encryption Schemes FV and YASHE"],"prefix":"10.1007","author":[{"given":"Tancr\u00e8de","family":"Lepoint","sequence":"first","affiliation":[]},{"given":"Michael","family":"Naehrig","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Bansarkhani, R.E., Buchmann, J.: Improvement and efficient implementation of a lattice-based signature scheme. Cryptology ePrint Archive, Report 2013\/297 (2013), \n                    \n                      http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-662-43414-7_3"},{"key":"20_CR2","unstructured":"Beaulieu, R., Shors, D., Smith, J., Treatman-Clark, S., Weeks, B., Wingers, L.: The SIMON and SPECK families of lightweight block ciphers. Cryptology ePrint Archive, Report 2013\/404 (2013), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Bos, J.W., Lauter, K., Loftus, J., Naehrig, M.: Improved security for a ring-based fully homomorphic encryption scheme. In: Stam (ed.) [37], pp. 45\u201364","DOI":"10.1007\/978-3-642-45239-0_4"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"Z. Brakerski","year":"2012","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical gapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 868\u2013886. Springer, Heidelberg (2012)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (ed.) ITCS, pp. 309\u2013325. ACM (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"20_CR6","unstructured":"Canetti, R., Garay, J.A. (eds.): CRYPTO 2013, Part I. LNCS, vol.\u00a08042. Springer, Heidelberg (2013)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25385-0_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"Y. Chen","year":"2011","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: Better lattice security estimates. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 1\u201320. Springer, Heidelberg (2011)"},{"key":"20_CR8","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: Better lattice security estimates (2013), \n                    \n                      http:\/\/www.di.ens.fr\/~ychen\/research\/Full_BKZ.pdf"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Coron, J.-S., 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.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 315\u2013335. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-38348-9_20"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Coron, J.-S., Lepoint, T., Tibouchi, M.: Scale-invariant fully homomorphic encryption over the integers. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol.\u00a08383, pp. 311\u2013328. Springer, Heidelberg (2014)","DOI":"10.1007\/978-3-642-54631-0_18"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Coron, J.S., Naccache, D., Tibouchi, M.: Public key compression and modulus switching for fully homomorphic encryption over the integers. In: Pointcheval, Johansson (eds.) [34], pp. 446\u2013464","DOI":"10.1007\/978-3-642-29011-4_27"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 24\u201343. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Ducas, L., Durmus, A., Lepoint, T., Lyubashevsky, V.: Lattice signatures and bimodal gaussians. In: Canetti, Garay (eds.) [6], pp. 40\u201356","DOI":"10.1007\/978-3-642-40041-4_3"},{"key":"20_CR14","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. IACR Cryptology ePrint Archive\u00a02012, 144 (2012)"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N. Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 31\u201351. Springer, Heidelberg (2008)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) STOC, pp. 169\u2013178. ACM (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S.: mplementing Gentry\u2019s fully-homomorphic encryption scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 129\u2013148. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-20465-4_9"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead. In: Pointcheval, Johansson (eds.) [34] , pp. 465\u2013482","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Homomorphic evaluation of the AES circuit. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 850\u2013867. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-32009-5_49"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, Garay (eds.) [6], pp. 75\u201392","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Graepel, T., Lauter, K., Naehrig, M.: ML confidential: Machine learning on encrypted data. In: Kwon, T., Lee, M.-K., Kwon, D. (eds.) ICISC 2012. LNCS, vol.\u00a07839, pp. 1\u201321. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-37682-5_1"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-38616-9_5","volume-title":"Post-Quantum Cryptography","author":"T. G\u00fcneysu","year":"2013","unstructured":"G\u00fcneysu, T., Oder, T., P\u00f6ppelmann, T., Schwabe, P.: Software speed records for lattice-based signatures. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol.\u00a07932, pp. 67\u201382. Springer, Heidelberg (2013)"},{"key":"20_CR23","unstructured":"Hart, W.: et al.: Fast Library for Number Theory, Version 2.4 (2013), \n                    \n                      http:\/\/www.flintlib.org"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Lauter, K.E.: Practical applications of homomorphic encryption. In: Yu, T., Capkun, S., Kamara, S. (eds.) CCSW, pp. 57\u201358. ACM (2012)","DOI":"10.1145\/2381913.2381924"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Jr Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann.\u00a0261(4), 515\u2013534 (1982)","DOI":"10.1007\/BF01457454"},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"Lepoint, T.: A proof-of-concept implementation of the homomorphic evaluation of SIMON using FV and YASHE leveled homomorphic cryptosystems (2014), \n                    \n                      https:\/\/github.com\/tlepoint\/homomorphic-simon","DOI":"10.1007\/978-3-319-06734-6_20"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Lepoint, T., Naehrig, M.: A comparison of the homomorphic encryption schemes FV and YASHE (full version). Cryptology ePrint Archive, Report 2014\/062 (2014), \n                    \n                      http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-319-06734-6_20"},{"key":"20_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-19074-2_21","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"R. Lindner","year":"2011","unstructured":"Lindner, R., Peikert, C.: Better key sizes (and attacks) for LWE-based encryption. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol.\u00a06558, pp. 319\u2013339. Springer, Heidelberg (2011)"},{"key":"20_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-36095-4_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"M. Liu","year":"2013","unstructured":"Liu, M., Nguyen, P.Q.: Solving BDD by enumeration: An update. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol.\u00a07779, pp. 293\u2013309. Springer, Heidelberg (2013)"},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: STOC, pp. 1219\u20131234 (2012)","DOI":"10.1145\/2213977.2214086"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V. Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 1\u201323. Springer, Heidelberg (2010)"},{"key":"20_CR32","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 147\u2013191. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-540-88702-7_5"},{"key":"20_CR33","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Cachin, C., Ristenpart, T. (eds.) CCSW, pp. 113\u2013124. ACM (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"20_CR34","unstructured":"Pointcheval, D., Johansson, T. (eds.): EUROCRYPT 2012. LNCS, vol.\u00a07237. Springer, Heidelberg (2012)"},{"key":"20_CR35","doi-asserted-by":"crossref","unstructured":"van de Pol, J., Smart, N.P.: Estimating key sizes for high dimensional lattice-based systems. In: Stam (ed.) [37], pp. 290\u2013303","DOI":"10.1007\/978-3-642-45239-0_17"},{"key":"20_CR36","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C.P. Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: Improved practical algorithms and solving subset sum problems. Math. Program.\u00a066, 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"20_CR37","unstructured":"Stam, M. (ed.): IMACC 2013. LNCS, vol.\u00a08308. Springer, Heidelberg (2013)"},{"key":"20_CR38","doi-asserted-by":"crossref","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Making NTRU as secure as worst-case problems over ideal lattices. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 27\u201347. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-20465-4_4"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2014"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06734-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:46:05Z","timestamp":1558305965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06734-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319067339","9783319067346"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06734-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}