{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T13:40:09Z","timestamp":1745761209654,"version":"3.40.4"},"publisher-location":"Cham","reference-count":59,"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_15","type":"book-chapter","created":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T12:58:11Z","timestamp":1745758691000},"page":"421-452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Weakly Super-Invertible Matrices and\u00a0Constant Communication Dishonest Majority MPC"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Bienstock","sequence":"first","affiliation":[]},{"given":"Kevin","family":"Yeo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,28]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Angel, S., Chen, H., Laine, K., Setty, S.T.V.: PIR with compressed queries and amortized query processing. In: 2018 IEEE Symposium on Security and Privacy, pp. 962\u2013979. IEEE Computer Society Press (2018)","DOI":"10.1109\/SP.2018.00062"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: How to garble arithmetic circuits. In: Ostrovsky, R. (ed.) 52nd FOCS, pp. 120\u2013129. IEEE Computer Society Press (2011)","DOI":"10.1109\/FOCS.2011.40"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-29011-4_29","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"G Asharov","year":"2012","unstructured":"Asharov, G., Jain, A., L\u00f3pez-Alt, A., Tromer, E., Vaikuntanathan, V., Wichs, D.: Multiparty computation with low communication, computation and interaction via threshold FHE. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 483\u2013501. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_29"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-030-38471-5_12","volume-title":"Selected Areas in Cryptography \u2013 SAC 2019","author":"C Baum","year":"2020","unstructured":"Baum, C., Cozzo, D., Smart, N.P.: Using TopGear in overdrive: a more efficient ZKPoK for SPDZ. In: Paterson, K.G., Stebila, D. (eds.) SAC 2019. LNCS, vol. 11959, pp. 274\u2013302. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38471-5_12"},{"key":"15_CR5","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_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/978-3-030-77886-6_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"G Beck","year":"2021","unstructured":"Beck, G., Goel, A., Jain, A., Kaptchuk, G.: Order-C secure multiparty computation for highly repetitive circuits. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 663\u2013693. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_23"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-540-78524-8_13","volume-title":"Theory of Cryptography","author":"Z Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2008","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Perfectly-secure MPC with linear communication complexity. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 213\u2013230. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_13"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th ACM STOC, pp. 1\u201310. ACM Press (1988)","DOI":"10.1145\/62212.62213"},{"key":"15_CR9","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":"15_CR10","unstructured":"Bienstock, A., Patel, S., Seo, J.Y., Yeo, K.: Batch PIR and labeled PSI with oblivious ciphertext compression. In: Balzarotti, D., Xu, W. (eds.) USENIX Security 2024. USENIX Association (2024)"},{"key":"15_CR11","unstructured":"Bienstock, A., Yeo, K.: Weakly super-invertible matrices and constant communication dishonest majority MPC. IACR Cryptology ePrint Archive 2024 (2024)"},{"key":"15_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-030-26954-8_3","volume-title":"CRYPTO 2019, Part III","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, Part III. LNCS, vol. 11694, pp. 67\u201397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_3"},{"key":"15_CR13","doi-asserted-by":"crossref","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, pp. 896\u2013912. ACM Press (2018)","DOI":"10.1145\/3243734.3243868"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201919, pp. 291\u2013308. Association for Computing Machinery, New York, NY, USA (2019)","DOI":"10.1145\/3319535.3354255"},{"key":"15_CR15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-030-26954-8_16","volume-title":"CRYPTO 2019, Part III","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, Part III. LNCS, vol. 11694, pp. 489\u2013518. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_16"},{"key":"15_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-030-56880-1_14","volume-title":"CRYPTO 2020, Part II","author":"E Boyle","year":"2020","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators from ring-LPN. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 387\u2013416. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_14"},{"issue":"4","key":"15_CR17","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1145\/31846.42229","volume":"34","author":"G Bracha","year":"1987","unstructured":"Bracha, G.: An o(log n) expected rounds randomized byzantine generals protocol. J. ACM 34(4), 910\u2013920 (1987)","journal-title":"J. ACM"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: 20th ACM STOC, pp. 11\u201319. ACM Press (1988)","DOI":"10.1145\/62212.62214"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Chen, H., Huang, Z., Laine, K., Rindal, P.: Labeled PSI from fully homomorphic encryption with malicious security. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 1223\u20131237. ACM Press (2018)","DOI":"10.1145\/3243734.3243836"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Chen, H., Laine, K., Rindal, P.: Fast private set intersection from homomorphic encryption. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 1243\u20131255. ACM Press (2017)","DOI":"10.1145\/3133956.3134061"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/TIT.2016.2614685","volume":"63","author":"A Choudhury","year":"2017","unstructured":"Choudhury, A., Patra, A.: An efficient framework for unconditionally secure multiparty computation. IEEE Trans. Inf. Theory 63(1), 428\u2013468 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Cohen, R., Shelat, A., Wichs, D.: Adaptively secure MPC with sublinear communication complexity. J. Cryptol. 36(2) (2023)","DOI":"10.1007\/s00145-023-09446-6"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Cong, K., et al.: Labeled psi from homomorphic encryption with reduced computation and communication. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 1135\u20131150 (2021)","DOI":"10.1145\/3460120.3484760"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-13190-5_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Ishai, Y., Kr\u00f8igaard, M.: Perfectly secure multiparty computation and the computational overhead of cryptography. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 445\u2013465. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_23"},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40203-6_1","volume-title":"Computer Security \u2013 ESORICS 2013","author":"I Damg\u00e5rd","year":"2013","unstructured":"Damg\u00e5rd, I., Keller, M., Larraia, E., Pastro, V., Scholl, P., Smart, N.P.: Practical covertly secure MPC for dishonest majority \u2013 or: breaking the SPDZ limits. In: Crampton, J., Jajodia, S., Mayes, K. (eds.) ESORICS 2013. LNCS, vol. 8134, pp. 1\u201318. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40203-6_1"},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-74143-5_32","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Scalable and unconditionally secure multiparty computation. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 572\u2013590. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_32"},{"key":"15_CR28","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_CR29","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-031-30617-4_8","volume-title":"EUROCRYPT 2023, Part II","author":"D Escudero","year":"2023","unstructured":"Escudero, D., Goyal, V., Polychroniadou, A., Song, Y., Weng, C.: SuperPack: dishonest majority MPC with constant online communication. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part II. LNCS, vol. 14005, pp. 220\u2013250. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_8"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: 24th ACM STOC, pp. 699\u2013710. ACM Press (1992)","DOI":"10.1145\/129712.129780"},{"key":"15_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-319-63688-7_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"J Garay","year":"2017","unstructured":"Garay, J., Ishai, Y., Ostrovsky, R., Zikas, V.: The price of low communication in secure multi-party computation. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 420\u2013446. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_14"},{"key":"15_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-84245-1_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"G Garimella","year":"2021","unstructured":"Garimella, G., Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: Oblivious key-value stores and amplification for private set intersection. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part II. LNCS, vol. 12826, pp. 395\u2013425. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_14"},{"key":"15_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/978-3-662-48000-7_35","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"D Genkin","year":"2015","unstructured":"Genkin, D., Ishai, Y., Polychroniadou, A.: Efficient multi-party computation: from passive to active security via secure SIMD circuits. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015, Part II. LNCS, vol. 9216, pp. 721\u2013741. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_35"},{"key":"15_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-29011-4_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"C Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Fully homomorphic encryption with polylog overhead. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 465\u2013482. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_28"},{"key":"15_CR35","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: Aho, A. (ed.) 19th ACM STOC, pp. 218\u2013229. ACM Press (1987)","DOI":"10.1145\/28395.28420"},{"key":"15_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1007\/978-3-030-77886-6_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"SD Gordon","year":"2021","unstructured":"Gordon, S.D., Starin, D., Yerukhimovich, A.: The more the merrier: reducing the cost of large scale MPC. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021, Part II. LNCS, vol. 12697, pp. 694\u2013723. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_24"},{"key":"15_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-030-84245-1_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"V Goyal","year":"2021","unstructured":"Goyal, V., Li, H., Ostrovsky, R., Polychroniadou, A., Song, Y.: ATLAS: efficient and scalable MPC in\u00a0the honest majority setting. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part II. LNCS, vol. 12826, pp. 244\u2013274. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_9"},{"key":"15_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-030-84245-1_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"V Goyal","year":"2021","unstructured":"Goyal, V., Polychroniadou, A., Song, Y.: Unconditional communication-efficient MPC via Hall\u2019s marriage theorem. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part II. LNCS, vol. 12826, pp. 275\u2013304. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_10"},{"key":"15_CR39","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-15985-5_1","volume-title":"CRYPTO 2022, Part IV","author":"V Goyal","year":"2022","unstructured":"Goyal, V., Polychroniadou, A., Song, Y.: Sharing transformation and dishonest majority MPC with packed secret sharing. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part IV. LNCS, vol. 13510, pp. 3\u201332. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15985-5_1"},{"key":"15_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-540-74143-5_16","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"D Harnik","year":"2007","unstructured":"Harnik, D., Ishai, Y., Kushilevitz, E.: How many oblivious transfers are needed for secure multiparty computation? In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 284\u2013302. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_16"},{"key":"15_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/11818175_28","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"M Hirt","year":"2006","unstructured":"Hirt, M., Nielsen, J.B.: Robust multiparty computation with linear communication complexity. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 463\u2013482. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_28"},{"key":"15_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-662-53008-5_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"Y Ishai","year":"2016","unstructured":"Ishai, Y., Kushilevitz, E., Prabhakaran, M., Sahai, A., Yu, C.-H.: Secure protocol transformations. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part II. LNCS, vol. 9815, pp. 430\u2013458. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_15"},{"key":"15_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-00457-5_18","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2009","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Secure arithmetic computation with no honest majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 294\u2013314. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_18"},{"key":"15_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-36362-7_2","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"J Katz","year":"2013","unstructured":"Katz, J., Thiruvengadam, A., Zhou, H.-S.: Feasibility and infeasibility of adaptively secure fully homomorphic encryption. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 14\u201331. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_2"},{"key":"15_CR45","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Scholl, P.: MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 2016, pp. 830\u2013842. ACM Press (2016)","DOI":"10.1145\/2976749.2978357"},{"key":"15_CR46","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":"15_CR47","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Nof, A.: A framework for constructing fast MPC over arithmetic circuits with malicious adversaries and an honest-majority. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 259\u2013276. ACM Press (2017)","DOI":"10.1145\/3133956.3133999"},{"key":"15_CR48","doi-asserted-by":"crossref","unstructured":"Mughees, M.H., Ren, L.: Vectorized batch private information retrieval. In: 2023 IEEE Symposium on Security and Privacy, pp. 437\u2013452. IEEE Computer Society Press (2023)","DOI":"10.1109\/SP46215.2023.10179329"},{"key":"15_CR49","unstructured":"Myers, S., Sergi, M., Shelat, A.: Threshold fully homomorphic encryption and secure computation. IACR Cryptology ePrint Archive 2011:454 (2011)"},{"key":"15_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-319-93387-0_17","volume-title":"Applied Cryptography and Network Security","author":"PS Nordholt","year":"2018","unstructured":"Nordholt, P.S., Veeningen, M.: Minimising communication in honest-majority MPC by batchwise multiplication verification. In: Preneel, B., Vercauteren, F. (eds.) ACNS 2018. LNCS, vol. 10892, pp. 321\u2013339. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93387-0_17"},{"issue":"2","key":"15_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3154794","volume":"21","author":"B Pinkas","year":"2018","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Scalable private set intersection based on OT extension. ACM Trans. Privacy Secur. (TOPS) 21(2), 1\u201335 (2018)","journal-title":"ACM Trans. Privacy Secur. (TOPS)"},{"issue":"2","key":"15_CR52","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1017\/S0963548315000097","volume":"25","author":"B Pittel","year":"2016","unstructured":"Pittel, B., Sorkin, G.B.: The satisfiability threshold for k-xorsat. Comb. Probab. Comput. 25(2), 236\u2013268 (2016)","journal-title":"Comb. Probab. Comput."},{"key":"15_CR53","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M., Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: 21st ACM STOC, pp. 73\u201385. ACM Press (1989)","DOI":"10.1145\/73007.73014"},{"key":"15_CR54","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-031-15802-5_25","volume-title":"CRYPTO 2022, Part I","author":"R Rachuri","year":"2022","unstructured":"Rachuri, R., Scholl, P.: Le mans: dynamic and fluid MPC for dishonest majority. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 719\u2013749. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_25"},{"issue":"11","key":"15_CR55","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"15_CR56","doi-asserted-by":"crossref","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)","DOI":"10.1109\/SP40001.2021.00056"},{"key":"15_CR57","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, SFCS \u201982, pp. 160\u2013164. IEEE Computer Society, USA (1982)","DOI":"10.1109\/SFCS.1982.38"},{"key":"15_CR58","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-031-38551-3_7","volume-title":"CRYPTO 2023, Part IV","author":"K Yeo","year":"2023","unstructured":"Yeo, K.: Cuckoo hashing in cryptography: optimal parameters, robustness and applications. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part IV. LNCS, vol. 14084, pp. 197\u2013230. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_7"},{"key":"15_CR59","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-031-30545-0_18","volume-title":"EUROCRYPT 2023, Part I","author":"K Yeo","year":"2023","unstructured":"Yeo, K.: Lower bounds for (batch) PIR with private preprocessing. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part I. LNCS, vol. 14004, pp. 518\u2013550. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_18"}],"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_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T12:58:19Z","timestamp":1745758699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91092-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031910913","9783031910920"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91092-0_15","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"}}]}}