{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:47:00Z","timestamp":1743137220926,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031377648"},{"type":"electronic","value":"9783031377655"}],"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-37765-5_9","type":"book-chapter","created":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T19:01:53Z","timestamp":1688670113000},"page":"105-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Consensus on\u00a0an\u00a0Unknown Torus with\u00a0Dense Byzantine Faults"],"prefix":"10.1007","author":[{"given":"Joseph","family":"Oglio","sequence":"first","affiliation":[]},{"given":"Kendric","family":"Hood","sequence":"additional","affiliation":[]},{"given":"Gokarna","family":"Sharma","sequence":"additional","affiliation":[]},{"given":"Mikhail","family":"Nesterenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"9_CR1","unstructured":"Abraham, I., Devadas, S., Nayak, K., Ren, L.: Brief announcement: practical synchronous byzantine consensus. In: 31st International Symposium on Distributed Computing (DISC 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-540-92221-6_4","volume-title":"Principles of Distributed Systems","author":"EAP Alchieri","year":"2008","unstructured":"Alchieri, E.A.P., Bessani, A.N., da Silva Fraga, J., Greve, F.: Byzantine consensus with unknown participants. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 22\u201340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92221-6_4"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-540-92221-6_4","volume-title":"Principles of Distributed Systems","author":"EAP Alchieri","year":"2008","unstructured":"Alchieri, E.A.P., Bessani, A.N., da Silva Fraga, J., Greve, F.: Byzantine consensus with unknown participants. In: Baker, T.P., Bui, A., Tixeuil, S. (eds.) OPODIS 2008. LNCS, vol. 5401, pp. 22\u201340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-92221-6_4"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice (extended abstract) completely asynchronous agreement protocols. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, pp. 27\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bhandari, V., Vaidya, N.H.: On reliable broadcast in a radio network. In: Proceedings of the Twenty-fourth Annual ACM Symposium on Principles of Distributed Computing, pp. 138\u2013147 (2005)","DOI":"10.1145\/1073814.1073841"},{"key":"9_CR6","unstructured":"Chandy, K., Misra, J.: Parallel program design: a foundation. Addison Wesley Publishing Co., (1988)"},{"key":"9_CR7","unstructured":"Chlebus, B.S., Kowalski, D.R., Olkowski, J.: Fast agreement in networks with byzantine nodes. In: 34th International Symposium on Distributed Computing (DISC 2020) (2020)"},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D Dolev","year":"1982","unstructured":"Dolev, D.: The byzantine generals strike again. J. Algorithms 3(1), 14\u201330 (1982)","journal-title":"J. Algorithms"},{"issue":"4","key":"9_CR9","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)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9_CR10","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P Feldman","year":"1997","unstructured":"Feldman, P., Micali, S.: An optimal probabilistic protocol for synchronous byzantine agreement. SIAM J. Comput. 26(4), 873\u2013933 (1997)","journal-title":"SIAM J. Comput."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BF01843568","volume":"1","author":"MJ Fischer","year":"1986","unstructured":"Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. Distrib. Comput. 1, 26\u201339 (1986)","journal-title":"Distrib. Comput."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Ganesan, P., Yang, B., Garcia-Molina, H.: One torus to rule them all: multi-dimensional queries in P2P systems. In: Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD\/PODS 2004, pp. 19\u201324 (2004)","DOI":"10.1145\/1017074.1017081"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/118544.119233","volume":"9","author":"DD Kandlur","year":"1991","unstructured":"Kandlur, D.D., Shin, K.G.: Reliable broadcast algorithms for harts. ACM Trans. Comput. Syst. (TOCS) 9(4), 374\u2013398 (1991)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jcss.2008.08.001","volume":"75","author":"J Katz","year":"2009","unstructured":"Katz, J., Koo, C.-Y.: On expected constant-round protocols for byzantine agreement. J. Comput. Syst. Sci. 75(2), 91\u2013112 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Koo, C.-Y.: Broadcast in radio networks tolerating byzantine adversarial behavior. In: Proceedings of the Twenty-third Annual ACM Symposium on Principles of Distributed Computing, pp. 275\u2013282 (2004)","DOI":"10.1145\/1011767.1011807"},{"issue":"3","key":"9_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., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"11","key":"9_CR17","doi-asserted-by":"publisher","first-page":"3153","DOI":"10.1016\/j.jpdc.2014.07.010","volume":"74","author":"A Maurer","year":"2014","unstructured":"Maurer, A., Tixeuil, S.: Byzantine broadcast with fixed disjoint paths. J. Parallel Distrib. Comput. 74(11), 3153\u20133160 (2014)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Nesterenko, M., Tixeuil, S.: Discovering network topology in the presence of byzantine faults. In: International Colloquium on Structural Information and Communication Complexity, pages 212\u2013226. Springer, Berlin, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11780823_17","DOI":"10.1007\/11780823_17"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-030-91014-3_2","volume-title":"Networked Systems","author":"J Oglio","year":"2021","unstructured":"Oglio, J., Hood, K., Sharma, G., Nesterenko, M.: Byzantine Geoconsensus. In: Echihabi, K., Meyer, R. (eds.) NETYS 2021. LNCS, vol. 12754, pp. 19\u201335. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91014-3_2"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Oglio, J., Hood, K., Sharma, G., Nesterenko, M.: Consensus on unknown torus with dense byzantine faults. arXiv preprint arXiv:2303.12870 (2023)","DOI":"10.1007\/978-3-031-37765-5_9"},{"issue":"2","key":"9_CR21","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM (JACM) 27(2), 228\u2013234 (1980)","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ipl.2004.10.007","volume":"93","author":"A Pelc","year":"2005","unstructured":"Pelc, A., Peleg, D.: Broadcasting with locally bounded byzantine faults. Inf. Process. Lett. 93(3), 109\u2013115 (2005)","journal-title":"Inf. Process. Lett."},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed computing: a locality-sensitive approach. SIAM (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized byzantine generals. In: 24th Annual Symposium on Foundations of Computer Science (SFCS 1983), pp. 403\u2013409. IEEE (1983)","DOI":"10.1109\/SFCS.1983.48"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Tseng, L., Vaidya, N.H.: Fault-tolerant consensus in directed graphs. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pp. 451\u2013460 (2015)","DOI":"10.1145\/2767386.2767399"},{"issue":"5","key":"9_CR26","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s00446-019-00348-0","volume":"32","author":"K Winkler","year":"2019","unstructured":"Winkler, K., Schwarz, M., Schmid, U.: Consensus in rooted dynamic networks with short-lived stability. Distrib. Comput. 32(5), 443\u2013458 (2019). https:\/\/doi.org\/10.1007\/s00446-019-00348-0","journal-title":"Distrib. Comput."}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37765-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,16]],"date-time":"2023-12-16T15:27:19Z","timestamp":1702740439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37765-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031377648","9783031377655"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37765-5_9","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":"7 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Benguerir","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","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":"22 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","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":"9","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":"3","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":"29% - 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.6","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":"3.2","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)"}}]}}