{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T14:59:57Z","timestamp":1769266797631,"version":"3.49.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031577215","type":"print"},{"value":"9783031577222","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-57722-2_6","type":"book-chapter","created":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T00:56:16Z","timestamp":1713056176000},"page":"171-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Network-Agnostic Multi-party Computation Revisited (Extended Abstract)"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-8216-0988","authenticated-orcid":false,"given":"Nidhish","family":"Bhimrajka","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2428-9537","authenticated-orcid":false,"given":"Ashish","family":"Choudhury","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2062-7076","authenticated-orcid":false,"given":"Supreeth","family":"Varadarajan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,14]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-031-22963-3_23","volume-title":"Advances in Cryptology - ASIACRYPT 2022","author":"AB Alexandru","year":"2022","unstructured":"Alexandru, A.B., Blum, E., Katz, J., Loss, J.: State machine replication under changing network conditions. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13791, pp. 681\u2013710. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_23"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-031-48618-0_3","volume-title":"Theory of Cryptography - TCC 2023","author":"A Appan","year":"2023","unstructured":"Appan, A., Choudhury, A.: Network agnostic MPC with statistical security. In: Rothblum, G., Wee, H. (eds.) TCC 2023. LNCS, vol. 14370, pp. 63\u201393. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48618-0_3"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Appan, A., Chandramouli, A., Choudhury, A.: Perfectly-secure synchronous MPC with asynchronous fallback guarantees. In: Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing. PODC\u201922, pp. 92\u2013102. Association for Computing Machinery (2022). https:\/\/doi.org\/10.1145\/3519270.3538417","DOI":"10.1145\/3519270.3538417"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Asharov, G., Lindell, Y.: A full proof of the BGW protocol for perfectly secure multiparty computation. J. Cryptol. 30(1), 58\u2013151 (2017).https:\/\/doi.org\/10.1007\/s00145-015-9214-4","DOI":"10.1007\/s00145-015-9214-4"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-031-38557-5_3","volume-title":"Advances in Cryptology - CRYPTO 2023","author":"R Bacho","year":"2023","unstructured":"Bacho, R., Collins, D., Liu-Zhang, C.D., Loss, J.: Network-agnostic security comes (almost) for free in DKG and MPC. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14081, pp. 71\u2013106. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_3"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Bangalore, L., Choudhury, A., Garimella, G.: Round efficient computationally secure multi-party computation revisited. In: Proceedings of the 20th International Conference on Distributed Computing and Networking. ICDCN \u201919, pp. 292\u2013301. Association for Computing Machinery, New York, NY, USA (2019). https:\/\/doi.org\/10.1145\/3288599.3288600","DOI":"10.1145\/3288599.3288600"},{"key":"6_CR7","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":"6_CR8","doi-asserted-by":"publisher","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing. STOC \u201990, pp. 503\u2013513. Association for Computing Machinery (1990). https:\/\/doi.org\/10.1145\/100216.100287","DOI":"10.1145\/100216.100287"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: STOC, pp. 52\u201361. ACM (1993). https:\/\/doi.org\/10.1145\/167088.167109","DOI":"10.1145\/167088.167109"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience (extended abstract). In: PODC, pp. 183\u2013192. ACM (1994). https:\/\/doi.org\/10.1145\/197917.198088","DOI":"10.1145\/197917.198088"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), pp. 1\u201310 (1988). https:\/\/doi.org\/10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Bhimrajka, N., Choudhury, A., Varadarajan, S.: Network-agnostic perfectly secure synchronous message transmission revisited. In: INDOCRYPT (2023). https:\/\/doi.org\/10.1007\/978-3-031-56235-8_2","DOI":"10.1007\/978-3-031-56235-8_2"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-030-92075-3_19","volume-title":"Advances in Cryptology - ASIACRYPT 2021","author":"E Blum","year":"2021","unstructured":"Blum, E., Katz, J., Loss, J.: Tardigrade: an atomic broadcast protocol for arbitrary network conditions. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13091, pp. 547\u2013572. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92075-3_19"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-030-36030-6_6","volume-title":"Theory of Cryptography - TCC 2019","author":"E Blum","year":"2019","unstructured":"Blum, E., Katz, J., Loss, J.: Synchronous consensus with optimal asynchronous fallback guarantees. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 131\u2013150. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_6"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-030-56880-1_25","volume-title":"Advances in Cryptology - CRYPTO 2020","author":"E Blum","year":"2020","unstructured":"Blum, E., Liu-Zhang, C.D., Loss, J.: Always have a backup plan: fully secure synchronous MPC with asynchronous fallback. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12171, pp. 707\u2013731. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_25"},{"key":"6_CR16","doi-asserted-by":"publisher","unstructured":"Bracha, G.: An asynchronous [(n - 1)\/3]-resilient consensus protocol. In: Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing. PODC \u201984, pp. 154\u2013162. Association for Computing Machinery (1984). https:\/\/doi.org\/10.1145\/800222.806743","DOI":"10.1145\/800222.806743"},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, R.: Asynchronous verifiable secret sharing and proactive cryptosystems. In: CCS, pp. 88\u201397. ACM (2002). https:\/\/doi.org\/10.1145\/586110.586124","DOI":"10.1145\/586110.586124"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience. In: STOC, pp. 42\u201351 (1993). https:\/\/doi.org\/10.1145\/167088.167105","DOI":"10.1145\/167088.167105"},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: FOCS, pp. 383\u2013395. IEEE Computer Society (1985). https:\/\/doi.org\/10.1109\/SFCS.1985.64","DOI":"10.1109\/SFCS.1985.64"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Choudhury, A., Patra, A.: Optimally resilient asynchronous MPC with linear communication complexity. In: ICDCN. ACM (2015). https:\/\/doi.org\/10.1145\/2684464.2684470","DOI":"10.1145\/2684464.2684470"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Choudhury, A., Patra, A.: An efficient framework for unconditionally secure multiparty computation. IEEE Trans. Inf. Theory 63(1), 428\u2013468 (2017). https:\/\/doi.org\/10.1109\/TIT.2016.2614685","DOI":"10.1109\/TIT.2016.2614685"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1007\/978-3-662-53890-6_33","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"S Coretti","year":"2016","unstructured":"Coretti, S., Garay, J., Hirt, M., Zikas, V.: Constant-round asynchronous multi-party computation based on one-way functions. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 998\u20131021. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_33"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"R Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 280\u2013300. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_18"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Cramer, R., Damg\u00e5rd, I.: Multiparty Computation, an Introduction, pp. 41\u201387. Birkh\u00e4user Basel (2006). https:\/\/doi.org\/10.1007\/3-7643-7394-6_2","DOI":"10.1007\/3-7643-7394-6_2"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/11818175_30","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Ishai, Y.: Scalable secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 501\u2013520. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_30"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-031-47754-6_5","volume-title":"Financial Cryptography and Data Security - FC 2023","author":"G Deligios","year":"2023","unstructured":"Deligios, G., Liu-Zhang, C.: Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees. In: Baldimtsi, F., Cachin, C. (eds.) FC 2023, Part I. Lecture Notes in Computer Science, vol. 13950, pp. 77\u201393. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-47754-6_5"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/978-3-030-90459-3_21","volume-title":"Theory of Cryptography","author":"G Deligios","year":"2021","unstructured":"Deligios, G., Hirt, M., Liu-Zhang, C.-D.: Round-efficient byzantine agreement and multi-party computation with asynchronous fallback. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 623\u2013653. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_21"},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"Dolev, D., Strong, H.R.: Authenticated algorithms for byzantine agreement. SIAM J. Comput. 12(4), 656\u2013666 (1983). https:\/\/doi.org\/10.1137\/0212045","DOI":"10.1137\/0212045"},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: STOC, pp. 148\u2013161. ACM (1988). https:\/\/doi.org\/10.1145\/62212.62225","DOI":"10.1145\/62212.62225"},{"key":"6_CR30","doi-asserted-by":"publisher","unstructured":"Ghinea, D., Liu-Zhang, C., Wattenhofer, R.: Optimal synchronous approximate agreement with asynchronous fallback. In: PODC \u201922: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, 25\u201329 July 2022, pp. 70\u201380. ACM (2022). https:\/\/doi.org\/10.1145\/3519270.3538442","DOI":"10.1145\/3519270.3538442"},{"key":"6_CR31","doi-asserted-by":"publisher","unstructured":"Ghinea, D., Liu-Zhang, C., Wattenhofer, R.: Multidimensional approximate agreement with asynchronous fallback. In: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2023, Orlando, FL, USA, 17\u201319 June 2023, pp. 141\u2013151. ACM (2023). https:\/\/doi.org\/10.1145\/3558481.3591105","DOI":"10.1145\/3558481.3591105"},{"key":"6_CR32","doi-asserted-by":"publisher","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.V. (ed.) Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, New York, USA, pp. 218\u2013229. ACM (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"key":"6_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/11426639_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"M Hirt","year":"2005","unstructured":"Hirt, M., Nielsen, J.B., Przydatek, B.: Cryptographic asynchronous multi-party computation with optimal resilience. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 322\u2013340. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_19"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-70583-3_39","volume-title":"Automata, Languages and Programming","author":"M Hirt","year":"2008","unstructured":"Hirt, M., Nielsen, J.B., Przydatek, B.: Asynchronous multi-party computation with quadratic communication. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 473\u2013485. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_39"},{"key":"6_CR35","doi-asserted-by":"publisher","unstructured":"Kate, A., Goldberg, I.: Distributed key generation for the internet. In: 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), 22\u201326 June 2009, Montreal, Qu\u00e9bec, Canada, pp. 119\u2013128. IEEE Computer Society (2009). https:\/\/doi.org\/10.1109\/ICDCS.2009.21","DOI":"10.1109\/ICDCS.2009.21"},{"key":"6_CR36","doi-asserted-by":"publisher","unstructured":"Momose, A., Ren, L.: Multi-threshold byzantine fault tolerance. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. CCS \u201921, pp. 1686\u20131699. Association for Computing Machinery (2021).https:\/\/doi.org\/10.1145\/3460120.3484554","DOI":"10.1145\/3460120.3484554"},{"key":"6_CR37","doi-asserted-by":"publisher","unstructured":"Patra, A., Choudhury, A., Pandu\u00a0Rangan, C.: Efficient asynchronous verifiable secret sharing and multiparty computation. J. Cryptol. 28(1), 49\u2013109 (2015). https:\/\/doi.org\/10.1007\/s00145-013-9172-7","DOI":"10.1007\/s00145-013-9172-7"},{"key":"6_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_9"},{"key":"6_CR39","doi-asserted-by":"publisher","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: Johnson, D.S. (ed.) Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 14\u201317 May 1989, Seattle, Washington, USA, pp. 73\u201385. ACM (1989). https:\/\/doi.org\/10.1145\/73007.73014","DOI":"10.1145\/73007.73014"},{"key":"6_CR40","doi-asserted-by":"publisher","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","DOI":"10.1145\/359168.359176"},{"key":"6_CR41","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Protocols for secure computations (extended abstract). In: FOCS, pp. 160\u2013164. IEEE Computer Society (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.38","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-57722-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T14:02:56Z","timestamp":1716386576000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57722-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031577215","9783031577222"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57722-2_6","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":"14 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"15 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}