{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:23:10Z","timestamp":1742912590479,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030354220"},{"type":"electronic","value":"9783030354237"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35423-7_20","type":"book-chapter","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:02:46Z","timestamp":1575849766000},"page":"398-411","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting Approximate Polynomial Common Divisor Problem and Noisy Multipolynomial Reconstruction"],"prefix":"10.1007","author":[{"given":"Jun","family":"Xu","sequence":"first","affiliation":[]},{"given":"Santanu","family":"Sarkar","sequence":"additional","affiliation":[]},{"given":"Lei","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,19]]},"reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45539-6_4","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"D Bleichenbacher","year":"2000","unstructured":"Bleichenbacher, D., Nguyen, P.Q.: Noisy polynomial interpolation and noisy Chinese remaindering. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 53\u201369. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_4"},{"key":"20_CR2","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., et al.: 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). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_20"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-662-46800-5_20","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"JH Cheon","year":"2015","unstructured":"Cheon, J.H., Stehl\u00e9, D.: Fully homomorphic encryption over the integers revisited. In: Oswald, E., Fischlin, M. (eds.) Advances in Cryptology - EUROCRYPT 2015. Lecture Notes in Computer Science, vol. 9056, pp. 513\u2013536. Springer, Berlin Heidelberg (2015)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ins.2015.07.021","volume":"326","author":"JH Cheon","year":"2016","unstructured":"Cheon, J.H., Hong, H., Lee, M.S., Ryu, H.: The polynomial approximate common divisor problem and its application to the fully homomorphic encryption. Inf. Sci. 326, 41\u201358 (2016)","journal-title":"Inf. Sci."},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.2140\/obs.2013.1.271","volume":"1","author":"H Cohn","year":"2013","unstructured":"Cohn, H., Heninger, N.: Approximate common divisors via lattices. Open Book Ser. 1(1), 271\u2013293 (2013)","journal-title":"Open Book Ser."},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.3934\/amc.2015.9.311","volume":"9","author":"H Cohn","year":"2015","unstructured":"Cohn, H., Heninger, N.: Ideal forms of Coppersmith\u2019s theorem and Guruswami-Sudan list decoding. Adv. Math. Comm. 9(3), 311\u2013339 (2015)","journal-title":"Adv. Math. Comm."},{"issue":"4","key":"20_CR7","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)","journal-title":"J. Cryptol."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Corless, R.M., Gianni, P.M., Trager, B.M., Watt, S.M.: The singular value decomposition for polynomial systems. In: Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, pp. 195\u2013207. ACM (1995)","DOI":"10.1145\/220346.220371"},{"issue":"12","key":"20_CR9","doi-asserted-by":"publisher","first-page":"3394","DOI":"10.1109\/TSP.2004.837413","volume":"52","author":"RM Corless","year":"2004","unstructured":"Corless, R.M., Watt, S.M., Zhi, L.: QR factoring to compute the GCD of univariate approximate polynomials. IEEE Trans. Sig. Process. 52(12), 3394\u20133402 (2004)","journal-title":"IEEE Trans. Sig. Process."},{"key":"20_CR10","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). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_18"},{"key":"20_CR11","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":"20_CR12","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). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_27"},{"key":"20_CR13","unstructured":"Devet, C., Goldberg, I., Heninger, N.: Optimally robust private information retrieval. In: Proceedings of the 21st USENIX Conference on Security Symposium, Security 2012, Berkeley, CA, USA, p. 13. USENIX Association (2012)"},{"key":"20_CR14","unstructured":"Elia\u0161, J.: Approximate polynomial greatest common divisor. Ph.D. thesis, Master thesis, Charles University in Prague (2012)"},{"key":"20_CR15","first-page":"323","volume":"32","author":"IZ Emiris","year":"1996","unstructured":"Emiris, I.Z., Galligo, A., Lombardi, H.: Numerical univariate polynomial GCD. Lect. Appl. Math. Am. Math. Soc. 32, 323\u2013344 (1996)","journal-title":"Lect. Appl. Math. Am. Math. Soc."},{"key":"20_CR16","unstructured":"Giesbrecht, M., Haraldson, J., Kaltofen, E.: Computing approximate greatest common right divisors of differential polynomials (2017). CoRR, abs\/1701.01994"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Giorgi, P., Jeannerod, C.-P., Villard, G.: On the complexity of polynomial matrix computations. In: Proceedings of Symbolic and Algebraic Computation, International Symposium, ISSAC 2003, Drexel University, Philadelphia, Pennsylvania, USA, 3\u20136 August 2003, pp. 135\u2013142 (2003)","DOI":"10.1145\/860854.860889"},{"issue":"1","key":"20_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/TIT.2007.911222","volume":"54","author":"V Guruswami","year":"2008","unstructured":"Guruswami, V., Rudra, A.: Explicit codes achieving list decoding capacity: error-correction with optimal redundancy. IEEE Trans. Inf. Theory 54(1), 135\u2013150 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"20_CR19","doi-asserted-by":"publisher","first-page":"1757","DOI":"10.1109\/18.782097","volume":"45","author":"V Guruswami","year":"1999","unstructured":"Guruswami, V., Sudan, M.: Improved decoding of Reed-Solomon and algebraic-geometry codes. IEEE Trans. Inf. Theory 45(6), 1757\u20131767 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"20_CR20","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1093\/imamci\/dns032","volume":"30","author":"G Halikias","year":"2013","unstructured":"Halikias, G., Galanis, G., Karcanias, N., Milonidis, E.: Nearest common root of polynomials, approximate greatest common divisor and the structured singular value. IMA J. Math. Control Inf. 30(4), 423\u2013442 (2013)","journal-title":"IMA J. Math. Control Inf."},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Hough, D.G.: Explaining and ameliorating the ILL condition of zeros of polynomials. Ph.D. thesis (1977). AAI7731401","DOI":"10.21236\/ADA040476"},{"key":"20_CR22","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"},{"issue":"6","key":"20_CR23","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1006\/jsco.1997.0160","volume":"24","author":"V Hribernig","year":"1997","unstructured":"Hribernig, V., Stetter, H.J.: Detection and validation of clusters of polynomial zeros. J. Symb. Comput. 24(6), 667\u2013681 (1997)","journal-title":"J. Symb. Comput."},{"key":"20_CR24","volume-title":"Linear Systems","author":"T Kailath","year":"1980","unstructured":"Kailath, T.: Linear Systems, vol. 156. Prentice-Hall, Englewood Cliffs (1980)"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Yang, Z., Zhi, L.: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. In: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, pp. 169\u2013176. ACM (2006)","DOI":"10.1145\/1145768.1145799"},{"issue":"6","key":"20_CR26","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1006\/jsco.1998.0232","volume":"26","author":"NK Karmarkar","year":"1998","unstructured":"Karmarkar, N.K., Lakshman, Y.N.: On approximate GCDs of univariate polynomials. J. Symb. Comput. 26(6), 653\u2013666 (1998)","journal-title":"J. Symb. Comput."},{"issue":"4","key":"20_CR27","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lovasz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"20_CR28","unstructured":"Morrison, K.E.: Random polynomials over finite fields. https:\/\/web.calpoly.edu\/~kmorriso\/Research\/RPFF.pdf"},{"issue":"4","key":"20_CR29","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0747-7171(02)00139-6","volume":"35","author":"T Mulders","year":"2003","unstructured":"Mulders, T., Storjohann, A.: On lattice reduction for polynomial matrices. J. Symb. Comput. 35(4), 377\u2013401 (2003)","journal-title":"J. Symb. Comput."},{"key":"20_CR30","doi-asserted-by":"crossref","unstructured":"Naor, M., Pinkas, B.: Oblivious transfer and polynomial evaluation. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, STOC 1999, New York, NY, USA, pp. 245\u2013254. ACM (1999)","DOI":"10.1145\/301250.301312"},{"key":"20_CR31","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 Nguyen","year":"2001","unstructured":"Nguyen, P.Q., Stern, J.: The two faces of lattices in cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol. 2146, pp. 146\u2013180. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44670-2_12"},{"issue":"1\u20133","key":"20_CR32","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0377-0427(91)90180-R","volume":"38","author":"M-T Noda","year":"1991","unstructured":"Noda, M.-T., Sasaki, T.: Approximate GCD and its application to ill-conditioned equations. J. Comput. Appl. Math. 38(1\u20133), 335\u2013351 (1991)","journal-title":"J. Comput. Appl. Math."},{"key":"20_CR33","unstructured":"Pan, V.Y.: Numerical computation of a polynomial GCD and extensions. Ph.D. thesis, Inria (1996)"},{"key":"20_CR34","unstructured":"Parvaresh, F., Vardy, A.: Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In: Proceedings of 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23\u201325 October 2005, Pittsburgh, PA, USA, pp. 285\u2013294 (2005)"},{"key":"20_CR35","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2005, New York, NY, USA, pp. 84\u201393. ACM (2005)","DOI":"10.1145\/1060590.1060603"},{"issue":"1","key":"20_CR36","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/0885-064X(85)90024-X","volume":"1","author":"A Sch\u00f6nhage","year":"1985","unstructured":"Sch\u00f6nhage, A.: Quasi-GCD computations. J. Complex. 1(1), 118\u2013137 (1985)","journal-title":"J. Complex."},{"key":"20_CR37","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 van Dijk","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"},{"issue":"4","key":"20_CR38","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1016\/j.cagd.2013.01.003","volume":"30","author":"JR Winkler","year":"2013","unstructured":"Winkler, J.R., Yang, N.: Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials. Comput. Aided Geom. Des. 30(4), 410\u2013429 (2013)","journal-title":"Comput. Aided Geom. Des."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 INDOCRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35423-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:45:59Z","timestamp":1709833559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35423-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030354220","9783030354237"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35423-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hyderabad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isical.ac.in\/~indocrypt2019\/#\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"90","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.67","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Please note that there were 110 submissions, but 20 were not peer-reviewed because they were withdrawn before the deadline or they violated the submission policy.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}