{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:50Z","timestamp":1765113050035,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031780226"},{"type":"electronic","value":"9783031780233"}],"license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-78023-3_7","type":"book-chapter","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T10:50:54Z","timestamp":1733136654000},"page":"200-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["General Adversary Structures in\u00a0Byzantine Agreement and\u00a0Multi-party Computation with\u00a0Active and\u00a0Omission Corruption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-1261-4277","authenticated-orcid":false,"given":"Konstantinos","family":"Brazitikos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5422-7572","authenticated-orcid":false,"given":"Vassilis","family":"Zikas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Abdallah, M., Pucheral, P.: A low-cost non-blocking atomic commitment protocol for asynchronous systems. In: International Conference on Parallel and Distributed Systems, 1999, Proceedings. IEEE (1999)","DOI":"10.1007\/BFb0054516"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Altmann, B., Fitzi, M., Maurer, U.M.: Byzantine agreement secure against general adversaries in the dual failure model. In: Jayanti, P. (ed.) Distributed Computing, 13th International Symposium, Bratislava, Slovak Republic, September 27-29, 1999, Proceedings. Lecture Notes in Computer Science, vol.\u00a01693, pp. 123\u2013137. Springer (1999). https:\/\/doi.org\/10.1007\/3-540-48169-9_9","DOI":"10.1007\/3-540-48169-9_9"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Asharov, G., Cohen, R., Shochat, O.: Static vs. adaptive security in perfect MPC: A separation and the adaptive security of BGW. In: Dachman-Soled, D. (ed.) 3rd Conference on Information-Theoretic Cryptography, ITC 2022, July 5-7, 2022, Cambridge, MA, USA. LIPIcs, vol.\u00a0230, pp. 15:1\u201315:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ITC.2022.15","DOI":"10.4230\/LIPIcs.ITC.2022.15"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Asharov, G., Lindell, Y., Rabin, T.: Perfectly-secure multiplication for any t < n\/3. In: Rogaway, P. (ed.) Advances in Cryptology - CRYPTO 2011 - 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proceedings. Lecture Notes in Computer Science, vol.\u00a06841, pp. 240\u2013258. Springer (2011).https:\/\/doi.org\/10.1007\/978-3-642-22792-9_14","DOI":"10.1007\/978-3-642-22792-9_14"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Fitzi, M., Hirt, M., Maurer, U.M., Zikas, V.: MPC vs. SFE: perfect security in a unified corruption model. In: Canetti, R. (ed.) Theory of Cryptography, Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. Lecture Notes in Computer Science, vol.\u00a04948, pp. 231\u2013250. Springer (2008).https:\/\/doi.org\/10.1007\/978-3-540-78524-8_14","DOI":"10.1007\/978-3-540-78524-8_14"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Beerliov\u00e1-Trub\u00edniov\u00e1, Z., Hirt, M., Riser, M.: Efficient byzantine agreement with faulty minority. In: Kurosawa, K. (ed.) Advances in Cryptology - ASIACRYPT 2007, 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2-6, 2007, Proceedings. Lecture Notes in Computer Science, vol.\u00a04833, pp. 393\u2013409. Springer (2007).https:\/\/doi.org\/10.1007\/978-3-540-76900-2_24","DOI":"10.1007\/978-3-540-76900-2_24"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, pp. 1\u201310. ACM (1988). https:\/\/doi.org\/10.1145\/62212.62213","DOI":"10.1145\/62212.62213"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Towards optimal distributed consensus (extended abstract). In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 410\u2013415. IEEE Computer Society (1989).https:\/\/doi.org\/10.1109\/SFCS.1989.63511","DOI":"10.1109\/SFCS.1989.63511"},{"key":"7_CR9","unstructured":"Brazitikos, K., Zikas, V.: General adversary structures in byzantine agreement and multi-party computation with active and omission corruption. Cryptology ePrint Archive, Paper 2024\/209 (2024). https:\/\/eprint.iacr.org\/2024\/209"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14-17 October 2001, Las Vegas, Nevada, USA, pp. 136\u2013145. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/3-540-44987-6_17","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2001","author":"R Canetti","year":"2001","unstructured":"Canetti, R., Damgaard, I., Dziembowski, S., Ishai, Y., Malkin, T.: On adaptive vs. non-adaptive security of multiparty protocols. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 262\u2013279. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44987-6_17"},{"key":"7_CR12","doi-asserted-by":"publisher","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, pp. 11\u201319. ACM (1988). https:\/\/doi.org\/10.1145\/62212.62214","DOI":"10.1145\/62212.62214"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-662-53015-3_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"R Cohen","year":"2016","unstructured":"Cohen, R., Coretti, S., Garay, J., Zikas, V.: Probabilistic termination and composability of cryptographic protocols. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 240\u2013269. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_9"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Cohen, R., Garay, J.A., Zikas, V.: Completeness theorems for adaptively secure broadcast. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part I. Lecture Notes in Computer Science, vol. 14081, pp. 3\u201338. Springer (2023).https:\/\/doi.org\/10.1007\/978-3-031-38557-5_1","DOI":"10.1007\/978-3-031-38557-5_1"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. J. ACM 40(1), 17\u201347 (1993). https:\/\/doi.org\/10.1145\/138027.138036","DOI":"10.1145\/138027.138036"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Eldefrawy, K., Loss, J., Terner, B.: How byzantine is a send corruption? In: Ateniese, G., Venturi, D. (eds.) Applied Cryptography and Network Security - 20th International Conference, ACNS 2022, Rome, Italy, June 20-23, 2022, Proceedings. Lecture Notes in Computer Science, vol. 13269, pp. 684\u2013704. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-09234-3_34","DOI":"10.1007\/978-3-031-09234-3_34"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Feldman, P., Micali, S.: Optimal algorithms for byzantine agreement. In: Simon, J. (ed.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2-4, 1988, Chicago, Illinois, USA, pp. 148\u2013161. ACM (1988). https:\/\/doi.org\/10.1145\/62212.62225","DOI":"10.1145\/62212.62225"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0055724","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201998","author":"M Fitzi","year":"1998","unstructured":"Fitzi, M., Hirt, M., Maurer, U.: Trading correctness for privacy in unconditional multi-party computation. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 121\u2013136. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055724"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-540-48000-6_19","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"M Fitzi","year":"1999","unstructured":"Fitzi, M., Hirt, M., Maurer, U.: General adversaries in unconditional multi-party computation. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 232\u2013246. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48000-6_19"},{"key":"7_CR20","unstructured":"Hadzilacos, V.: Issues of Fault Tolerance in Concurrent Computations (Databases, Reliability, Transactions, Agreement Protocols, Distributed Computing). Ph.D. thesis, Harvard University, USA (1985), aAI8520209"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Hirt, M., Maurer, U.M.: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In: Burns, J.E., Attiya, H. (eds.) Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, Santa Barbara, California, USA, August 21-24, 1997, pp. 25\u201334. ACM (1997). https:\/\/doi.org\/10.1145\/259380.259412","DOI":"10.1145\/259380.259412"},{"key":"7_CR22","doi-asserted-by":"publisher","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","DOI":"10.1007\/s001459910003"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Hirt, M., Zikas, V.: Adaptively secure broadcast. In: Gilbert, H. (ed.) Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco \/ French Riviera, May 30 - June 3, 2010. Proceedings. Lecture Notes in Computer Science, vol.\u00a06110, pp. 466\u2013485. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_24","DOI":"10.1007\/978-3-642-13190-5_24"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. Electron. Commun. Japan (Part III: Fundamental Electronic Science) 72(9), 56\u201364 (1989)","DOI":"10.1002\/ecjc.4430720906"},{"key":"7_CR25","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":"7_CR26","doi-asserted-by":"publisher","unstructured":"Koo, C.: Secure computation with partial message loss. In: Halevi, S., Rabin, T. (eds.) Theory of Cryptography, Third Theory of Cryptography Conference, TCC 2006, New York, NY, USA, March 4-7, 2006, Proceedings. Lecture Notes in Computer Science, vol.\u00a03876, pp. 502\u2013521. Springer (2006). https:\/\/doi.org\/10.1007\/11681878_26","DOI":"10.1007\/11681878_26"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982). https:\/\/doi.org\/10.1145\/357172.357176","DOI":"10.1145\/357172.357176"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Lindell, Y., Pinkas, B.: A proof of security of yao\u2019s protocol for two-party computation. J. Cryptol. 22(2), 161\u2013188 (2009). https:\/\/doi.org\/10.1007\/s00145-008-9036-8","DOI":"10.1007\/s00145-008-9036-8"},{"key":"7_CR29","doi-asserted-by":"publisher","unstructured":"Loss, J., Stern, G.: Zombies and ghosts: Optimal byzantine agreement in the presence of omission faults. In: Rothblum, G.N., Wee, H. (eds.) Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part IV. Lecture Notes in Computer Science, vol. 14372, pp. 395\u2013421. Springer (2023).https:\/\/doi.org\/10.1007\/978-3-031-48624-1_15","DOI":"10.1007\/978-3-031-48624-1_15"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Maurer, U.M.: Secure multi-party computation made simple. In: Cimato, S., Galdi, C., Persiano, G. (eds.) Security in Communication Networks, Third International Conference, SCN 2002, Amalfi, Italy, September 11-13, 2002. Revised Papers. Lecture Notes in Computer Science, vol.\u00a02576, pp. 14\u201328. Springer (2002). https:\/\/doi.org\/10.1007\/3-540-36413-7_2","DOI":"10.1007\/3-540-36413-7_2"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Parv\u00e9dy, P.R., Raynal, M.: Uniform agreement despite process omission failures. In: 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 22-26 April 2003, Nice, France, CD-ROM\/Abstracts Proceedings, p.\u00a0212. IEEE Computer Society (2003). https:\/\/doi.org\/10.1109\/IPDPS.2003.1213388","DOI":"10.1109\/IPDPS.2003.1213388"},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980). https:\/\/doi.org\/10.1145\/322186.322188","DOI":"10.1145\/322186.322188"},{"key":"7_CR33","doi-asserted-by":"publisher","unstructured":"Perry, K.J., Toueg, S.: Distributed agreement in the presence of processor and communication faults. IEEE Trans. Software Eng. 12(3), 477\u2013482 (1986). https:\/\/doi.org\/10.1109\/TSE.1986.6312888","DOI":"10.1109\/TSE.1986.6312888"},{"key":"7_CR34","doi-asserted-by":"publisher","unstructured":"Raynal, M.: Consensus in synchronous systems: A concise guided tour. In: 9th Pacific Rim International Symposium on Dependable Computing (PRDC 2002), 16-18 December 2002, Tsukuba-City, Ibarski, Japan, pp. 221\u2013228. IEEE Computer Society (2002). https:\/\/doi.org\/10.1109\/PRDC.2002.1185641","DOI":"10.1109\/PRDC.2002.1185641"},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Protocols for secure computations (extended abstract). In: 23rd Annual Symposium on Foundations of Computer Science, Chicago, Illinois, USA, 3-5 November 1982, pp. 160\u2013164. IEEE Computer Society (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.38","DOI":"10.1109\/SFCS.1982.38"},{"key":"7_CR36","unstructured":"Zikas, V.: Generalized corruption models in secure multi-party computation. Ph.D. thesis, ETH Zurich (2010). https:\/\/d-nb.info\/1005005729"},{"key":"7_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-642-00457-5_17","volume-title":"Theory of Cryptography","author":"V Zikas","year":"2009","unstructured":"Zikas, V., Hauser, S., Maurer, U.: Realistic failures in secure multi-party computation. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 274\u2013293. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_17"}],"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-031-78023-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T11:04:34Z","timestamp":1733137474000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78023-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"ISBN":["9783031780226","9783031780233"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78023-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,3]]},"assertion":[{"value":"3 December 2024","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":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}