{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:55:14Z","timestamp":1743008114083,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819609376"},{"type":"electronic","value":"9789819609383"}],"license":[{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T00:00:00Z","timestamp":1733961600000},"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-981-96-0938-3_8","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T18:21:42Z","timestamp":1733941302000},"page":"234-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Honest Majority GOD MPC with\u00a0$$O(\\textsf{depth}(C))$$ Rounds and\u00a0Low Online Communication"],"prefix":"10.1007","author":[{"given":"Amit","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Bienstock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivan","family":"Damg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Escudero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Ittai Abraham, Gilad Asharov, Shravani Patil, and Arpita Patra. \u201cDetect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time\u201d. In: Advances in Cryptology \u2013 EUROCRYPT 2023, Part II. Ed. by Carmit Hazay and Martijn Stam. Vol. 14005. Lecture Notes in Computer Science. Lyon, France: Springer, Heidelberg, Germany, 2023, pp. 251\u2013281. doi: https:\/\/doi.org\/10.1007\/978-3-031-30617-4_9.","DOI":"10.1007\/978-3-031-30617-4_9"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Ittai Abraham, Gilad Asharov, and Avishay Yanai. \u201cEfficient Perfectly Secure Computation with Optimal Resilience\u201d. In: TCC 2021: 19th Theory of Cryptography Conference, Part II. Ed. by Kobbi Nissim and Brent Waters. Vol. 13043. Lecture Notes in Computer Science. Raleigh, NC, USA: Springer, Heidelberg, Germany, 2021, pp. 66\u201396. doi: https:\/\/doi.org\/10.1007\/978-3-030-90453-1_3.","DOI":"10.1007\/978-3-030-90453-1_3"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Benny Applebaum, Eliran Kachlon, and Arpita Patra. \u201cThe Round Complexity of Statistical MPC with Optimal Resiliency\u201d. In: Cryptology ePrint Archive (2023).","DOI":"10.1145\/3564246.3585228"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Donald Beaver. \u201cEfficient Multiparty Protocols Using Circuit Randomization\u201d. In: Advances in Cryptology - CRYPTO\u201991. Ed. by Joan Feigenbaum. Vol. 576. Lecture Notes in Computer Science. Santa Barbara, CA, USA: Springer, Heidelberg, Germany, 1992, pp. 420\u2013432. doi: https:\/\/doi.org\/10.1007\/3-540-46766-1_34.","DOI":"10.1007\/3-540-46766-1_34"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Zuzana Beerliov\u00e1-Trub\u00edniov\u00e1 and Martin Hirt. \u201cEfficient Multi-party Computation with Dispute Control\u201d. In: TCC 2006: 3rd Theory of Cryptography Conference. Ed. by Shai Halevi and Tal Rabin. Vol. 3876. Lecture Notes in Computer Science. New York, NY, USA: Springer, Heidelberg, Germany, 2006, pp. 305\u2013328. doi: https:\/\/doi.org\/10.1007\/11681878_16.","DOI":"10.1007\/11681878_16"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Zuzana Beerliov\u00e1-Trub\u00edniov\u00e1 and Martin Hirt. \u201cPerfectly-Secure MPC with Linear Communication Complexity\u201d. In: TCC 2008: 5th Theory of Cryptography Conference. Ed. by Ran Canetti. Vol. 4948. Lecture Notes in Computer Science. San Francisco, CA, USA: Springer, Heidelberg, Germany, 2008, pp. 213\u2013230. doi: https:\/\/doi.org\/10.1007\/978-3-540-78524-8_13.","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. \u201cCompleteness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract)\u201d. In: 20th Annual ACM Symposium on Theory of Computing. Chicago, IL, USA: ACM Press, 1988, pp. 1\u201310. doi: https:\/\/doi.org\/10.1145\/62212.62213.","DOI":"10.1145\/62212.62213"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Eli Ben-Sasson, Serge Fehr, and Rafail Ostrovsky. \u201cNear-Linear Unconditionally- Secure Multiparty Computation with a Dishonest Minority\u201d. In: Advances in Cryptology - CRYPTO 2012. Ed. by Reihaneh Safavi-Naini and Ran Canetti. Vol. 7417. Lecture Notes in Computer Science. Santa Barbara, CA, USA: Springer, Heidelberg, Germany, 2012, pp. 663\u2013680. doi: https:\/\/doi.org\/10.1007\/978-3-642-32009-5_39.","DOI":"10.1007\/978-3-642-32009-5_39"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"David Chaum, Claude Cr\u00e9peau, and Ivan Damg\u00e5rd. \u201cMultiparty Unconditionally Secure Protocols (Extended Abstract)\u201d. In: 20th Annual ACM Symposium on Theory of Computing. Chicago, IL, USA: ACM Press, 1988, pp. 11\u201319. doi: https:\/\/doi.org\/10.1145\/62212.62214.","DOI":"10.1145\/62212.62214"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Ashish Choudhury and Arpita Patra. \u201cAn Efficient Framework for Unconditionally Secure Multiparty Computation\u201d. In: IEEE Transactions on Information Theory 63.1 (2017), pp. 428\u2013468. doi: https:\/\/doi.org\/10.1109\/TIT.2016.2614685.","DOI":"10.1109\/TIT.2016.2614685"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Ronald Cramer, Ivan Damg\u00e5rd, Stefan Dziembowski, Martin Hirt, and Tal Rabin. \u201cEfficient Multiparty Computations Secure Against an Adaptive Adversary\u201d. In: Advances in Cryptology - EUROCRYPT\u201999. Ed. by Jacques Stern. Vol. 1592. Lecture Notes in Computer Science. Prague, Czech Republic: Springer, Heidelberg, Germany, 1999, pp. 311\u2013326. doi: https:\/\/doi.org\/10.1007\/3-540-48910-X_22.","DOI":"10.1007\/3-540-48910-X_22"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Ivan Damg\u00e5rd, Kasper Green Larsen, and Jesper Buus Nielsen. \u201cCommunication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing\u201d. In: Advances in Cryptology - CRYPTO 2019, Part II. Ed. by Alexandra Boldyreva and Daniele Micciancio. Vol. 11693. Lecture Notes in Computer Science. Santa Barbara, CA, USA: Springer, Heidelberg, Germany, 2019, pp. 61\u201384. doi: https:\/\/doi.org\/10.1007\/978-3-030-26951-7_3.","DOI":"10.1007\/978-3-030-26951-7_3"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Ivan Damg\u00e5rd and Jesper Buus Nielsen. \u201cScalable and Unconditionally Secure Multiparty Computation\u201d. In: Advances in Cryptology - CRYPTO 2007. Ed. by Alfred Menezes. Vol. 4622. Lecture Notes in Computer Science. Santa Barbara, CA, USA: Springer, Heidelberg, Germany, 2007, pp. 572\u2013590. doi: https:\/\/doi.org\/10.1007\/978-3-540-74143-5_32.","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Daniel Escudero and Serge Fehr. \u201cOn Fully-Secure Honest Majority MPC Without n2 Round Overhead\u201d. In: Progress in Cryptology - LATINCRYPT 2021: 7th International Conference on Cryptology and Information Security in Latin America. Ed. by Patrick Longa and Carla R\u00e0fols. Vol. 12912. Lecture Notes in Computer Science. Bogot\u00e1, Colombia: Springer, Heidelberg, Germany, 2021, pp. 47\u201366. doi: https:\/\/doi.org\/10.1007\/978-3-031-44469-2_3.","DOI":"10.1007\/978-3-031-44469-2_3"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Daniel Escudero, Vipul Goyal, Antigoni Polychroniadou, and Yifan Song. \u201cTurboPack: Honest Majority MPC with Constant Online Communication\u201d. In: ACM CCS 2022: 29th Conference on Computer and Communications Security. Ed. by Heng Yin, Angelos Stavrou, Cas Cremers, and Elaine Shi. Los Angeles, CA, USA: ACM Press, 2022, pp. 951\u2013964. doi: https:\/\/doi.org\/10.1145\/3548606.3560633.","DOI":"10.1145\/3548606.3560633"},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Matthew K. Franklin and Moti Yung. \u201cCommunication Complexity of Secure Computation (Extended Abstract)\u201d. In: 24th Annual ACM Symposium on Theory of Computing. Victoria, BC, Canada: ACM Press, 1992, pp. 699\u2013710. doi: https:\/\/doi.org\/10.1145\/129712.129780.","DOI":"10.1145\/129712.129780"},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Vipul Goyal, Yanyi Liu, and Yifan Song. \u201cCommunication-Efficient Unconditional MPC with Guaranteed Output Delivery\u201d. In: Advances in Cryptology - CRYPTO 2019, Part II. Ed. by Alexandra Boldyreva and Daniele Micciancio. Vol. 11693. Lecture Notes in Computer Science. Santa Barbara, CA, USA: Springer, Heidelberg, Germany, 2019, pp. 85\u2013114. doi: https:\/\/doi.org\/10.1007\/978-3-030-26951-7_4.","DOI":"10.1007\/978-3-030-26951-7_4"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Vipul Goyal, Yifan Song, and Chenzhi Zhu. \u201cGuaranteed Output Delivery Comes Free in Honest Majority MPC\u201d. In: Advances in Cryptology - CRYPTO 2020, Part II. Ed. by Daniele Micciancio and Thomas Ristenpart. Vol. 12171. Lecture Notes in Computer Science. Santa Barbara, CA, USA: Springer, Heidelberg, Germany, 2020, pp. 618\u2013646. doi: https:\/\/doi.org\/10.1007\/978-3-030-56880-1_22.","DOI":"10.1007\/978-3-030-56880-1_22"},{"key":"8_CR19","doi-asserted-by":"publisher","unstructured":"Martin Hirt, Ueli M. Maurer, and Bartosz Przydatek. \u201cEfficient Secure Multi-party Computation\u201d. In: Advances in Cryptology - ASIACRYPT 2000. Ed. by Tatsuaki Okamoto. Vol. 1976. Lecture Notes in Computer Science. Kyoto, Japan: Springer, Heidelberg, Germany, 2000, pp. 143\u2013161. doi: https:\/\/doi.org\/10.1007\/3-540-44448-3_12.","DOI":"10.1007\/3-540-44448-3_12"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Yuval Ishai and Eyal Kushilevitz. \u201cPerfect constant-round secure computation via perfect randomizing polynomials\u201d. In: Automata, Languages and Programming: 29th International Colloquium, ICALP 2002 M\u00e1laga, Spain, July 8-13, 2002 Proceedings 29. Springer. 2002, pp. 244\u2013256.","DOI":"10.1007\/3-540-45465-9_22"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Yuval Ishai and Eyal Kushilevitz. \u201cRandomizing polynomials: A new representation with applications to round-efficient secure computation\u201d. In: Proceedings 41st Annual Symposium on Foundations of Computer Science. IEEE. 2000, pp. 294\u2013304.","DOI":"10.1109\/SFCS.2000.892118"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Yuval Ishai, Eyal Kushilevitz, Manoj Prabhakaran, Amit Sahai, and Ching- Hua Yu. \u201cSecure Protocol Transformations\u201d. In: Advances in Cryptology - CRYPTO 2016, Part II. Ed. by Matthew Robshaw and Jonathan Katz. Vol. 9815. Lecture Notes in Computer Science. Santa Barbara, CA, USA: Springer, Heidelberg, Germany, 2016, pp. 430\u2013458. doi: https:\/\/doi.org\/10.1007\/978-3-662-53008-5_15.","DOI":"10.1007\/978-3-662-53008-5_15"},{"key":"8_CR23","unstructured":"Arpita Patra and C. Pandu Rangan. Communication and Round Efficient Information Checking Protocol. 2010. arXiv: 1004.3504 [cs.CR]."},{"key":"8_CR24","doi-asserted-by":"publisher","unstructured":"Tal Rabin and Michael Ben-Or. \u201cVerifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract)\u201d. In: 21st Annual ACM Symposium on Theory of Computing. Seattle, WA, USA: ACM Press, 1989, pp. 73\u201385. doi: https:\/\/doi.org\/10.1145\/73007.73014.","DOI":"10.1145\/73007.73014"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0938-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T19:29:56Z","timestamp":1733945396000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0938-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819609376","9789819609383"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0938-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,12]]},"assertion":[{"value":"12 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}