{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T15:54:52Z","timestamp":1783007692794,"version":"3.54.5"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031910913","type":"print"},{"value":"9783031910920","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-91092-0_6","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T12:58:00Z","timestamp":1745758680000},"page":"145-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Efficient Pseudorandom Correlation Generators for\u00a0Any Finite Field"],"prefix":"10.1007","author":[{"given":"Zhe","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chaoping","family":"Xing","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yizhou","family":"Yao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chen","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Agarwal, A., Boyle, E., Gilboa, N., Ishai, Y., Kelkar, M., Ma, Y.: Compressing unit-vector correlations via sparse pseudorandom generators. In: CRYPTO 2024. LNCS, vol. 14927, pp. 346\u2013383. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-68397-8_11","DOI":"10.1007\/978-3-031-68397-8_11"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: CRYPTO \u201991. LNCS, vol.\u00a0576, pp. 420\u2013432. Springer (1991). https:\/\/doi.org\/10.1007\/3-540-46766-1_34","DOI":"10.1007\/3-540-46766-1_34"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-030-21568-2_26","volume-title":"Applied Cryptography and Network Security","author":"A Ben-Efraim","year":"2019","unstructured":"Ben-Efraim, A., Nielsen, M., Omri, E.: Turbospeedz: double your online SPDZ! improving SPDZ using function dependent preprocessing. In: Deng, R.H., Gauthier-Uma\u00f1a, V., Ochoa, M., Yung, M. (eds.) ACNS 2019. LNCS, vol. 11464, pp. 530\u2013549. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-21568-2_26"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Blum, A., Furst, M.L., Kearns, M.J., Lipton, R.J.: Cryptographic primitives based on hard learning problems. In: CRYPTO 1993. LNCS, vol.\u00a0773, pp. 278\u2013291. Springer (1993). https:\/\/doi.org\/10.1007\/3-540-48329-2_24","DOI":"10.1007\/3-540-48329-2_24"},{"key":"6_CR5","unstructured":"Bombar, M.: Estimator complexity for the $$\\mathbb{F}_{4}$$OLEAGE PCG (2024). https:\/\/github.com\/mbombar\/estimator_folding"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Bombar, M., Bui, D., Couteau, G., Couvreur, A., Ducros, C., Servan-Schreiber, S.: FOLEAGE: $$\\mathbb{F}_{4}$$OLE-Based Multi-Party Computation for Boolean Circuits. In: ASIACRYPT 2024. LNCS, vol. 15489, pp. 69\u2013101. Springer (2024). https:\/\/doi.org\/10.1007\/978-981-96-0938-3_3","DOI":"10.1007\/978-981-96-0938-3_3"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Bombar, M., Couteau, G., Couvreur, A., Ducros, C.: Correlated pseudorandomness from the hardness of quasi-abelian decoding. In: CRYPTO 2023. LNCS, vol. 14084, pp. 567\u2013601. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_18","DOI":"10.1007\/978-3-031-38551-3_18"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: CCS 2018, pp. 896\u2013912. ACM (2018)","DOI":"10.1145\/3243734.3243868"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Boyle, E., et al.: Correlated pseudorandomness from expand-accumulate codes. In: CRYPTO 2022. LNCS, vol. 13508, pp. 603\u2013633. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_21","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Boyle, E., et al.: Oblivious transfer with constant computational overhead. In: EUROCRYPT 2023. LNCS, vol. 14004, pp. 271\u2013302. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_10","DOI":"10.1007\/978-3-031-30545-0_10"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: CCS 2019, pp. 291\u2013308. ACM (2019)","DOI":"10.1145\/3319535.3354255"},{"key":"6_CR12","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., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: 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":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-56880-1_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"E Boyle","year":"2020","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient\u00a0pseudorandom\u00a0correlation\u00a0generators from ring-LPN. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 387\u2013416. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_14"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-662-46803-6_12","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"E Boyle","year":"2015","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 337\u2013367. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46803-6_12"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: improvements and extensions. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, 2016, pp. 1292\u20131303. ACM (2016)","DOI":"10.1145\/2976749.2978429"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., Smart, N.P.: Practical covertly secure MPC for dishonest majority - or: breaking the SPDZ limits. In: Computer Security - ESORICS 2013 - 18th European Symposium on Research in Computer Security, 2013. LNCS, vol.\u00a08134, pp. 1\u201318. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-40203-6_1","DOI":"10.1007\/978-3-642-40203-6_1"},{"key":"6_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":"6_CR18","doi-asserted-by":"crossref","unstructured":"Escudero, D., Goyal, V., Polychroniadou, A., Song, Y.: Turbopack: honest majority MPC with constant online communication. In: CCS 2022, pp. 951\u2013964. ACM (2022)","DOI":"10.1145\/3548606.3560633"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Escudero, D., Goyal, V., Polychroniadou, A., Song, Y., Weng, C.: Superpack: dishonest majority MPC with constant online communication. In: EUROCRYPT 2023. LNCS, vol. 14005, pp. 220\u2013250. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_8","DOI":"10.1007\/978-3-031-30617-4_8"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/978-3-642-55220-5_35","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"N Gilboa","year":"2014","unstructured":"Gilboa, N., Ishai, Y.: Distributed point functions and their applications. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 640\u2013658. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_35"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Guo, X., et al.: Half-tree: halving the cost of tree expansion in COT and DPF. In: EUROCRYPT (1). LNCS, vol. 14004, pp. 330\u2013362. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_12","DOI":"10.1007\/978-3-031-30545-0_12"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In: CCS 2016, pp. 830\u2013842. ACM (2016)","DOI":"10.1145\/2976749.2978357"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-319-78372-7_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"M Keller","year":"2018","unstructured":"Keller, M., Pastro, V., Rotaru, D.: Overdrive: making SPDZ great again. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 158\u2013189. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_6"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Li, Z., Xing, C., Yao, Y., Yuan, C.: Efficient pseudorandom correlation generators for any finite field. Cryptology ePrint Archive (2025). https:\/\/eprint.iacr.org\/2025\/169","DOI":"10.1007\/978-3-031-91092-0_6"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Liu, H., Xing, C., Yuan, C., Zou, T.: Dishonest majority multiparty computation over matrix rings. In: ASIACRYPT 2024. LNCS, vol. 15489, pp. 299\u2013327. Springer (2024). https:\/\/doi.org\/10.1007\/978-981-96-0938-3_10","DOI":"10.1007\/978-981-96-0938-3_10"},{"issue":"2","key":"6_CR26","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/060658242","volume":"46","author":"U Oberst","year":"2007","unstructured":"Oberst, U.: The fast fourier transform. SIAM J. Control. Optim. 46(2), 496\u2013540 (2007)","journal-title":"SIAM J. Control. Optim."},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"Rachuri, R., Scholl, P.: Le mans: dynamic and fluid MPC for dishonest majority. In: CRYPTO 2022. LNCS, vol. 13507, pp. 719\u2013749. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_25","DOI":"10.1007\/978-3-031-15802-5_25"},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"Raghuraman, S., Rindal, P., Tanguy, T.: Expand-convolute codes for pseudorandom correlation generators from LPN. In: CRYPTO 2023. LNCS, vol. 14084, pp. 602\u2013632. Springer (2023), https:\/\/doi.org\/10.1007\/978-3-031-38551-3_19","DOI":"10.1007\/978-3-031-38551-3_19"},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Roy, L.: Softspokenot: quieter OT extension from small-field silent VOLE in the minicrypt model. In: CRYPTO (1). LNCS, vol. 13507, pp. 657\u2013687. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_23","DOI":"10.1007\/978-3-031-15802-5_23"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Yang, K., Weng, C., Lan, X., Zhang, J., Wang, X.: Ferret: fast extension for correlated OT with small communication. In: CCS \u201920, pp. 1607\u20131626. ACM (2020)","DOI":"10.1145\/3372297.3417276"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: FOCS 1986, pp. 162\u2013167. IEEE Computer Society (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, W., Guo, X., Yang, K., Zhu, R., Yu, Y., Wang, X.: Efficient actively secure DPF and RAM-based 2PC with one-bit leakage. In: IEEE Symposium on Security and Privacy, SP 2024, pp. 561\u2013577. IEEE (2024)","DOI":"10.1109\/SP54263.2024.00205"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91092-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T18:22:52Z","timestamp":1749493372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91092-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031910913","9783031910920"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91092-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}