{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T10:26:13Z","timestamp":1781519173280,"version":"3.54.1"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683961","type":"print"},{"value":"9783031683978","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68397-8_5","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:01:41Z","timestamp":1723759301000},"page":"136-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Fully Secure MPC and\u00a0zk-FLIOP over\u00a0Rings: New Constructions, Improvements and\u00a0Extensions"],"prefix":"10.1007","author":[{"given":"Anders","family":"Dalskov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Escudero","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":[[2024,8,16]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Araki, T., Furukawa, J., Lindell, Y., Nof, A., Ohara, K.: High-throughput semi-honest secure three-party computation with an honest majority. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 805\u2013817 (2016)","DOI":"10.1145\/2976749.2978331"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: ACM STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Fehr, S., Ostrovsky, R.: Near-linear unconditionally-secure multiparty computation with a dishonest minority. In: CRYPTO, pp. 663\u2013680 (2012)","DOI":"10.1007\/978-3-642-32009-5_39"},{"key":"5_CR4","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, pp. 67\u201397. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_3"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-030-64840-4_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"E Boyle","year":"2020","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Efficient fully secure computation via distributed zero-knowledge proofs. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 244\u2013276. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_9"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Practical fully secure three-party computation via sublinear distributed zero-knowledge proofs. In: ACM CCS (2019)","DOI":"10.1145\/3319535.3363227"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Secure multiparty computation with sublinear preprocessing. In: EUROCRYPT, pp. 427\u2013457 (2022)","DOI":"10.1007\/978-3-031-06944-4_15"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Boyle, E., Gilboa, N., Ishai, Y., Nof, A.: Sublinear GMW-style compiler for MPC with preprocessing. In: CRYPTO, pp. 457\u2013485 (2021)","DOI":"10.1007\/978-3-030-84245-1_16"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Cascudo, I., Cramer, R., Xing, C., Yuan, C.: Amortized complexity of information-theoretically secure MPC revisited. In: CRYPTO, pp. 395\u2013426 (2018)","DOI":"10.1007\/978-3-319-96878-0_14"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Cascudo, I., Giunta, E.: On interactive oracle proofs for Boolean R1CS statements. In: Financial Cryptography and Data Security, FC, pp. 230\u2013247 (2022)","DOI":"10.1007\/978-3-031-18283-9_11"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/978-3-030-64378-2_23","volume-title":"Theory of Cryptography","author":"I Cascudo","year":"2020","unstructured":"Cascudo, I., Gundersen, J.S.: A secret-sharing based MPC protocol for Boolean circuits with good amortized complexity. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 652\u2013682. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_23"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: ACM STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Chida, K., Genkin, D., Hamada, K., Ikarashi, D., Kikuchi, R., Lindell, Y., Nof, A.: Fast large-scale honest-majority MPC for malicious adversaries. In: CRYPTO, pp. 34\u201364 (2018)","DOI":"10.1007\/978-3-319-96878-0_2"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: ACM STOC, pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Escudero, D., Scholl, P., Xing, C.: Spd$$\\mathbb{Z} _{2^k}$$: Efficient MPC mod $$2^k$$ for dishonest majority. In: CRYPTO, pp. 769\u2013798 (2018)","DOI":"10.1007\/978-3-319-96881-0_26"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-30576-7_19","volume-title":"Theory of Cryptography","author":"R Cramer","year":"2005","unstructured":"Cramer, R., Damg\u00e5rd, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 342\u2013362. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_19"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Cramer, R., Rambaud, M., Xing, C.: Asymptotically-good arithmetic secret sharing over $$\\mathbb{Z} \/p^{\\ell }\\mathbb{Z} $$ with strong multiplication and its applications to efficient MPC. In: CRYPTO, pp. 656\u2013686 (2021)","DOI":"10.1007\/978-3-030-84252-9_22"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Dalskov, A., Escudero, D., Nof, A.: Fast fully secure multi-party computation over any ring with two-thirds honest majority. In: ACM CCS 2022, pp. 653\u2013666 (2022)","DOI":"10.1145\/3548606.3559389"},{"key":"5_CR20","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":"5_CR21","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: CRYPTO, pp. 643\u2013662 (2012)","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Dolev, D., Strong, H.R.: Authenticated algorithms for byzantine agreement. SIAM J. Comput., 12(4), 656\u2013666 (1983)","DOI":"10.1137\/0212045"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-030-84245-1_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"D Escudero","year":"2021","unstructured":"Escudero, D., Soria-Vazquez, E.: Efficient information-theoretic multi-party computation over non-commutative rings. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 335\u2013364. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_12"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Escudero, D., Xing, C., Yuan, C.: More efficient dishonest majority secure computation over z 2 k via Galois rings. In: CRYPTO, pp. 383\u2013412 (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_14","DOI":"10.1007\/978-3-031-15802-5_14"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: CRYPTO, pp. 186\u2013194 (1986)","DOI":"10.1007\/3-540-47721-7_12"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Furukawa, J., Lindell, Y.: Two-thirds honest-majority MPC for malicious adversaries at almost the cost of semi-honest. In: ACM CCS, pp. 1557\u20131571 (2019)","DOI":"10.1145\/3319535.3339811"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Furukawa, J., Lindell, Y., Nof, A., Weinstein, O.: High-throughput secure three-party computation for malicious adversaries and an honest majority. In: EUROCRYPT, pp. 225\u2013255 (2017)","DOI":"10.1007\/978-3-319-56614-6_8"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Genkin, D., Ishai, Y., Polychroniadou, A.: Efficient multi-party computation: from passive to active security via secure SIMD circuits. In: CRYPTO, pp. 721\u2013741 (2015)","DOI":"10.1007\/978-3-662-48000-7_35"},{"key":"5_CR29","unstructured":"Gentry, C.: A Fully Homomorphic Encryption Scheme, Stanford University (2009)"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 2: Basic Applications. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"5_CR31","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: ACM STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"5_CR32","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. LNCS, vol. 12826, pp. 244\u2013274. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_9"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Goyal, V., Liu, Y., Song, Y.: Communication-efficient unconditional MPC with guaranteed output delivery. In: CRYPTO, pp. 85\u2013114 (2019)","DOI":"10.1007\/978-3-030-26951-7_4"},{"key":"5_CR34","doi-asserted-by":"crossref","unstructured":"Goyal, V., Song, Y., Zhu, C.: Guaranteed output delivery comes free in honest majority MPC. In: CRYPTO, pp. 618\u2013646 (2020)","DOI":"10.1007\/978-3-030-56880-1_22"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Hirt, M., Maurer, U.M., Przydatek, B.: Efficient secure multi-party computation. In: Okamoto, T.,(ed) ASIACRYPT, pp. 143\u2013161 (2000)","DOI":"10.1007\/3-540-44448-3_12"},{"key":"5_CR36","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Prabhakaran, M., Sahai, A., Ching-Hua, Yu.: Secure protocol transformations. In: CRYPTO, pp. 430\u2013458 (2016)","DOI":"10.1007\/978-3-662-53008-5_15"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer - efficiently. In: CRYPTO, pp. 572\u2013591 (2008)","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"5_CR38","doi-asserted-by":"crossref","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. Elec. Commun. Japan. In: Part III: Fundamental Electronic Science, 72(9), 56\u201364 (1989)","DOI":"10.1002\/ecjc.4430720906"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Kales, D., Zaverucha, G.: An attack on some signature schemes constructed from five-pass identification schemes. In: CANS, pp. 3\u201322 (2020)","DOI":"10.1007\/978-3-030-65411-5_1"},{"key":"5_CR40","unstructured":"Kales, D., Zaverucha, G.: Efficient lifting for shorter zero-knowledge proofs and post-quantum signatures. In: Cryptology ePrint Archive (2022)"},{"key":"5_CR41","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: ACM CCS, pp. 259\u2013276 (2017)","DOI":"10.1145\/3133956.3133999"},{"issue":"2","key":"5_CR42","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"5_CR43","doi-asserted-by":"crossref","unstructured":"Polychroniadou, A., Song, Y.: Constant-overhead unconditionally secure multiparty computation over binary fields. In: EUROCRYPT, pp. 812\u2013841 (2021)","DOI":"10.1007\/978-3-030-77886-6_28"},{"issue":"11","key":"5_CR44","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":"5_CR45","doi-asserted-by":"crossref","unstructured":"Storrier, K., Vadapalli, A., Lyons, A., Henry, R.: Grotto: screaming fast (2+1)-pc or $$z$$2n via (2, 2)-dpfs. In: ACM CCS, pp. 2143\u20132157 (2023)","DOI":"10.1145\/3576915.3623147"},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68397-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:02:07Z","timestamp":1723759327000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68397-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683961","9783031683978"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68397-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","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":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}