{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T07:16:20Z","timestamp":1763968580851,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031683961"},{"type":"electronic","value":"9783031683978"}],"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-68397-8_14","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:01:41Z","timestamp":1723759301000},"page":"454-488","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Cheater Identification on\u00a0a\u00a0Budget: MPC with\u00a0Identifiable Abort from\u00a0Pairwise MACs"],"prefix":"10.1007","author":[{"given":"Carsten","family":"Baum","sequence":"first","affiliation":[]},{"given":"Nikolas","family":"Melissaris","sequence":"additional","affiliation":[]},{"given":"Rahul","family":"Rachuri","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Scholl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Attema, T., Dunning, V., Everts, M., Langenkamp, P.: Efficient compiler to covert security with public verifiability for honest majority MPC. In: Ateniese, G., Venturi, D. (eds.) Applied Cryptography and Network Security, ACNS 2022. LNCS, vol. 13269, pp. 663\u2013683. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09234-3_33","DOI":"10.1007\/978-3-031-09234-3_33"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Aumann, Y., Lindell, Y.: Security against covert adversaries: efficient protocols for realistic adversaries. In: Vadhan, S.P. (eds.) Theory of Cryptography, TCC 2007. LNCS, vol. 4392, pp. 137\u2013156. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_8","DOI":"10.1007\/978-3-540-70936-7_8"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, November 2019, pp. 291\u2013308. ACM Press (2019)","DOI":"10.1145\/3319535.3354255"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators from ring-LPN. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology, CRYPTO 2020. LNCS, vol. 12171, pp. 387\u2013416 (2020). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-56880-1_14","DOI":"10.1007\/978-3-030-56880-1_14"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: Lie, D., Mannan, M., Backes, M., Wang, X., (eds.) ACM CCS 2018, October 2018, pp. 896\u2013912. ACM Press (2018)","DOI":"10.1145\/3243734.3243868"},{"key":"14_CR6","unstructured":"Baum, C., David, B., Dowsley, R.: A framework for universally composable publicly verifiable cryptographic protocols. Cryptology ePrint Archive, Report 2020\/207 (2020). https:\/\/eprint.iacr.org\/2020\/207"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Bendlin, R., Damg\u00e5rd, I., Orlandi, C., Zakarias, S.: Semi-homomorphic encryption and multiparty computation. In: Paterson, K.G. (eds.) Advances in Cryptology, EUROCRYPT 2011. LNCS, vol. 6632, pp. 169\u2013188. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_11","DOI":"10.1007\/978-3-642-20465-4_11"},{"issue":"11","key":"14_CR8","first-page":"3527","volume":"91","author":"C Baum","year":"2023","unstructured":"Baum, C., Dittmer, S., Scholl, P., Wang, X.: Sok: vector OLE-based zero-knowledge protocols. DCC 91(11), 3527\u20133561 (2023)","journal-title":"DCC"},{"key":"14_CR9","unstructured":"Brandt, N.-P., Maier, S., M\u00fcller, T., M\u00fcller-Quade, J.: Constructing secure multi-party computation with identifiable abort. Cryptology ePrint Archive, Report 2020\/153 (2020). https:\/\/eprint.iacr.org\/2020\/153"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: 22nd ACM STOC, May 1990, pp. 503\u2013513. ACM Press (1990)","DOI":"10.1145\/100216.100287"},{"key":"14_CR11","unstructured":"Baum, C., Melissaris, N., Rachuri, R., Scholl, P.: Cheater identification on a budget: MPC with identifiable abort from pairwise macs. Cryptology ePrint Archive, Paper 2023\/1548 (2023). https:\/\/eprint.iacr.org\/2023\/1548"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-662-53641-4_18","volume-title":"Theory of Cryptography","author":"C Baum","year":"2016","unstructured":"Baum, C., Orsini, E., Scholl, P.: Efficient secure multiparty computation with identifiable abort. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9985, pp. 461\u2013490. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_18"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Baum, C., Orsini, E., Scholl, P., Soria-Vazquez, E.: Efficient constant-round MPC with identifiable abort and public verifiability. In: Micciancio, D., Ristenpart, T. (eds.) Advances in Cryptology, CRYPTO 2020, Part II. LNCS, vol. 12171, pp. 562\u2013592. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56880-1_20","DOI":"10.1007\/978-3-030-56880-1_20"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, October 2001, pp. 136\u2013145. IEEE Computer Society Press (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"14_CR15","unstructured":"Cohen, R., Doerner, J., Kondi, Y., Shelat, A.: Secure multiparty computation with identifiable abort from vindicating release. Cryptology ePrint Archive, Paper 2023\/1136 (2023). https:\/\/eprint.iacr.org\/2023\/1136"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Cunningham, R., Fuller, B., Yakoubov, S.: Catching MPC cheaters: identification and openability. In: Shikata, J. (eds.) Information Theoretic Security, ICITS 2017. LNCS, vol. 10681, pp. 110\u2013134. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72089-0_7","DOI":"10.1007\/978-3-319-72089-0_7"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Cohen, R., Garay, J., Zikas, V.: Broadcast-optimal two-round MPC. In: Canteaut, A., Ishai, Y. (eds) Advances in Cryptology, EUROCRYPT 2020, Part II. LNCS, vol. 12106, pp. 828\u2013858. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_28","DOI":"10.1007\/978-3-030-45724-2_28"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Chen, M., et al.: Diogenes: lightweight scalable RSA modulus generation with a dishonest majority. In: 2021 IEEE Symposium on Security and Privacy, May 2021, pp. 590\u2013607. IEEE Computer Society Press (2021)","DOI":"10.1109\/SP40001.2021.00025"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: 18th ACM STOC, May 1986, pp. 364\u2013369. ACM Press (1986)","DOI":"10.1145\/12130.12168"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Ciampi, M., Ravi, D., Siniscalchi, L., Waldner. H., Round-optimal multi-party computation with identifiable abort. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology, EUROCRYPT\u00a02022, Part\u00a0I. LNCS, May\/June 2022, vol. 13275, pp. 335\u2013364. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_12","DOI":"10.1007\/978-3-031-06944-4_12"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-030-84245-1_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"I Damg\u00e5rd","year":"2021","unstructured":"Damg\u00e5rd, I., Magri, B., Ravi, D., Siniscalchi, L., Yakoubov, S.: Broadcast-optimal two round MPC with an honest majority. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 155\u2013184. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_6"},{"key":"14_CR22","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Pastro, V., Smart, N.P., Zakarias, S.: Multiparty computation from somewhat homomorphic encryption. In: Safavi-Naini, R., Canetti, R. (eds.) Advances in Cryptology, CRYPTO 2012. LNCS, vol. 7417, pp. 643\u2013662. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_38","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"Damg\u00e5rd, I., Ravi, D., Siniscalchi, L., Yakoubov, S.: Minimizing setup in broadcast-optimal two round MPC. In: Hazay, C., Stam, M. (eds.) Advances in Cryptology, EUROCRYPT 2023, Part II. LNCS, vol. 14005, pp. 129\u2013158. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30617-4_5","DOI":"10.1007\/978-3-031-30617-4_5"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Faust, S., Hazay, C., Kretzler, D., Schlosser, B.: Generic compiler for publicly verifiable covert multi-party computation. In: Canteaut, A., Standaert, F.X. (eds.) Advances in Cryptology, EUROCRYPT 2021, Part II. LNCS, vol. 12697, pp. 782\u2013811. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_27","DOI":"10.1007\/978-3-030-77886-6_27"},{"key":"14_CR25","doi-asserted-by":"crossref","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. (ed.) 19th ACM STOC, May 1987, pp. 218\u2013229. ACM Press (1987)","DOI":"10.1145\/28395.28420"},{"key":"14_CR26","unstructured":"Hazay, C., Venkitasubramaniam, M., Weiss, M.: Protecting distributed primitives against leakage: equivocal secret sharing and more. In: 3rd Conference on Information-Theoretic Cryptography, ITC 2022 (2022)"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Ostrovsky, R., Seyalioglu, H.: Identifying cheaters without an honest majority. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 21\u201338. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_2","DOI":"10.1007\/978-3-642-28914-9_2"},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"Ishai, Y., Ostrovsky, R., Zikas, V.: Secure multi-party computation with identifiable abort. In: Garay, J.A., Gennaro, R. (eds.) Advances in Cryptology, CRYPTO 2014, Part II. LNCS, vol. 8617, pp. 369\u2013386. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_21","DOI":"10.1007\/978-3-662-44381-1_21"},{"key":"14_CR29","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"14_CR30","doi-asserted-by":"publisher","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_31","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"14_CR31","doi-asserted-by":"publisher","unstructured":"Rachuri, R., Scholl, P.: Le mans: dynamic and fluid MPC for dishonest majority. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 719\u2013749. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_25","DOI":"10.1007\/978-3-031-15802-5_25"},{"key":"14_CR32","doi-asserted-by":"publisher","unstructured":"Spini, G., Fehr, S.: Cheater detection in SPDZ multiparty computation. In: Nascimento, A.C.A., Barreto, P. (eds.) ICITS 2016. LNCS, vol. 10015, pp. 151\u2013176. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49175-2_8","DOI":"10.1007\/978-3-319-49175-2_8"},{"key":"14_CR33","unstructured":"Scholl, P., Simkin, M., Siniscalchi, L.: Multiparty computation with covert security and public verifiability. In: 3rd Conference on Information-Theoretic Cryptography (2022)"},{"key":"14_CR34","doi-asserted-by":"publisher","unstructured":"Simkin, M., Siniscalchi, L., Yakoubov, S.: On sufficient oracles for secure computation with identifiable abort. In: Galdi, C., Jarecki, S. (eds.) Security and Cryptography for Networks, SCN 2022. LNCS, vol. 13409, pp. 494\u2013515. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-14791-3_22","DOI":"10.1007\/978-3-031-14791-3_22"},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Weng, C., Yang, K., Katz, J., Wang, X.: Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits. In: 2021 IEEE Symposium on Security and Privacy, May 2021, pp. 1074\u20131091. IEEE Computer Society Press (2021)","DOI":"10.1109\/SP40001.2021.00056"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68397-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T22:03:32Z","timestamp":1723759412000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68397-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683961","9783031683978"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68397-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}