{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:13:37Z","timestamp":1743149617654,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031229114"},{"type":"electronic","value":"9783031229121"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22912-1_10","type":"book-chapter","created":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T15:38:49Z","timestamp":1672501129000},"page":"223-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries"],"prefix":"10.1007","author":[{"given":"Ananya","family":"Appan","sequence":"first","affiliation":[]},{"given":"Anirudh","family":"Chandramouli","sequence":"additional","affiliation":[]},{"given":"Ashish","family":"Choudhury","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Appan, A., Chandramouli, A., Choudhury, A.: Revisiting the efficiency of asynchronous multi party computation against general adversaries. IACR Cryptology ePrint Archive, p. 651 (2022)","DOI":"10.1007\/978-3-031-22912-1_10"},{"key":"10_CR2","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\u2014CRYPTO \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":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-540-76900-2_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"Z Beerliov\u00e1-Trub\u00edniov\u00e1","year":"2007","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M.: Simple and efficient perfectly-secure asynchronous MPC. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 376\u2013392. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76900-2_23"},{"key":"10_CR4","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":"10_CR5","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310. ACM (1988). https:\/\/doi.org\/10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"10_CR6","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":"10_CR7","unstructured":"Canetti, R.: Studies in secure multiparty computation and applications. Ph.D. thesis, Weizmann Institute, Israel (1995)"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security. J. ACM 67(5), 28:1\u201328:94 (2020). https:\/\/doi.org\/10.1145\/3402457","DOI":"10.1145\/3402457"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1007\/978-3-030-65277-7_35","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2020","author":"A Choudhury","year":"2020","unstructured":"Choudhury, A., Pappu, N.: Perfectly-secure asynchronous MPC for general adversaries (extended abstract). In: Bhargavan, K., Oswald, E., Prabhakaran, M. (eds.) INDOCRYPT 2020. LNCS, vol. 12578, pp. 786\u2013809. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-65277-7_35"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1109\/TIT.2016.2614685","volume":"63","author":"A Choudhury","year":"2017","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","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-662-49387-8_8","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"R Cohen","year":"2016","unstructured":"Cohen, R.: Asynchronous secure multiparty computation in constant time. In: Cheng, C.-M., Chung, K.-M., Persiano, G., Yang, B.-Y. (eds.) PKC 2016. LNCS, vol. 9615, pp. 183\u2013207. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49387-8_8"},{"key":"10_CR13","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"},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of Distributed Consensus with One Faulty Process. J. ACM 32(2), 374\u2013382 (1985). https:\/\/doi.org\/10.1145\/3149.214121","journal-title":"J. ACM"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BFb0056479","volume-title":"Distributed Computing","author":"M Fitzi","year":"1998","unstructured":"Fitzi, M., Maurer, U.: Efficient Byzantine agreement secure against general adversaries. In: Kutten, S. (ed.) DISC 1998. LNCS, vol. 1499, pp. 134\u2013148. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0056479"},{"key":"10_CR16","doi-asserted-by":"publisher","DOI":"10.5555\/1804390","volume-title":"The Foundations of Cryptography - Volume 2, Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 2, Basic Applications. Cambridge University Press, Cambridge (2004). https:\/\/doi.org\/10.5555\/1804390"},{"key":"10_CR17","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: STOC, pp. 218\u2013229. ACM (1987). https:\/\/doi.org\/10.1145\/28395.28420","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.: Player simulation and general adversary structures in perfect multiparty computation. J. Cryptol. 13(1), 31\u201360 (2000). https:\/\/doi.org\/10.1007\/s001459910003","journal-title":"J. Cryptol."},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-42045-0_10","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"M Hirt","year":"2013","unstructured":"Hirt, M., Tschudi, D.: Efficient general-adversary multi-party computation. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 181\u2013200. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_10"},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structures). In: Global Telecommunication Conference, Globecom, pp. 99\u2013102. IEEE Computer Society (1987). https:\/\/doi.org\/10.1002\/ecjc.4430720906","DOI":"10.1002\/ecjc.4430720906"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-642-36594-2_27","volume-title":"Theory of Cryptography","author":"J Katz","year":"2013","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 477\u2013498. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_27"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/3-540-45450-0_37","volume-title":"Information Security and Privacy","author":"MVNA Kumar","year":"2002","unstructured":"Kumar, M.V.N.A., Srinathan, K., Rangan, C.P.: Asynchronous perfectly secure computation tolerating generalized adversaries. In: Batten, L., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 497\u2013511. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45450-0_37"},{"key":"10_CR23","unstructured":"Kursawe, K., Freiling, F.C.: Byzantine fault tolerance on general hybrid adversary structures. Technical report, RWTH Aachen (2005)"},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-36413-7_2","volume-title":"Security in Communication Networks","author":"U Maurer","year":"2003","unstructured":"Maurer, U.: Secure multi-party computation made simple. In: Cimato, S., Persiano, G., Galdi, C. (eds.) SCN 2002. LNCS, vol. 2576, pp. 14\u201328. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36413-7_2"},{"issue":"1","key":"10_CR25","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00145-013-9172-7","volume":"28","author":"A Patra","year":"2013","unstructured":"Patra, A., Choudhury, A., Pandu Rangan, C.: Efficient asynchronous verifiable secret sharing and multiparty computation. J. Cryptol. 28(1), 49\u2013109 (2013). https:\/\/doi.org\/10.1007\/s00145-013-9172-7","journal-title":"J. Cryptol."},{"key":"10_CR26","doi-asserted-by":"publisher","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, pp. 73\u201385. ACM (1989). https:\/\/doi.org\/10.1145\/73007.73014","DOI":"10.1145\/73007.73014"},{"issue":"11","key":"10_CR27","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). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"10_CR28","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","Progress in Cryptology \u2013 INDOCRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22912-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,19]],"date-time":"2023-03-19T14:41:54Z","timestamp":1679236914000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22912-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031229114","9783031229121"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22912-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"INDOCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in India","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"indocrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.tcgcrest.org\/indocrypt-2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"74","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.22","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.59","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}