{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T10:59:00Z","timestamp":1778065140898,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733500","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"121-130","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Perfectly-secure Network-agnostic MPC with Optimal Resiliency"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4820-6652","authenticated-orcid":false,"given":"Shravani","family":"Patil","sequence":"first","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8036-4407","authenticated-orcid":false,"given":"Arpita","family":"Patra","sequence":"additional","affiliation":[{"name":"Indian Institute of Science, Bangalore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405722"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538417"},{"key":"e_1_3_2_1_3_1","volume-title":"Network Agnostic Perfectly Secure MPC Against General Adversaries. In 37th International Symposium on Distributed Computing (DISC","author":"Appan Ananya","year":"2023","unstructured":"Ananya Appan, Anirudh Chandramouli, and Ashish Choudhury. 2023. Network Agnostic Perfectly Secure MPC Against General Adversaries. In 37th International Symposium on Distributed Computing (DISC 2023). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_4_1","volume-title":"Network Agnostic MPC with Statistical Security. arXiv preprint arXiv:2306.01401","author":"Appan Ananya","year":"2023","unstructured":"Ananya Appan and Ashish Choudhury. 2023. Network Agnostic MPC with Statistical Security. arXiv preprint arXiv:2306.01401 (2023)."},{"key":"e_1_3_2_1_5_1","volume-title":"Annual International Cryptology Conference.","author":"Beaver Donald","year":"1991","unstructured":"Donald Beaver. 1991. Efficient multiparty protocols using circuit randomization. In Annual International Cryptology Conference."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167109"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or Shafi Goldwasser and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In STOC.","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198088"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36030-6_6"},{"key":"e_1_3_2_1_11_1","volume-title":"Network-agnostic state machine replication. arXiv preprint arXiv:2002.03437","author":"Blum Erica","year":"2020","unstructured":"Erica Blum, Jonathan Katz, and Julian Loss. 2020. Network-agnostic state machine replication. arXiv preprint arXiv:2002.03437 (2020)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_25"},{"key":"e_1_3_2_1_13_1","unstructured":"Ran Canetti. 1996. Studies in secure multiparty computation and applications. Ph. D. Dissertation. Citeseer."},{"key":"e_1_3_2_1_14_1","volume-title":"An efficient framework for unconditionally secure multiparty computation","author":"Choudhury Ashish","year":"2016","unstructured":"Ashish Choudhury and Arpita Patra. 2016. An efficient framework for unconditionally secure multiparty computation. IEEE Transactions on Information Theory (2016)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90459-3_21"},{"key":"e_1_3_2_1_16_1","volume-title":"International Conference on Financial Cryptography and Data Security. Springer, 77\u201393","author":"Deligios Giovanni","year":"2023","unstructured":"Giovanni Deligios and Chen-Da Liu-Zhang. 2023. Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees. In International Conference on Financial Cryptography and Data Security. Springer, 77\u201393."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_29"},{"key":"e_1_3_2_1_18_1","volume-title":"Reaching agreement in the presence of faults. Journal of the ACM (JACM)","author":"Pease Marshall","year":"1980","unstructured":"Marshall Pease, Robert Shostak, and Leslie Lamport. 1980. Reaching agreement in the presence of faults. Journal of the ACM (JACM) (1980)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/195613.195621"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of ACM Symposium on Theory of Computing.","author":"Rabin Tal","year":"1989","unstructured":"Tal Rabin and Michael Ben-Or. 1989. Verifiable Secret Sharing and Multiparty Protocols with Honest Majority (Extended Abstract). In Proceedings of ACM Symposium on Theory of Computing."},{"key":"e_1_3_2_1_21_1","unstructured":"Patil Shravani and Arpita Patra. 2024. Perfectly-secure Network-agnostic MPC with Optimal Resiliency. https:\/\/eprint.iacr.org\/2024\/990. Full version of this paper."}],"event":{"name":"PODC '25: ACM Symposium on Principles of Distributed Computing","location":"Hotel Las Brisas Huatulco Huatulco Mexico","acronym":"PODC '25","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:26:10Z","timestamp":1749824770000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733500"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":21,"alternative-id":["10.1145\/3732772.3733500","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733500","relation":{},"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}