{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T09:28:21Z","timestamp":1786440501914,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032354174","type":"print"},{"value":"9783032354181","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-35418-1_16","type":"book-chapter","created":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T08:33:48Z","timestamp":1786437228000},"page":"495-526","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast PCGs for\u00a0Batch-Authenticated Multiplication Triples"],"prefix":"10.1007","author":[{"given":"Elette","family":"Boyle","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Niv","family":"Gilboa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matan","family":"Hamilis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ariel","family":"Nof","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,8,12]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Abram, D., Scholl, P.: Low-communication multiparty triple generation for SPDZ from ring-LPN. In: Proceedings of the PKC 2022, pp. 221\u2013251 (2022)","DOI":"10.1007\/978-3-030-97121-2_9"},{"key":"16_CR2","unstructured":"Agarwal, A., Raghuraman, S., Rindal, P.: Fully distributed multi-point functions for PCGs and beyond (2025), cryptology ePrint Archive. Paper 2025\/2294"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-20465-4_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"R Bendlin","year":"2011","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic Encryption and Multiparty Computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 169\u2013188. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_11"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Bombar, M., et al.: FOLEAGE: $$\\mathbb{{F}}_{\\scriptstyle 4}$$OLE-based multi-party computation for Boolean circuits. In: Proceedings of the ASIACRYPT 2024, pp. 69\u2013101 (2024)","DOI":"10.1007\/978-981-96-0938-3_3"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Bombar, M., Couteau, G., Couvreur, A., Ducros, C.: Correlated pseudorandomness from the hardness of quasi-abelian decoding. In: Proceedings of the CRYPTO 2023, pp. 567\u2013601 (2023)","DOI":"10.1007\/978-3-031-38551-3_18"},{"key":"16_CR6","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_CR7","doi-asserted-by":"crossref","unstructured":"Bouillaguet, C., Delaplace, C., Hamdad, M., Vergnaud, D.: Practical cryptanalysis of pseudorandom correlation generators based on quasi-abelian syndrome decoding. In: Proceedings of the ASIACRYPT 2025, pp. 436\u2013465 (2025)","DOI":"10.1007\/978-981-95-5113-2_14"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: Proceedings of the CCS 2018, pp. 896\u2013912 (2018)","DOI":"10.1145\/3243734.3243868"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-26954-8_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Boyle","year":"2019","unstructured":"Boyle, E.: Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Efficient pseudorandom correlation generators from ring-LPN. In: Proceedings of the CRYPTO 2020, pp. 387\u2013416 (2020)","DOI":"10.1007\/978-3-030-56880-1_14"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Hamilis, M., Ishai, Y., Nof, A.: Preprocessing for life: Dishonest-majority MPC with a trusted or untrusted dealer. In: Proceedings of the IEEE S&P 2025, pp. 2433\u20132452 (2025)","DOI":"10.1109\/SP61157.2025.00041"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Hamilis, M., Ishai, Y., Tu, Y.: Improved constructions for distributed multi-point functions. In: Proceedings of the IEEE S&P 2025, pp. 2414\u20132432 (2025)","DOI":"10.1109\/SP61157.2025.00044"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-030-84245-1_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"E Boyle","year":"2021","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Sublinear GMW-Style Compiler for MPC with Preprocessing. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 457\u2013485. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_16"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Secure multiparty computation with sublinear preprocessing. In: Proceedings of the EUROCRYPT 2022, pp. 427\u2013457 (2022)","DOI":"10.1007\/978-3-031-06944-4_15"},{"issue":"3","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-021-09403-1","volume":"34","author":"SS Burra","year":"2021","unstructured":"Burra, S.S., et al.: High-performance multi-party computation for binary circuits based on oblivious transfer. J. Cryptol. 34(3), 1\u201387 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09403-1","journal-title":"J. Cryptol."},{"issue":"1","key":"16_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1007\/978-3-642-32009-5_38","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"I Damg\u00e5rd","year":"2012","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N., Zakarias, S.: Multiparty Computation from Somewhat Homomorphic Encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Genkin, D., Ishai, Y., Prabhakaran, M., Sahai, A., Tromer, E.: Circuits resilient to additive attacks with applications to secure computation. In: Proceedings of the STOC 2014, pp. 495\u2013504 (2014)","DOI":"10.1145\/2591796.2591861"},{"key":"16_CR19","doi-asserted-by":"publisher","unstructured":"Goel, A., Wang, M., Wang, Z.: Multiparty distributed point functions. In: Proceedings of the CRYPTO 2025. pp. 140\u2013173 (2025). https:\/\/doi.org\/10.1007\/978-3-032-01884-7_5","DOI":"10.1007\/978-3-032-01884-7_5"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of Cryptography, Volume 2: Basic Applications. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play ANY mental game, or, a completeness theorem for protocols with honest majority. In: Proceedings of the STOC 1987, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Peceny, S., Raghuraman, S., Rindal, P.: Stationary syndrome decoding for improved PCGs. In: Proceedings of the CRYPTO 2025, pp. 284\u2013317 (2025)","DOI":"10.1007\/978-3-032-01855-7_10"},{"key":"16_CR23","unstructured":"Li, J., Song, Y.: Malicious security comes free in SPDZ. Cryptology ePrint Archive, Paper 2026\/283 (2026). https:\/\/eprint.iacr.org\/2026\/283"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Li, Z., Xing, C., Yao, Y., Yuan, C.: Efficient pseudorandom correlation generators for any finite field. In: Proceedings of the EUROCRYPT 2025, pp. 145\u2013175 (2025)","DOI":"10.1007\/978-3-031-91092-0_6"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Li, Z., Xing, C., Yao, Y., Yuan, C.: Efficient pseudorandom correlation generators over $${Z}\/p^k$$. In: CRYPTO 2025, pp. 207\u2013240. (2025)","DOI":"10.1007\/978-3-032-01884-7_7"},{"key":"16_CR26","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-032-26734-4_9","volume-title":"Public-Key Cryptography - PKC 2026","author":"Z Li","year":"2026","unstructured":"Li, Z., Xing, C., Yao, Y., Yuan, C.: On the power of sumcheck in secure multiparty computation. In: Bai, S., Persichetti, E. (eds.) Public-Key Cryptography - PKC 2026, pp. 257\u2013287. Springer Nature Switzerland, Cham (2026)"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-642-32009-5_40","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"JB Nielsen","year":"2012","unstructured":"Nielsen, J.B., Nordholt, P.S., Orlandi, C., Burra, S.S.: A New Approach to Practical Active-Secure Two-Party Computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 681\u2013700. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_40"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-35418-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T08:34:00Z","timestamp":1786437240000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-35418-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032354174","9783032354181"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-35418-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"12 August 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"46","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}