{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T20:34:03Z","timestamp":1764621243222,"version":"3.46.0"},"publisher-location":"Cham","reference-count":68,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032122926"},{"type":"electronic","value":"9783032122933"}],"license":[{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"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-12293-3_15","type":"book-chapter","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T20:28:11Z","timestamp":1764620891000},"page":"462-497","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pseudorandom Correlation Functions for\u00a0Garbled Circuits"],"prefix":"10.1007","author":[{"given":"Geoffroy","family":"Couteau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivas","family":"Devadas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Koch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sacha","family":"Servan-Schreiber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,2]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","unstructured":"Abram, D., Nof, A., Orlandi, C., Scholl, P., Shlomovits, O.: Low-bandwidth threshold ECDSA via pseudorandom correlation generators. In: 2022 IEEE Symposium on Security and Privacy, pp. 2554\u20132572. IEEE Computer Society Press (2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833559","DOI":"10.1109\/SP46214.2022.9833559"},{"key":"15_CR2","unstructured":"Akdemir, K., et al.: Breakthrough AES performance with Intel AES new instructions. White Paper 12, 217 (2010)"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1145\/1327452.1327494","volume":"51","author":"A Andoni","year":"2008","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Commun. ACM 51(1), 117\u2013122 (2008)","journal-title":"Commun. ACM"},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Attema, T., Capit\u00e3o, P., Kohl, L.: On homomorphic secret sharing from polynomial-modulus LWE. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023: 26th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0II. LNCS, vol. 13941, pp. 3\u201332. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_1","DOI":"10.1007\/978-3-031-31371-4_1"},{"key":"15_CR5","doi-asserted-by":"publisher","unstructured":"Baum, C., Braun, L., Munch-Hansen, A., Razet, B., Scholl, P.: Appenzeller to brie: efficient zero-knowledge proofs for mixed-mode arithmetic and Z2k. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021: 28th Conference on Computer and Communications Security, pp. 192\u2013211. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484812","DOI":"10.1145\/3460120.3484812"},{"key":"15_CR6","doi-asserted-by":"publisher","unstructured":"Baum, C., Malozemoff, A.J., Rosen, M.B., Scholl, P.: $$\\sf Mac^{\\prime }n^{\\prime }Cheese$$: zero-knowledge proofs for\u00a0boolean and arithmetic circuits with\u00a0nested disjunctions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 92\u2013122. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_4","DOI":"10.1007\/978-3-030-84259-8_4"},{"key":"15_CR7","doi-asserted-by":"publisher","unstructured":"Baum, C., Braun, L., Munch-Hansen, A., Scholl, P.: Moz$$\\mathbb{Z}_{2^k}$$arella: efficient vector-OLE and zero-knowledge proofs over $$\\mathbb{Z}_{2^k}$$. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0IV. LNCS, vol. 13510, pp. 329\u2013358. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_12","DOI":"10.1007\/978-3-031-15985-5_12"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: 22nd Annual ACM Symposium on Theory of Computing, pp. 503\u2013513. ACM Press (1990). https:\/\/doi.org\/10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"15_CR10","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) ACM CCS 2012: 19th Conference on Computer and Communications Security, pp. 784\u2013796. ACM Press (2012). https:\/\/doi.org\/10.1145\/2382196.2382279","DOI":"10.1145\/2382196.2382279"},{"issue":"7","key":"15_CR11","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Bombar, M., Couteau, G., Couvreur, A., Ducros, C.: Correlated pseudorandomness from the hardness of quasi-abelian decoding. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0IV. LNCS, vol. 14084, pp. 567\u2013601. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_18","DOI":"10.1007\/978-3-031-38551-3_18"},{"key":"15_CR13","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":"15_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":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-662-53018-4_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"E Boyle","year":"2016","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Breaking the circuit size barrier for secure computation under DDH. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 509\u2013539. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_19"},{"key":"15_CR16","doi-asserted-by":"publisher","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: improvements and extensions. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016: 23rd Conference on Computer and Communications Security, pp. 1292\u20131303. ACM Press (2016). https:\/\/doi.org\/10.1145\/2976749.2978429","DOI":"10.1145\/2976749.2978429"},{"key":"15_CR17","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Orr\u00f9, M.: Homomorphic secret sharing: optimizations and applications. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017: 24th Conference on Computer and Communications Security, pp. 2105\u20132122. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3134107","DOI":"10.1145\/3133956.3134107"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Lin, H., Tessaro, S.: Foundations of homomorphic secret sharing. Cryptology ePrint Archive, Report 2017\/1248 (2017). https:\/\/eprint.iacr.org\/2017\/1248","DOI":"10.1145\/3133956.3134107"},{"key":"15_CR19","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018: 25th Conference on Computer and Communications Security, pp. 896\u2013912. ACM Press (2018). https:\/\/doi.org\/10.1145\/3243734.3243868","DOI":"10.1145\/3243734.3243868"},{"key":"15_CR20","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"15_CR21","doi-asserted-by":"publisher","unstructured":"Boyle, E., Kohl, L., Scholl, P.: Homomorphic secret sharing from lattices without FHE. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 3\u201333. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_1","DOI":"10.1007\/978-3-030-17656-3_1"},{"key":"15_CR22","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":"15_CR23","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Correlated pseudorandom functions from variable-density LPN. In: 61st Annual Symposium on Foundations of Computer Science, pp. 1069\u20131080. IEEE Computer Society Press (2020). https:\/\/doi.org\/10.1109\/FOCS46700.2020.00103","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"15_CR24","doi-asserted-by":"publisher","unstructured":"Boyle, E., et al.: Correlated pseudorandomness from expand-accumulate codes. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 603\u2013633. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_21","DOI":"10.1007\/978-3-031-15979-4_21"},{"key":"15_CR25","doi-asserted-by":"publisher","unstructured":"Br\u00fcggemann, A., Hundt, R., Schneider, T., Suresh, A., Yalame, H.: FLUTE: fast and secure lookup table evaluations. In: 2023 IEEE Symposium on Security and Privacy, pp. 515\u2013533. IEEE Computer Society Press (2023). https:\/\/doi.org\/10.1109\/SP46215.2023.10179345","DOI":"10.1109\/SP46215.2023.10179345"},{"key":"15_CR26","doi-asserted-by":"publisher","unstructured":"Brzuska, C., Couteau, G., Egger, C., Karanko, P., Meyer, P.: Instantiating the hash-then-evaluate paradigm: strengthening PRFs, PCFs, and OPRFs. In: Galdi, C., Phan, D.H. (eds.) SCN 24: 14th International Conference on Security in Communication Networks, Part\u00a0II. LNCS, vol. 14974, pp. \u2013116. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-71073-5_5","DOI":"10.1007\/978-3-031-71073-5_5"},{"key":"15_CR27","doi-asserted-by":"publisher","unstructured":"Bui, D., Couteau, G.: Improved private set intersection for sets with small entries. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023: 26th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0II. LNCS, vol. 13941, pp. 190\u2013220. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_7","DOI":"10.1007\/978-3-031-31371-4_7"},{"key":"15_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-662-44381-1_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"SG Choi","year":"2014","unstructured":"Choi, S.G., Katz, J., Malozemoff, A.J., Zikas, V.: Efficient three-party computation from cut-and-choose. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8617, pp. 513\u2013530. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_29"},{"key":"15_CR29","unstructured":"Chor, B., Gilboa, N., Naor, M.: Private information retrieval by keywords. Cryptology ePrint Archive, Report 1998\/003 (1998). https:\/\/eprint.iacr.org\/1998\/003"},{"key":"15_CR30","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Goel, A., Hegde, A., Jain, A.: Homomorphic secret sharing with verifiable evaluation. In: Boyle, E., Mahmoody, M. (eds.) TCC\u00a02024: 22nd Theory of Cryptography Conference, Part\u00a0IV. LNCS, vol. 15367, pp. 614\u2013650. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78023-3_20","DOI":"10.1007\/978-3-031-78023-3_20"},{"key":"15_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-24698-5_7","volume-title":"LATIN 2004: Theoretical Informatics","author":"G Cormode","year":"2004","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 29\u201338. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24698-5_7"},{"key":"15_CR32","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 (2017)"},{"key":"15_CR33","doi-asserted-by":"publisher","unstructured":"Couteau, G., Ducros, C.: Pseudorandom correlation functions from variable-density LPN, revisited. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC\u00a02023: 26th International Conference on Theory and Practice of Public Key Cryptography, Part\u00a0II. LNCS, vol. 13941, pp. 221\u2013250. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_8","DOI":"10.1007\/978-3-031-31371-4_8"},{"key":"15_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1007\/978-3-030-77886-6_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"G Couteau","year":"2021","unstructured":"Couteau, G., Meyer, P.: Breaking the circuit size barrier for secure computation under quasi-polynomial LPN. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 842\u2013870. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_29"},{"key":"15_CR35","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":"15_CR36","doi-asserted-by":"publisher","unstructured":"Dao, Q., Ishai, Y., Jain, A., Lin, H.: Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0II. LNCS, vol. 14082, pp. 315\u2013348. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_11","DOI":"10.1007\/978-3-031-38545-2_11"},{"key":"15_CR37","doi-asserted-by":"publisher","unstructured":"Dittmer, S., Ishai, Y., Lu, S., Ostrovsky, R.: Authenticated garbling from simple correlations. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0IV. LNCS, vol. 13510, pp. 57\u201387. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_3","DOI":"10.1007\/978-3-031-15985-5_3"},{"key":"15_CR38","doi-asserted-by":"publisher","unstructured":"Dittmer, S., Ishai, Y., Lu, S., Ostrovsky, R.: Improving line-point zero knowledge: two multiplications for the price of one. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022: 29th Conference on Computer and Communications Security, pp. 829\u2013841. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3559385","DOI":"10.1145\/3548606.3559385"},{"key":"15_CR39","doi-asserted-by":"publisher","unstructured":"Faust, S., Hazay, C., Kretzler, D., Rometsch, L., Schlosser, B.: Non-interactive threshold BBS+ from pseudorandom correlations. In: Patra, A. (ed.) CT-RSA 2025. LNCS, vol. 15598, pp. 198\u2013222. Springer, Heidelberg (2025). https:\/\/doi.org\/10.1007\/978-3-031-88661-4_9","DOI":"10.1007\/978-3-031-88661-4_9"},{"key":"15_CR40","doi-asserted-by":"publisher","unstructured":"Fazio, N., Gennaro, R., Jafarikhah, T., Skeith, W.E.: Homomorphic secret sharing from paillier encryption. In: Okamoto, T., Yu, Y., Au, M.H., Li, Y. (eds.) ProvSec 2017. LNCS, vol. 10592, pp. 381\u2013399. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68637-0_23","DOI":"10.1007\/978-3-319-68637-0_23"},{"key":"15_CR41","unstructured":"Fosli, I., Ishai, Y., Kolobov, V.I., Wootters, M.: On the download rate of homomorphic secret sharing. arXiv preprint arXiv:2111.10126 (2021)"},{"key":"15_CR42","unstructured":"Gionis, A., Indyk, P., Motwani, R., et al.: Similarity search in high dimensions via hashing. In: VLDB, vol. 99, pp. 518\u2013529 (1999)"},{"key":"15_CR43","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Kalai, Y.T., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: Reusable garbled circuits and succinct functional encryption. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th Annual ACM Symposium on Theory of Computing, pp. 555\u2013564. ACM Press (2013). https:\/\/doi.org\/10.1145\/2488608.2488678","DOI":"10.1145\/2488608.2488678"},{"key":"15_CR44","doi-asserted-by":"publisher","unstructured":"Greene, D.H., Parnas, M., Yao, F.F.: Multi-index hashing for information retrieval. In: 35th Annual Symposium on Foundations of Computer Science, pp. 722\u2013731. IEEE Computer Society Press (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365720","DOI":"10.1109\/SFCS.1994.365720"},{"key":"15_CR45","doi-asserted-by":"publisher","unstructured":"Guo, X., et al.: Half-tree: halving the cost of tree expansion in COT and DPF. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02023, Part\u00a0I. LNCS, vol. 14004, pp. 330\u2013362. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_12","DOI":"10.1007\/978-3-031-30545-0_12"},{"key":"15_CR46","unstructured":"Guo, X., et al.: Dory: streaming PCG with small memory. Cryptology ePrint Archive, Paper 2025\/1660 (2025). https:\/\/eprint.iacr.org\/2025\/1660"},{"issue":"2","key":"15_CR47","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/j.1538-7305.1950.tb00463.x","volume":"29","author":"RW Hamming","year":"1950","unstructured":"Hamming, R.W.: Error detecting and error correcting codes. Bell Syst. Techn. J. 29(2), 147\u2013160 (1950)","journal-title":"Bell Syst. Techn. J."},{"key":"15_CR48","unstructured":"Huang, Z., Lu, W., Hong, C., Ding, J.: Cheetah: lean and fast secure two-party deep neural network inference. In: Butler, K.R.B., Thomas, K. (eds.) USENIX Security 2022: 31st USENIX Security Symposium, pp. 809\u2013826. USENIX Association (2022). https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/huang-zhicong"},{"key":"15_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145\u2013161. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_9"},{"key":"15_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-3-642-20465-4_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"Y Ishai","year":"2011","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A.: Efficient non-interactive secure computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 406\u2013425. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_23"},{"key":"15_CR51","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Khurana, D., Sahai, A., Srinivasan, A.: Black-box reusable NISC with random oracles. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02023, Part\u00a0II. LNCS, vol. 14005, pp. 68\u201397. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_3","DOI":"10.1007\/978-3-031-30617-4_3"},{"key":"15_CR52","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V.: Gate evaluation secret sharing and secure one-round two-party computation. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 136\u2013155. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11593447_8","DOI":"10.1007\/11593447_8"},{"key":"15_CR53","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Schneider, T.: Improved garbled circuit: free XOR gates and applications. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 486\u2013498. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_40","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"15_CR54","doi-asserted-by":"crossref","unstructured":"Kondi, Y., Orlandi, C., Roy, L.: Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions. Cryptology ePrint Archive, Report 2023\/216 (2023). https:\/\/eprint.iacr.org\/2023\/216","DOI":"10.1007\/978-3-031-38557-5_21"},{"key":"15_CR55","volume-title":"Error Correction Coding: Mathematical Methods and Algorithms","author":"TK Moon","year":"2020","unstructured":"Moon, T.K.: Error Correction Coding: Mathematical Methods and Algorithms. John Wiley & Sons, Hoboken (2020)"},{"key":"15_CR56","doi-asserted-by":"publisher","unstructured":"Orlandi, C., Scholl, P., Yakoubov, S.: The rise of paillier: homomorphic secret sharing and public-key silent OT. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 678\u2013708. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_24","DOI":"10.1007\/978-3-030-77870-5_24"},{"key":"15_CR57","doi-asserted-by":"publisher","unstructured":"Raghuraman, S., Rindal, P.: Blazing fast PSI from improved OKVS and subfield VOLE. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022: 29th Conference on Computer and Communications Security, pp. 2505\u20132517. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560658","DOI":"10.1145\/3548606.3560658"},{"key":"15_CR58","doi-asserted-by":"publisher","unstructured":"Raghuraman, S., Rindal, P., Tanguy, T.: Expand-convolute codes for pseudorandom correlation generators from LPN. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02023, Part\u00a0IV. LNCS, vol. 14084, pp. 602\u2013632. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_19","DOI":"10.1007\/978-3-031-38551-3_19"},{"issue":"2","key":"15_CR59","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"15_CR60","doi-asserted-by":"publisher","unstructured":"Rindal, P., Schoppmann, P.: VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 901\u2013930. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_31","DOI":"10.1007\/978-3-030-77886-6_31"},{"key":"15_CR61","doi-asserted-by":"publisher","unstructured":"Roy, L., Singh, J.: Large message homomorphic secret sharing from DCR and applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12827, pp. 687\u2013717. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84252-9_23","DOI":"10.1007\/978-3-030-84252-9_23"},{"key":"15_CR62","doi-asserted-by":"publisher","unstructured":"Schoppmann, P., Gasc\u00f3n, A., Reichert, L., Raykova, M.: Distributed vector-OLE: improved constructions and implementation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J., (eds.) ACM CCS 2019: 26th Conference on Computer and Communications Security, pp. 1055\u20131072. ACM Press (2019). https:\/\/doi.org\/10.1145\/3319535.3363228","DOI":"10.1145\/3319535.3363228"},{"key":"15_CR63","doi-asserted-by":"publisher","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Authenticated garbling and efficient maliciously secure two-party computation. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017: 24th Conference on Computer and Communications Security, pp. 21\u201337. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3134053","DOI":"10.1145\/3133956.3134053"},{"key":"15_CR64","doi-asserted-by":"publisher","unstructured":"Wang, X., Ranellucci, S., Katz, J.: Global-scale secure multiparty computation. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017: 24th Conference on Computer and Communications Security, pp. 39\u201356. ACM Press (2017). https:\/\/doi.org\/10.1145\/3133956.3133979","DOI":"10.1145\/3133956.3133979"},{"key":"15_CR65","doi-asserted-by":"publisher","unstructured":"Weng, C., Yang, K., Katz, J., Wang, X.: Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits. In: 2021 IEEE Symposium on Security and Privacy, pp. 1074\u20131091. IEEE Computer Society Press (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00056","DOI":"10.1109\/SP40001.2021.00056"},{"key":"15_CR66","doi-asserted-by":"publisher","unstructured":"Weng, C., Yang, K., Yang, Z., Xie, X., Wang, X.: AntMan: interactive zero-knowledge proofs with sublinear communication. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022: 29th Conference on Computer and Communications Security, pp. 2901\u20132914. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560667","DOI":"10.1145\/3548606.3560667"},{"key":"15_CR67","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, pp. 162\u2013167. IEEE Computer Society Press (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.25","DOI":"10.1109\/SFCS.1986.25"},{"issue":"3","key":"15_CR68","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1007\/s00145-018-9289-9","volume":"32","author":"M Zhandry","year":"2018","unstructured":"Zhandry, M.: The Magic of ELFs. J. Cryptol. 32(3), 825\u2013866 (2018). https:\/\/doi.org\/10.1007\/s00145-018-9289-9","journal-title":"J. Cryptol."}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-12293-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T20:28:13Z","timestamp":1764620893000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12293-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,2]]},"ISBN":["9783032122926","9783032122933"],"references-count":68,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12293-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,12,2]]},"assertion":[{"value":"2 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}