{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:13Z","timestamp":1772283673454,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662479889","type":"print"},{"value":"9783662479896","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-47989-6_27","type":"book-chapter","created":{"date-parts":[[2015,7,30]],"date-time":"2015-07-30T22:36:05Z","timestamp":1438295765000},"page":"561-580","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Cryptanalysis of the Co-ACD Assumption"],"prefix":"10.1007","author":[{"given":"Pierre-Alain","family":"Fouque","sequence":"first","affiliation":[]},{"given":"Moon Sung","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Tancr\u00e8de","family":"Lepoint","sequence":"additional","affiliation":[]},{"given":"Mehdi","family":"Tibouchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,1]]},"reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-54631-0_11","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"J Bi","year":"2014","unstructured":"Bi, J., Coron, J.-S., Faug\u00e8re, J.-C., Nguyen, P.Q., Renault, G., Zeitoun, R.: Rounding and chaining LLL: finding faster small roots of univariate polynomial congruences. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 185\u2013202. Springer, Heidelberg (2014)"},{"key":"27_CR2","first-page":"19","volume":"4, 01.2.2","author":"KA Broughan","year":"2001","unstructured":"Broughan, K.A.: The gcd-sum function. J. Integer Sequences 4, 01.2.2, 19 (2001)","journal-title":"The gcd-sum function. J. Integer Sequences"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","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":"JH Cheon","year":"2013","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. 7881, pp. 315\u2013335. Springer, Heidelberg (2013)"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Cohn, H., Heninger, N.: Approximate common divisors via lattices. In: ANTS X (2012)","DOI":"10.2140\/obs.2013.1.271"},{"key":"27_CR5","first-page":"287","volume-title":"ACM CCS","author":"JH Cheon","year":"2014","unstructured":"Cheon, J.H., Lee, H.T., Seo, J.H.: A new additive homomorphic encryption based on the Co-ACD problem. In: Ahn, G.-J., Yung, M., Li, N. (eds.) ACM CCS, pp. 287\u2013298. ACM, New York (2014)"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-40041-4_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"J-S Coron","year":"2013","unstructured":"Coron, J.-S., Lepoint, T., Tibouchi, M.: Practical multilinear maps over the integers. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 476\u2013493. Springer, Heidelberg (2013)"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-54631-0_18","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"J-S Coron","year":"2014","unstructured":"Coron, J.-S., Lepoint, T., Tibouchi, M.: Scale-invariant fully homomorphic encryption over the integers. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 311\u2013328. Springer, Heidelberg (2014)"},{"key":"27_CR8","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. 7073, pp. 1\u201320. Springer, Heidelberg (2011)"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-29011-4_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"Y Chen","year":"2012","unstructured":"Chen, Y., Nguyen, P.Q.: Faster algorithms for approximate common divisors: breaking fully-homomorphic-encryption challenges over the integers. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 502\u2013519. Springer, Heidelberg (2012)"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-11925-5_15","volume-title":"Topics in Cryptology - CT-RSA 2010","author":"J-S Coron","year":"2010","unstructured":"Coron, J.-S., Naccache, D., Tibouchi, M.: Fault attacks against emv signatures. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol. 5985, pp. 208\u2013220. Springer, Heidelberg (2010)"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-642-29011-4_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"J-S Coron","year":"2012","unstructured":"Coron, J.-S., Naccache, D., Tibouchi, M.: Public key compression and modulus switching for fully homomorphic encryption over the integers. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 446\u2013464. Springer, Heidelberg (2012)"},{"issue":"4","key":"27_CR12","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. Cryptology 10(4), 233\u2013260 (1997)","journal-title":"J. Cryptology"},{"key":"27_CR13","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)"},{"key":"27_CR14","unstructured":"Fouque, P.-A., Lee, M.S., Lepoint, T., Tibouchi, M.: Cryptanalysis of the Co-ACD assumption. Cryptology ePrint Archive. Full version of this paper, Report 2014\/1024 (2014). \n                      http:\/\/eprint.iacr.org\/"},{"key":"27_CR15","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, p. 51. Springer, Heidelberg (2001)"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-38348-9_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"M Joye","year":"2013","unstructured":"Joye, M., Libert, B.: Efficient cryptosystems from 2\n                      \n                        \n                      \n                      \n$$^\\text{ k }$$\n\n                      \n                        \n                          \n                            \n                              \n                              \n                            \n                            k\n                            \n                          \n                        \n                      \n                    -th power residue symbols. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 76\u201392. Springer, Heidelberg (2013)"},{"issue":"4","key":"27_CR17","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"27_CR18","doi-asserted-by":"crossref","unstructured":"Lepoint, T., Tibouchi, M.: Cryptanalysis of a (somewhat) additively homomorphic encryption scheme used in PIR. In: WAHC (2015)","DOI":"10.1007\/978-3-662-48051-9_14"},{"key":"27_CR19","unstructured":"May, A.: New RSA Vulnerabilities Using Lattice Reduction Methods. Ph.D. thesis, University of Paderborn (2003)"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-88702-7_5","volume-title":"Post-Quantum Cryptography","author":"D Micciancio","year":"2009","unstructured":"Micciancio, D., Regev, O.: Lattice-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 147\u2013191. Springer, Berlin (2009)"},{"key":"27_CR21","first-page":"19","volume-title":"The LLL Algorithm, Information Security and Cryptography","author":"PQ Nguyen","year":"2010","unstructured":"Nguyen, P.Q.: Hermite\u2019s constant and lattice algorithms. In: Nguyen, P.Q., Vall\u00e9e, B. (eds.) The LLL Algorithm, Information Security and Cryptography, pp. 19\u201369. Springer, Berlin (2010)"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Naehrig, M., Lauter, K.E., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: Cachin, C., Ristenpart, T. (eds), ACM CCSW, pp. 113\u2013124, ACM (2011)","DOI":"10.1145\/2046660.2046682"},{"key":"27_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/BFb0052236","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"PQ Nguy\u00ean","year":"1997","unstructured":"Nguy\u00ean, P.Q., Stern, J.: Merkle-hellman revisited: a cryptanalysis of the qu-vanstone cryptosystem based on group factorizations. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 198\u2013212. Springer, Heidelberg (1997)"},{"key":"27_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/3-540-49649-1_29","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"PQ Nguy\u00ean","year":"1998","unstructured":"Nguy\u00ean, P.Q., Stern, J.: The b\u00e9guin-quisquater server-aided RSA protocol from crypto 1995 is not secure. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 372\u2013379. Springer, Heidelberg (1998)"},{"key":"27_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-48892-8_17","volume-title":"Selected Areas in Cryptography","author":"PQ Nguy\u00ean","year":"1999","unstructured":"Nguy\u00ean, P.Q., Stern, J.: Cryptanalysis of a fast public key cryptosystem presented at SAC 1997. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol. 1556, p. 213. Springer, Heidelberg (1999)"},{"key":"27_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-48405-1_3","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"PQ Nguy\u00ean","year":"1999","unstructured":"Nguy\u00ean, P.Q., Stern, J.: The hardness of the hidden subset sum problem and its cryptographic implications. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, p. 31. Springer, Heidelberg (1999)"},{"key":"27_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-44670-2_12","volume-title":"Cryptography and Lattices","author":"PQ Nguy\u00ean","year":"2001","unstructured":"Nguy\u00ean, P.Q., Stern, J.: The two faces of lattices in cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, p. 146. Springer, Heidelberg (2001)"},{"key":"27_CR28","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-29656-7_12","volume-title":"Fault Analysis in Cryptography, Information Security and Cryptography","author":"PQ Nguyen","year":"2012","unstructured":"Nguyen, P.Q., Tibouchi, M.: Lattice-based fault attacks on signatures. In: Joye, M., Tunstall, M. (eds.) Fault Analysis in Cryptography, Information Security and Cryptography, pp. 201\u2013220. Springer, Berlin (2012)"},{"key":"27_CR29","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 - EUROCRYPT \u201999","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, p. 223. Springer, Heidelberg (1999)"},{"key":"27_CR30","unstructured":"Stein, W. et al.: Sage Mathematics Software (Version 6.4). The Sage Development Team (2014). \n                      http:\/\/www.sagemath.org"},{"key":"27_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-45239-0_17","volume-title":"Cryptography and Coding","author":"J Pol van de","year":"2013","unstructured":"van de Pol, J., Smart, N.P.: Estimating key sizes for high dimensional lattice-based systems. In: Stam, M. (ed.) IMACC 2013. LNCS, vol. 8308, pp. 290\u2013303. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology -- CRYPTO 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-47989-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,9]],"date-time":"2019-08-09T20:05:52Z","timestamp":1565381152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-47989-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662479889","9783662479896"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-47989-6_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"1 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}