{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T18:17:02Z","timestamp":1773512222798,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819609376","type":"print"},{"value":"9789819609383","type":"electronic"}],"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_4","type":"book-chapter","created":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T18:22:12Z","timestamp":1733941332000},"page":"102-132","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Perfectly-Secure Multiparty Computation with\u00a0Linear Communication Complexity over\u00a0Any Modulus"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Escudero","sequence":"first","affiliation":[]},{"given":"Yifan","family":"Song","sequence":"additional","affiliation":[]},{"given":"Wenhao","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,12]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Mark Abspoel, Ronald Cramer, Ivan Damg\u00e5rd, Daniel Escudero, and Chen Yuan. Efficient information-theoretic secure multiparty computation over $$\\mathbb{Z} \/p^k\\mathbb{Z}$$ via galois rings. In Dennis Hofheinz and Alon Rosen, editors, TCC\u00a02019: 17th Theory of Cryptography Conference, Part\u00a0I, volume 11891 of Lecture Notes in Computer Science, pages 471\u2013501, Nuremberg, Germany, December\u00a01\u20135, 2019. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-030-36030-6_19"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Mark Abspoel, Ronald Cramer, Daniel Escudero, Ivan Damg\u00e5rd, and Chaoping Xing.Improved single-round secure multiplication using regenerating codes.In Mehdi Tibouchi and Huaxiong Wang, editors, Advances in Cryptology \u2013 ASIACRYPT\u00a02021, Part\u00a0II, volume 13091 of Lecture Notes in Computer Science, pages 222\u2013244, Singapore, December\u00a06\u201310, 2021. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-030-92075-3_8"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Eli Ben-Sasson, Serge Fehr, and Rafail Ostrovsky. Near-linear unconditionally-secure multiparty computation with a dishonest minority.In Reihaneh Safavi-Naini and Ran Canetti, editors, Advances in Cryptology \u2013 CRYPTO\u00a02012, volume 7417 of Lecture Notes in Computer Science, pages 663\u2013680, Santa Barbara, CA, USA, August\u00a019\u201323, 2012. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-32009-5_39"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC \u201988, page 1\u201310, New York, NY, USA, 1988. Association for Computing Machinery.","DOI":"10.1145\/62212.62213"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Zuzana Beerliov\u00e1-Trub\u00edniov\u00e1 and Martin Hirt. Perfectly-secure MPC with linear communication complexity. In Ran Canetti, editor, TCC\u00a02008: 5th Theory of Cryptography Conference, volume 4948 of Lecture Notes in Computer Science, pages 213\u2013230, San Francisco, CA, USA, March\u00a019\u201321, 2008. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Ran Canetti. Security and composition of multiparty cryptographic protocols.Journal of Cryptology, 13(1):143\u2013202, January 2000.","DOI":"10.1007\/s001459910006"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Ignacio Cascudo, Ronald Cramer, Chaoping Xing, and Chen Yuan. Amortized complexity of information-theoretically secure MPC revisited.In Hovav Shacham and Alexandra Boldyreva, editors, Advances in Cryptology \u2013 CRYPTO\u00a02018, Part\u00a0III, volume 10993 of Lecture Notes in Computer Science, pages 395\u2013426, Santa Barbara, CA, USA, August\u00a019\u201323, 2018. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-319-96878-0_14"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Ronald Cramer, Matthieu Rambaud, and Chaoping Xing. Asymptotically-good arithmetic secret sharing over $$\\mathbb{Z} \/p^{\\ell }\\mathbb{Z}$$ with strong multiplication and its applications to efficient MPC. In Tal Malkin and Chris Peikert, editors, Advances in Cryptology \u2013 CRYPTO\u00a02021, Part\u00a0III, volume 12827 of Lecture Notes in Computer Science, pages 656\u2013686, Virtual Event, August\u00a016\u201320, 2021. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-030-84252-9_22"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd, Daniel Escudero, Tore\u00a0Kasper Frederiksen, Marcel Keller, Peter Scholl, and Nikolaj Volgushev. New primitives for actively-secure MPC over rings with applications to private machine learning. In 2019 IEEE Symposium on Security and Privacy, pages 1102\u20131120, San Francisco, CA, USA, May\u00a019\u201323, 2019. IEEE Computer Society Press.","DOI":"10.1109\/SP.2019.00078"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd, Yuval Ishai, and Mikkel Kr\u00f8igaard. Perfectly secure multiparty computation and the computational overhead of cryptography.In Henri Gilbert, editor, Advances in Cryptology \u2013 EUROCRYPT\u00a02010, volume 6110 of Lecture Notes in Computer Science, pages 445\u2013465, French Riviera, May\u00a030\u00a0\u2013\u00a0June\u00a03, 2010. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-642-13190-5_23"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd and Jesper\u00a0Buus Nielsen. Scalable and unconditionally secure multiparty computation. In Alfred Menezes, editor, Advances in Cryptology \u2013 CRYPTO\u00a02007, volume 4622 of Lecture Notes in Computer Science, pages 572\u2013590, Santa Barbara, CA, USA, August\u00a019\u201323, 2007. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Daniel Escudero, Hongqing Liu, Chaoping Xing, and Chen Yuan. Degree-$$ d $$ reverse multiplication-friendly embeddings: Constructions and applications. Asiacrypt, 2023.","DOI":"10.1007\/978-981-99-8721-4_4"},{"key":"4_CR13","unstructured":"Thibauld Feneuil and Matthieu Rivain. Threshold linear secret sharing to the rescue of MPC-in-the-head. Cryptology ePrint Archive, Report 2022\/1407, 2022. https:\/\/eprint.iacr.org\/2022\/1407."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Vipul Goyal, Yanyi Liu, and Yifan Song. Communication-efficient unconditional MPC with guaranteed output delivery.In Alexandra Boldyreva and Daniele Micciancio, editors, Advances in Cryptology \u2013 CRYPTO\u00a02019, Part\u00a0II, volume 11693 of Lecture Notes in Computer Science, pages 85\u2013114, Santa Barbara, CA, USA, August\u00a018\u201322, 2019. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-030-26951-7_4"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Vipul Goyal, Antigoni Polychroniadou, and Yifan Song. Unconditional communication-efficient MPC via hall\u2019s marriage theorem. In Tal Malkin and Chris Peikert, editors, Advances in Cryptology \u2013 CRYPTO\u00a02021, Part\u00a0II, volume 12826 of Lecture Notes in Computer Science, pages 275\u2013304, Virtual Event, August\u00a016\u201320, 2021. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-030-84245-1_10"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Vipul Goyal, Antigoni Polychroniadou, and Yifan Song. Sharing transformation and dishonest majority MPC with packed secret sharing. In Yevgeniy Dodis and Thomas Shrimpton, editors, Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0IV, volume 13510 of Lecture Notes in Computer Science, pages 3\u201332, Santa Barbara, CA, USA, August\u00a015\u201318, 2022. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-031-15985-5_1"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Vipul Goyal, Yifan Song, and Chenzhi Zhu. Guaranteed output delivery comes free in honest majority MPC. In Daniele Micciancio and Thomas Ristenpart, editors, Advances in Cryptology \u2013 CRYPTO\u00a02020, Part\u00a0II, volume 12171 of Lecture Notes in Computer Science, pages 618\u2013646, Santa Barbara, CA, USA, August\u00a017\u201321, 2020. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-030-56880-1_22"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Martin Hirt, Ueli\u00a0M. Maurer, and Bartosz Przydatek. Efficient secure multi-party computation. In Tatsuaki Okamoto, editor, Advances in Cryptology \u2013 ASIACRYPT\u00a02000, volume 1976 of Lecture Notes in Computer Science, pages 143\u2013161, Kyoto, Japan, December\u00a03\u20137, 2000. Springer, Heidelberg, Germany.","DOI":"10.1007\/3-540-44448-3_12"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Yuval Ishai, Eyal Kushilevitz, Manoj Prabhakaran, Amit Sahai, and Ching-Hua Yu. Secure protocol transformations.In Matthew Robshaw and Jonathan Katz, editors, Advances in Cryptology \u2013 CRYPTO\u00a02016, Part\u00a0II, volume 9815 of Lecture Notes in Computer Science, pages 430\u2013458, Santa Barbara, CA, USA, August\u00a014\u201318, 2016. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-662-53008-5_15"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Antigoni Polychroniadou and Yifan Song. Constant-overhead unconditionally secure multiparty computation over binary fields. In Anne Canteaut and Fran\u00e7ois-Xavier Standaert, editors, Advances in Cryptology \u2013 EUROCRYPT\u00a02021, Part\u00a0II, volume 12697 of Lecture Notes in Computer Science, pages 812\u2013841, Zagreb, Croatia, October\u00a017\u201321, 2021. Springer, Heidelberg, Germany.","DOI":"10.1007\/978-3-030-77886-6_28"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Adi Shamir. How to share a secret. Communications of the Association for Computing Machinery, 22(11):612\u2013613, November 1979.","DOI":"10.1145\/359168.359176"},{"key":"4_CR22","unstructured":"Zhe-Xian Wan. Lectures on finite fields and Galois rings. World Scientific Publishing Company, 2003."}],"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_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T19:29:28Z","timestamp":1733945368000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0938-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,12]]},"ISBN":["9789819609376","9789819609383"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0938-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}}]}}