{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T13:10:07Z","timestamp":1765113007478,"version":"3.46.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031486234"},{"type":"electronic","value":"9783031486241"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-48624-1_15","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T18:02:21Z","timestamp":1701021741000},"page":"395-421","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Zombies and\u00a0Ghosts: Optimal Byzantine Agreement in\u00a0the\u00a0Presence of\u00a0Omission Faults"],"prefix":"10.1007","author":[{"given":"Julian","family":"Loss","sequence":"first","affiliation":[]},{"given":"Gilad","family":"Stern","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Abraham, I., Dolev, D., Kagan, A., Stern, G.: Brief announcement: authenticated consensus in synchronous systems with mixed faults. In: Scheideler, C. (ed.) 36th International Symposium on Distributed Computing, DISC 2022, 25\u201327 October 2022, Augusta, Georgia, USA. LIPIcs, vol. 246, pp. 38:1\u201338:3. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2022.38","key":"15_CR1","DOI":"10.4230\/LIPIcs.DISC.2022.38"},{"unstructured":"Abraham, I., Malkhi, D., Spiegelman, A.: Validated asynchronous Byzantine agreement with optimal resilience and asymptotically optimal time and word communication. CoRR abs\/1811.01332 (2018). arXiv arXiv:1811.01332","key":"15_CR2"},{"doi-asserted-by":"publisher","unstructured":"Bessani, A.N., Sousa, J., Alchieri, E.A.P.: State machine replication for the masses with BFT-SMART. In: 44th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2014, Atlanta, GA, USA, 23\u201326 June 2014, pp. 355\u2013362. IEEE Computer Society (2014). https:\/\/doi.org\/10.1109\/DSN.2014.43","key":"15_CR3","DOI":"10.1109\/DSN.2014.43"},{"key":"15_CR4","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","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"},{"unstructured":"Castro, M., Liskov, B.: Practical Byzantine fault tolerance. In: Seltzer, M.I., Leach, P.J. (eds.) Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, Louisiana, USA, 22\u201325 February 1999, pp. 173\u2013186. USENIX Association (1999). https:\/\/dl.acm.org\/citation.cfm?id=296824","key":"15_CR5"},{"doi-asserted-by":"publisher","unstructured":"Chun, B., Maniatis, P., Shenker, S., Kubiatowicz, J.: Attested append-only memory: making adversaries stick to their word. In: Bressoud, T.C., Kaashoek, M.F. (eds.) 2007 Proceedings of the 21st ACM Symposium on Operating Systems Principles, SOSP 2007, Stevenson, Washington, USA, 14\u201317 October 2007, pp. 189\u2013204. ACM (2007). https:\/\/doi.org\/10.1145\/1294261.1294280","key":"15_CR6","DOI":"10.1145\/1294261.1294280"},{"doi-asserted-by":"publisher","unstructured":"Clement, A., et al.: Upright cluster services. In: Matthews, J.N., Anderson, T.E. (eds.) 2009 Proceedings of the 22nd ACM Symposium on Operating Systems Principles, SOSP 2009, Big Sky, Montana, USA, 11\u201314 October 2009, pp. 277\u2013290. ACM (2009). https:\/\/doi.org\/10.1145\/1629575.1629602","key":"15_CR7","DOI":"10.1145\/1629575.1629602"},{"doi-asserted-by":"publisher","unstructured":"Correia, M., Lung, L.C., Neves, N.F., Ver\u00edssimo, P.: Efficient Byzantine-resilient reliable multicast on a hybrid failure model. In: 21st Symposium on Reliable Distributed Systems, SRDS 2002, 13\u201316 October 2002, Osaka, Japan, pp. 2\u201311. IEEE Computer Society (2002). https:\/\/doi.org\/10.1109\/RELDIS.2002.1180168","key":"15_CR8","DOI":"10.1109\/RELDIS.2002.1180168"},{"doi-asserted-by":"publisher","unstructured":"Correia, M., Neves, N.F., Ver\u00edssimo, P.: How to tolerate half less one Byzantine nodes in practical distributed systems. In: 23rd International Symposium on Reliable Distributed Systems, SRDS 2004, 18\u201320 October 2004, Florianpolis, Brazil, pp. 174\u2013183. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/RELDIS.2004.1353018","key":"15_CR9","DOI":"10.1109\/RELDIS.2004.1353018"},{"issue":"4","key":"15_CR10","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","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","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"publisher","unstructured":"Eldefrawy, K., Loss, J., Terner, B.: How Byzantine is a send corruption? In: Ateniese, G., Venturi, D. (eds.) Proceedings of the 20th International Conference on Applied Cryptography and Network Security, ACNS 2022, Rome, Italy, 20\u201323 June 2022, pp. 684\u2013704. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-09234-3_34","key":"15_CR11","DOI":"10.1007\/978-3-031-09234-3_34"},{"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, Chicago, Illinois, USA, 2\u20134 May 1988, pp. 148\u2013161. ACM (1988). https:\/\/doi.org\/10.1145\/62212.62225","key":"15_CR12","DOI":"10.1145\/62212.62225"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-56188-9_11","volume-title":"Distributed Algorithms","author":"JA Garay","year":"1992","unstructured":"Garay, J.A., Perry, K.J.: A continuum of failure models for distributed computing. In: Segall, A., Zaks, S. (eds.) WDAG 1992. LNCS, vol. 647, pp. 153\u2013165. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-56188-9_11"},{"doi-asserted-by":"publisher","unstructured":"Golan-Gueta, G., et al.: SBFT: a scalable and decentralized trust infrastructure. In: 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2019, Portland, OR, USA, 24\u201327 June 2019, pp. 568\u2013580. IEEE (2019). https:\/\/doi.org\/10.1109\/DSN.2019.00063","key":"15_CR14","DOI":"10.1109\/DSN.2019.00063"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11818175_27","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J Katz","year":"2006","unstructured":"Katz, J., Koo, C.-Y.: On expected constant-round protocols for Byzantine agreement. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 445\u2013462. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11818175_27"},{"issue":"3","key":"15_CR16","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","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","journal-title":"ACM Trans. Program. Lang. Syst."},{"unstructured":"Levin, D., Douceur, J.R., Lorch, J.R., Moscibroda, T.: Trinc: small trusted hardware for large distributed systems. In: Rexford, J., Sirer, E.G. (eds.) Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2009, 22\u201324 April 2009, Boston, MA, USA, pp. 1\u201314. USENIX Association (2009). http:\/\/www.usenix.org\/events\/nsdi09\/tech\/full_papers\/levin\/levin.pdf","key":"15_CR17"},{"doi-asserted-by":"publisher","unstructured":"Lincoln, P., Rushby, J.M.: A formally verified algorithm for interactive consistency under a hybrid fault model. In: Digest of Papers: FTCS-23, The Twenty-Third Annual International Symposium on Fault-Tolerant Computing, Toulouse, France, 22\u201324 June 1993, pp. 402\u2013411. IEEE Computer Society (1993). https:\/\/doi.org\/10.1109\/FTCS.1993.627343","key":"15_CR18","DOI":"10.1109\/FTCS.1993.627343"},{"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\u201326 April 2003, Nice, France, CD-ROM\/Abstracts Proceedings, p. 212. IEEE Computer Society (2003). https:\/\/doi.org\/10.1109\/IPDPS.2003.1213388","key":"15_CR19","DOI":"10.1109\/IPDPS.2003.1213388"},{"issue":"3","key":"15_CR20","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TSE.1986.6312888","volume":"12","author":"KJ Perry","year":"1986","unstructured":"Perry, K.J., Toueg, S.: Distributed agreement in the presence of processor and communication faults. IEEE Trans. Softw. Eng. 12(3), 477\u2013482 (1986). https:\/\/doi.org\/10.1109\/TSE.1986.6312888","journal-title":"IEEE Trans. Softw. Eng."},{"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\u201318 December 2002, Tsukuba-City, Ibarski, Japan, pp. 221\u2013228. IEEE Computer Society (2002). https:\/\/doi.org\/10.1109\/PRDC.2002.1185641","key":"15_CR21","DOI":"10.1109\/PRDC.2002.1185641"},{"doi-asserted-by":"publisher","unstructured":"Serafini, M., Bokor, P., Dobre, D., Majuntke, M., Suri, N.: Scrooge: reducing the costs of fast Byzantine replication in presence of unresponsive replicas. In: Proceedings of the 2010 IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2010, Chicago, IL, USA, 28 June\u20131 July 2010, pp. 353\u2013362. IEEE Computer Society (2010). https:\/\/doi.org\/10.1109\/DSN.2010.5544295","key":"15_CR22","DOI":"10.1109\/DSN.2010.5544295"},{"doi-asserted-by":"publisher","unstructured":"Serafini, M., Suri, N.: The fail-heterogeneous architectural model. In: 26th IEEE Symposium on Reliable Distributed Systems, SRDS 2007, Beijing, China, 10\u201312 October 2007, pp. 103\u2013113. IEEE Computer Society (2007). https:\/\/doi.org\/10.1109\/SRDS.2007.33","key":"15_CR23","DOI":"10.1109\/SRDS.2007.33"},{"issue":"4","key":"15_CR24","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1109\/71.667895","volume":"9","author":"HS Siu","year":"1998","unstructured":"Siu, H.S., Chin, Y.H., Yang, W.P.: Byzantine agreement in the presence of mixed faults on processors and links. IEEE Trans. Parallel Distrib. Syst. 9(4), 335\u2013345 (1998). https:\/\/doi.org\/10.1109\/71.667895","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"doi-asserted-by":"publisher","unstructured":"Thambidurai, P.M., Park, Y.: Interactive consistency with multiple failure modes. In: Proceedings of the Seventh Symposium on Reliable Distributed Systems, SRDS 1988, Columbus, Ohio, USA, 10\u201312 October 1988, pp. 93\u2013100. IEEE Computer Society (1988). https:\/\/doi.org\/10.1109\/RELDIS.1988.25784","key":"15_CR25","DOI":"10.1109\/RELDIS.1988.25784"},{"issue":"1","key":"15_CR26","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TC.2011.221","volume":"62","author":"GS Veronese","year":"2013","unstructured":"Veronese, G.S., Correia, M., Bessani, A.N., Lung, L.C., Ver\u00edssimo, P.: Efficient Byzantine fault-tolerance. IEEE Trans. Comput. 62(1), 16\u201330 (2013). https:\/\/doi.org\/10.1109\/TC.2011.221","journal-title":"IEEE Trans. Comput."},{"doi-asserted-by":"publisher","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Golan-Gueta, G., Abraham, I.: HotStuff: BFT consensus with linearity and responsiveness. In: Robinson, P., Ellen, F. (eds.) Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, PODC 2019, Toronto, ON, Canada, 29 July\u20132 August 2019, pp. 347\u2013356. ACM (2019). https:\/\/doi.org\/10.1145\/3293611.3331591","key":"15_CR27","DOI":"10.1145\/3293611.3331591"},{"key":"15_CR28","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-48624-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:03:08Z","timestamp":1764118988000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48624-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486234","9783031486241"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48624-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 November 2023","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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"168","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":"68","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":"40% - 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","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":"13","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}