{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:40:02Z","timestamp":1759365602493,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032067531","type":"print"},{"value":"9783032067548","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-06754-8_16","type":"book-chapter","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T08:23:46Z","timestamp":1759307026000},"page":"425-449","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Rhizomes and\u00a0the\u00a0Roots of\u00a0Efficiency\u2014Improving Prio"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5502-8666","authenticated-orcid":false,"given":"Armando","family":"Faz-Hernandez","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,2]]},"reference":[{"key":"16_CR1","unstructured":"Aas, J., Geoghegan, T.: Introducing ISRG Prio services for privacy respecting metrics. Technical report, Internet Security Research Group (2020). https:\/\/www.abetterinternet.org\/post\/introducing-prio-services\/"},{"key":"16_CR2","unstructured":"Aas, J., Gran, S.: ISRG prio services for preserving privacy in COVID\u00a019 EN apps. Technical report, Internet Security Research Group (2021). https:\/\/www.abetterinternet.org\/post\/prio-services-for-covid-en\/"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Addanki, S., Garbe, K., Jaffe, E., Ostrovsky, R., Polychroniadou, A.: Prio+: privacy preserving aggregate statistics via Boolean shares. In: Galdi, C., Jarecki, S. (eds.) SCN 2022. LNCS, vol. 13409, pp. 516\u2013539. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14791-3_23","DOI":"10.1007\/978-3-031-14791-3_23"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Anderson, E., Chase, M., Durak, F.B., Laine, K., Weng, C.: Precio: private aggregate measurement via oblivious shuffling. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, CCS 2024, pp. 1819\u20131833. Association for Computing Machinery, New York (2024). https:\/\/doi.org\/10.1145\/3658644.3670280","DOI":"10.1145\/3658644.3670280"},{"key":"16_CR5","unstructured":"Aparicio, J., Heisler, B.: Criterion.rs: statistics-driven microbenchmarking in rust (2025). https:\/\/github.com\/bheisler\/criterion.rs. Version 0.7.0"},{"key":"16_CR6","unstructured":"Barnes, R., Cook, D., Patton, C., Schoppmann, P.: Verifiable distributed aggregation functions. Internet-Draft draft-irtf-cfrg-vdaf-15, Internet Engineering Task Force (2025). https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-vdaf\/15. Work in Progress"},{"key":"16_CR7","unstructured":"Barnes, R., Patton, C., Schoppmann, P.: Verifiable distributed aggregation functions. Internet-Draft draft-irtf-cfrg-vdaf-03, Internet Engineering Task Force (2022). https:\/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-vdaf\/03\/. Work in Progress"},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Barry, P.J., Goldman, R.N.: Interpolation and approximation of curves and surfaces using P\u00f3lya polynomials. CVGIP: Graph. Models Image Process. 53(2), 137\u2013148 (1991). https:\/\/doi.org\/10.1016\/1049-9652(91)90057-Q","DOI":"10.1016\/1049-9652(91)90057-Q"},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Barry, P.J., Goldman, R.N.: Chapter 2: algorithms for progressive curves: extending B-spline and blossoming techniques to the monomial, power, and newton dual bases. In: Goldman, R.N., Lyche, T. (eds.) Knot Insertion and Deletion Algorithms for B-Spline Curves and Surfaces, chap.\u00a02, p. 11\u201363. Other Titles in Applied Mathematics (1992). https:\/\/doi.org\/10.1137\/1.9781611971583.ch2","DOI":"10.1137\/1.9781611971583.ch2"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0021-9045(91)90109-N","volume":"65","author":"PJ Barry","year":"1991","unstructured":"Barry, P.J., Goldman, R.N., DeRose, T.D.: B-splines, P\u00f3lya curves, and duality. J. Approx. Theory 65(1), 3\u201321 (1991). https:\/\/doi.org\/10.1016\/0021-9045(91)90109-N","journal-title":"J. Approx. Theory"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-26954-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"D Boneh","year":"2019","unstructured":"Boneh, D., Boyle, E., Corrigan-Gibbs, H., Gilboa, N., Ishai, Y.: Zero-knowledge proofs on secret-shared data via fully linear PCPs. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 67\u201397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_3"},{"key":"16_CR12","unstructured":"Burden, R.L., Faires, .D.: Numerical Analysis, 9th edn. Brooks\/Cole, Cengage Learning (2010). https:\/\/faculty.cengage.com\/works\/9781305253667"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"291","DOI":"10.2307\/1995359","volume":"142","author":"SA Cook","year":"1969","unstructured":"Cook, S.A., Aanderaa, S.O.: On the minimum computation time of functions. Trans. Am. Math. Soc. 142, 291\u2013314 (1969). https:\/\/doi.org\/10.2307\/1995359","journal-title":"Trans. Am. Math. Soc."},{"issue":"90","key":"16_CR14","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/2003354","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19(90), 297\u2013301 (1965). https:\/\/doi.org\/10.2307\/2003354","journal-title":"Math. Comput."},{"key":"16_CR15","unstructured":"Corrigan-Gibbs, H., Boneh, D.: Prototype implementation of Prio, a system for the private computation of aggregate statistics. https:\/\/github.com\/henrycg\/prio"},{"key":"16_CR16","unstructured":"Corrigan-Gibbs, H., Boneh, D.: Prio: private, robust, and scalable computation of aggregate statistics. In: 14th USENIX Symposium on Networked Systems Design and Implementation (NSDI 17), pp. 259\u2013282. USENIX Association, Boston (2017). https:\/\/www.usenix.org\/conference\/nsdi17\/technical-sessions\/presentation\/corrigan-gibbs"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Davis, H., Patton, C., Rosulek, M., Schoppmann, P.: Verifiable distributed aggregation functions. Proc. Priv. Enhanc. Technol. (PoPETs) 2023(4), 578\u2013592 (2023). https:\/\/doi.org\/10.56553\/popets-2023-0126","DOI":"10.56553\/popets-2023-0126"},{"key":"16_CR18","unstructured":"Divvi Up: libprio-rs: Implementation of Prio in Rust (2025). https:\/\/github.com\/divviup\/libprio-rs. Version 0.17.0-alpha.0"},{"key":"16_CR19","unstructured":"Englehardt, S.: Next steps in privacy-preserving telemetry with Prio. Technical report, Mozilla Security Blog (2019). https:\/\/blog.mozilla.org\/security\/2019\/06\/06\/next-steps-in-privacy-preserving-telemetry-with-prio\/"},{"key":"16_CR20","doi-asserted-by":"publisher","unstructured":"Farin, G.: Chapter 2 - Introductory material. In: Farin, G. (ed.) Curves and Surfaces for Computer-Aided Geometric Design, 3rd edn., p. 13\u201328. Academic Press, Boston (1993). https:\/\/doi.org\/10.1016\/B978-0-12-249052-1.50007-6","DOI":"10.1016\/B978-0-12-249052-1.50007-6"},{"key":"16_CR21","unstructured":"Fog, A.: Instruction tables: lists of instruction latencies, throughputs and micro-operation breakdowns for Intel, AMD, and VIA CPUs (2025). https:\/\/www.agner.org\/optimize\/instruction_tables.pdf"},{"issue":"8","key":"16_CR22","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1002\/nla.450","volume":"12","author":"W Gander","year":"2005","unstructured":"Gander, W.: Change of basis in polynomial interpolation. Numer. Linear Algebra Appl. 12(8), 769\u2013778 (2005). https:\/\/doi.org\/10.1002\/nla.450","journal-title":"Numer. Linear Algebra Appl."},{"key":"16_CR23","doi-asserted-by":"publisher","unstructured":"Gentleman, W.M., Sande, G.: Fast Fourier transforms: for fun and profit. In: Fall Joint Computer Conference, AFIPS 1966 (Fall), vol.\u00a029, pp. 563\u2013578. Association for Computing Machinery, New York (1966). https:\/\/doi.org\/10.1145\/1464291.1464352","DOI":"10.1145\/1464291.1464352"},{"key":"16_CR24","unstructured":"Geoghegan, T., Patton, C., Rescorla, E., Wood, C.A.: Standardizing MPC for privacy preserving measurement. In: Real World Crypto Symposium 2022 (2022). https:\/\/rwc.iacr.org\/2022\/"},{"key":"16_CR25","unstructured":"Geoghegan, T., Raykova, M., Jacobs, F.: Exposure notifications private analytics. In: Real World Crypto Symposium 2022 (2022). https:\/\/rwc.iacr.org\/2022\/"},{"key":"16_CR26","unstructured":"Goldman, R.: Lecture 24: blending functions: an alternative approach to freeform curves and surfaces. Technical report, Rice University (2004). https:\/\/www.clear.rice.edu\/comp360\/lectures\/old\/BasisFText.pdf"},{"key":"16_CR27","unstructured":"Helmer, R., Miyaguchi, A., Rescorla, E.: Testing privacy-preserving telemetry with Prio. Technical report, Mozilla Hacks (2018). https:\/\/hacks.mozilla.org\/2018\/10\/testing-privacy-preserving-telemetry-with-prio\/"},{"key":"16_CR28","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1098\/rstl.1819.0023","volume":"109","author":"WG Horner","year":"1819","unstructured":"Horner, W.G.: A new method of solving numerical equations of all orders, by continuous approximation. Philos. Trans. Roy. Soc. London 109, 308\u2013335 (1819). https:\/\/doi.org\/10.1098\/rstl.1819.0023","journal-title":"Philos. Trans. Roy. Soc. London"},{"key":"16_CR29","unstructured":"IETF Security Area: Privacy Preserving Measurement (Working Group) (2022). https:\/\/datatracker.ietf.org\/wg\/ppm\/"},{"key":"16_CR30","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BFb0087899","volume-title":"Computational Methods and Function Theory","author":"KG Ivanov","year":"1990","unstructured":"Ivanov, K.G., Saff, E.B.: Behavior of the lagrange interpolants in the roots of unity. In: Ruscheweyh, S., Saff, E.B., Salinas, L.C., Varga, R.S. (eds.) Computational Methods and Function Theory. LNM, vol. 1435, pp. 81\u201387. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0087899"},{"issue":"7","key":"16_CR31","first-page":"595","volume":"7","author":"A Karatsuba","year":"1963","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers on automata. Sov. Phys. Dokl. 7(7), 595\u2013596 (1963)","journal-title":"Sov. Phys. Dokl."},{"issue":"177","key":"16_CR32","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/s0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Math. Comput. 48(177), 243\u2013264 (1987). https:\/\/doi.org\/10.1090\/s0025-5718-1987-0866113-7","journal-title":"Math. Comput."},{"key":"16_CR33","unstructured":"Mozilla: libprio - A Prio library in C using NSS (2020). https:\/\/github.com\/mozilla\/libprio. Version 1.6"},{"key":"16_CR34","unstructured":"OEIS Foundation Inc.: Proth primes, Entry A080076. In: The on-line encyclopedia of integer sequences (2025). https:\/\/oeis.org\/A080076"},{"key":"16_CR35","unstructured":"Patton, C., Galicer, M.: Privacy-preserving measurement and machine learning. Technical report, The Cloudflare Blog (2023). https:\/\/blog.cloudflare.com\/deep-dive-privacy-preserving-measurement"},{"issue":"114","key":"16_CR36","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1090\/S0025-5718-1971-0301966-0","volume":"25","author":"JM Pollard","year":"1971","unstructured":"Pollard, J.M.: The fast Fourier transform in a finite field. Math. Comput. 25(114), 365\u2013374 (1971). https:\/\/doi.org\/10.1090\/S0025-5718-1971-0301966-0","journal-title":"Math. Comput."},{"key":"16_CR37","doi-asserted-by":"publisher","unstructured":"P\u00f3lya, G., Szeg\u00f6, G.: Problems and Theorems in Analysis II, Classics in Mathematics, vol.\u00a02, 1st edn. Springer, Heidelberg (1976). https:\/\/doi.org\/10.1007\/978-3-642-61905-2","DOI":"10.1007\/978-3-642-61905-2"},{"key":"16_CR38","doi-asserted-by":"publisher","unstructured":"Rutishauser, H.: Lectures on Numerical Mathematics, 1st edn. Birkh\u00e4user, Boston (1990). https:\/\/doi.org\/10.1007\/978-1-4612-3468-5","DOI":"10.1007\/978-1-4612-3468-5"},{"issue":"4","key":"16_CR39","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27(4), 701\u2013717 (1980). https:\/\/doi.org\/10.1145\/322217.322225","journal-title":"J. ACM"},{"key":"16_CR40","first-page":"496","volume":"150","author":"AL Toom","year":"1963","unstructured":"Toom, A.L.: The complexity of a scheme of functional elements realizing the multiplication of integers. Dokl. Akad. Nauk SSSR 150, 496\u2013498 (1963)","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"16_CR41","doi-asserted-by":"publisher","unstructured":"Warren, J.: An efficient algorithm for evaluating polynomials in the P\u00f3lya basis. In: Hagen, H., Farin, G., Noltemeier, H. (eds.) Geometric Modelling. Computing Supplement, vol.\u00a010, pp. 357\u2013361. Springer, Vienna (1995). https:\/\/doi.org\/10.1007\/978-3-7091-7584-2_24","DOI":"10.1007\/978-3-7091-7584-2_24"},{"issue":"4","key":"16_CR42","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1145\/321420.321438","volume":"14","author":"S Winograd","year":"1967","unstructured":"Winograd, S.: On the time required to perform multiplication. J. ACM 14(4), 793\u2013802 (1967). https:\/\/doi.org\/10.1145\/321420.321438","journal-title":"J. ACM"},{"key":"16_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-06754-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T08:23:53Z","timestamp":1759307033000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06754-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,2]]},"ISBN":["9783032067531","9783032067548"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06754-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,2]]},"assertion":[{"value":"2 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The author has no conflicts of interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"LATINCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Information Security in Latin America","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Medell\u00edn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latincrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciencias.medellin.unal.edu.co\/eventos\/latincrypt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}