{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T16:20:01Z","timestamp":1764606001342,"version":"3.46.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032122865","type":"print"},{"value":"9783032122872","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-12287-2_5","type":"book-chapter","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T16:17:47Z","timestamp":1764605867000},"page":"119-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Achieving \u201cBest-in-the-Multiverse\u201d MPC"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9111-5641","authenticated-orcid":false,"given":"Anasuya","family":"Acharya","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8951-5099","authenticated-orcid":false,"given":"Carmit","family":"Hazay","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9765-7911","authenticated-orcid":false,"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,2]]},"reference":[{"key":"5_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-031-38557-5_11","volume-title":"CRYPTO 2023","author":"A Acharya","year":"2023","unstructured":"Acharya, A., Hazay, C., Poburinnaya, O., Venkitasubramaniam, M.: Best of both worlds. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, vol. 14081, pp. 328\u2013359. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38557-5_11"},{"key":"5_CR2","unstructured":"Acharya, A., Hazay, C., Venkitasubramaniam, M.: On achieving \u201cbest-in-the-multiverse\u201d MPC. IACR Cryptology ePrint Archive, p.\u00a01557 (2025). https:\/\/eprint.iacr.org\/2025\/1557"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 1\u201310 (1988). https:\/\/doi.org\/10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/3-540-44750-4_29","volume-title":"Advances in Cryptology \u2014 CRYPT0\u2019 95","author":"GR Blakley","year":"1995","unstructured":"Blakley, G.R., Kabatianski, G.A.: On general perfect secret sharing schemes. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 367\u2013371. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-44750-4_29"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Chandramouli, A., Choudhury, A., Patra, A.: A survey on perfectly secure verifiable secret-sharing. ACM Comput. Surv. 54(11s), 232:1\u2013232:36 (2022). https:\/\/doi.org\/10.1145\/3512344","DOI":"10.1145\/3512344"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/0-387-34805-0_52","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"D Chaum","year":"1990","unstructured":"Chaum, D.: The spymasters double-agent problem. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 591\u2013602. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_52"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-48184-2_7","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201987","author":"D Chaum","year":"1988","unstructured":"Chaum, D., Damg\u00e5rd, I.B., van de Graaf, J.: Multiparty computations ensuring privacy of each party\u2019s input and correctness of the result. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 87\u2013119. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-48184-2_7"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-662-45608-8_25","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"R Cohen","year":"2014","unstructured":"Cohen, R., Lindell, Y.: Fairness versus guaranteed output delivery in secure multiparty computation. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 466\u2013485. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45608-8_25"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I., Nielsen, J.B.: Secure Multiparty Computation and Secret Sharing (2015). http:\/\/www.cambridge.org\/de\/academic\/subjects\/computer-science\/cryptography-cryptology-and-coding\/secure-multiparty-computation-and-secret-sharing?format=HB&isbn=9781107043053","DOI":"10.1017\/CBO9781107337756"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 2: Basic Applications. Cambridge University Press (2004). https:\/\/doi.org\/10.1017\/CBO9780511721656","DOI":"10.1017\/CBO9780511721656"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-47721-7_11","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"O Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design (extended abstract). In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 171\u2013185. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_11"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-030-45724-2_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"C Hazay","year":"2020","unstructured":"Hazay, C., Venkitasubramaniam, M., Weiss, M.: The price of active security in cryptographic protocols. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 184\u2013215. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_7"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Hirt, M., Maurer, U.M.: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In: PODC 1997, pp. 25\u201334 (1997). https:\/\/doi.org\/10.1145\/259380.259412","DOI":"10.1145\/259380.259412"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.M.: 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":"5_CR15","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"},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1137\/100783224","volume":"40","author":"Y Ishai","year":"2011","unstructured":"Ishai, Y., Katz, J., Kushilevitz, E., Lindell, Y., Petrank, E.: On achieving the \u201cbest of both worlds\u2019\u2019 in secure multiparty computation. SIAM J. Comput. 40(1), 122\u2013141 (2011). https:\/\/doi.org\/10.1137\/100783224","journal-title":"SIAM J. Comput."},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Katz, J.: On achieving the \u201cbest of both worlds\u201d in secure multiparty computation. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, 11\u201313 June 2007, pp. 11\u201320 (2007). https:\/\/doi.org\/10.1145\/1250790.1250793","DOI":"10.1145\/1250790.1250793"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Lucas, C., Raub, D., Maurer, U.M.: Hybrid-secure MPC: trading information-theoretic robustness for computational privacy. In: PODC 2010, pp. 219\u2013228 (2010). https:\/\/doi.org\/10.1145\/1835698.1835747","DOI":"10.1145\/1835698.1835747"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-030-64840-4_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"A Patra","year":"2020","unstructured":"Patra, A., Ravi, D., Singla, S.: On the exact round complexity of best-of-both-worlds multi-party computation. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12493, pp. 60\u201391. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_3"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979). http:\/\/doi.acm.org\/10.1145\/359168.359176","DOI":"10.1145\/359168.359176"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: FoCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-12287-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T16:17:51Z","timestamp":1764605871000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12287-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,2]]},"ISBN":["9783032122865","9783032122872"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12287-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,2]]},"assertion":[{"value":"2 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","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":"tcc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}