{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T14:59:48Z","timestamp":1780930788885,"version":"3.54.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031174353","type":"print"},{"value":"9783031174360","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-17436-0_7","type":"book-chapter","created":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T14:19:41Z","timestamp":1664288381000},"page":"87-103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Solvability of\u00a0Byzantine Fault-Tolerant Causal Ordering Problems"],"prefix":"10.1007","author":[{"given":"Anshuman","family":"Misra","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2451-7306","authenticated-orcid":false,"given":"Ajay D.","family":"Kshemkalyani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,28]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2021.06.021","volume":"885","author":"A Auvolat","year":"2021","unstructured":"Auvolat, A., Frey, D., Raynal, M., Ta\u00efani, F.: Byzantine-tolerant causal broadcast. Theoret. Comput. Sci. 885, 55\u201368 (2021)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/7351.7478","volume":"5","author":"KP Birman","year":"1987","unstructured":"Birman, K.P., Joseph, T.A.: Reliable communication in the presence of failures. ACM Trans. Comput. Syst. (TOCS) 5(1), 47\u201376 (1987)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","volume":"75","author":"G Bracha","year":"1987","unstructured":"Bracha, G.: Asynchronous byzantine agreement protocols. Inf. Comput. 75(2), 130\u2013143 (1987). https:\/\/doi.org\/10.1016\/0890-5401(87)90054-X","journal-title":"Inf. Comput."},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/4221.214134","volume":"32","author":"G Bracha","year":"1985","unstructured":"Bracha, G., Toueg, S.: Asynchronous consensus and broadcast protocols. J. ACM 32(4), 824\u2013840 (1985). https:\/\/doi.org\/10.1145\/4221.214134","journal-title":"J. ACM"},{"key":"7_CR5","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), pp. 173\u2013186 (1999)"},{"issue":"1","key":"7_CR6","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/TPDS.2004.1264784","volume":"15","author":"P Chandra","year":"2004","unstructured":"Chandra, P., Gambhire, P., Kshemkalyani, A.D.: Performance of the optimal causal multicast algorithm: a statistical analysis. IEEE Trans. Parallel Distrib. Syst. 15(1), 40\u201352 (2004). https:\/\/doi.org\/10.1109\/TPDS.2004.1264784","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Chandra, P., Kshemkalyani, A.D.: Causal multicast in mobile networks. In: 12th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), pp. 213\u2013220 (2004). https:\/\/doi.org\/10.1109\/MASCOT.2004.1348235","DOI":"10.1109\/MASCOT.2004.1348235"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Collins, D., et al.: Online payments by merely broadcasting messages. In: 50th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2020, pp. 26\u201338 (2020)","DOI":"10.1109\/DSN48063.2020.00023"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge (1995). https:\/\/doi.org\/10.7551\/mitpress\/5803.001.0001","DOI":"10.7551\/mitpress\/5803.001.0001"},{"key":"7_CR10","unstructured":"Hadzilacos, V., Toueg, S.: A modular approach to fault-tolerant broadcasts and related problems. Technical report, 94-1425, Cornell University, p. 83 pages (1994)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Huang, K., Wei, H., Huang, Y., Li, H., Pan, A.: Byz-GentleRain: an efficient byzantine-tolerant causal consistency protocol. arXiv preprint arXiv:2109.14189 (2021)","DOI":"10.1007\/978-3-030-91081-5_36"},{"key":"7_CR12","unstructured":"Kleppmann, M., Howard, H.: Byzantine eventual consistency and the fundamental limits of peer-to-peer databases. arXiv preprint arXiv:2012.00472 (2020)"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Kshemkalyani, A.D., Singhal, M.: An optimal algorithm for generalized causal message ordering (abstract). In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, p. 87. ACM (1996). https:\/\/doi.org\/10.1145\/248052.248064","DOI":"10.1145\/248052.248064"},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s004460050044","volume":"11","author":"AD Kshemkalyani","year":"1998","unstructured":"Kshemkalyani, A.D., Singhal, M.: Necessary and sufficient conditions on information for causal message ordering and their optimal implementation. Distrib. Comput. 11(2), 91\u2013111 (1998). https:\/\/doi.org\/10.1007\/s004460050044","journal-title":"Distrib. Comput."},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Kshemkalyani, A.D., Singhal, M.: Distributed Computing: Principles, Algorithms, and Systems. Cambridge University Press, Cambridge (2011). https:\/\/doi.org\/10.1017\/CBO9780511805318","DOI":"10.1017\/CBO9780511805318"},{"issue":"7","key":"7_CR16","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Liskov, B., Ladin, R.: Highly available distributed services and fault-tolerant distributed garbage collection. In: Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, pp. 29\u201339 (1986)","DOI":"10.21236\/ADA229264"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Malkhi, D., Merritt, M., Rodeh, O.: Secure reliable multicast protocols in a WAN. In: Proceedings of the 17th International Conference on Distributed Computing Systems, pp. 87\u201394 (1997). https:\/\/doi.org\/10.1109\/ICDCS.1997.597857","DOI":"10.1109\/ICDCS.1997.597857"},{"issue":"2","key":"7_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.3233\/JCS-1997-5203","volume":"5","author":"D Malkhi","year":"1997","unstructured":"Malkhi, D., Reiter, M.K.: A high-throughput secure reliable multicast protocol. J. Comput. Secur. 5(2), 113\u2013128 (1997). https:\/\/doi.org\/10.3233\/JCS-1997-5203","journal-title":"J. Comput. Secur."},{"key":"7_CR20","unstructured":"Misra, A., Kshemkalyani, A.D.: Byzantine fault tolerant causal ordering. CoRR abs\/2112.11337 (2021). https:\/\/arxiv.org\/abs\/2112.11337"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"105837","DOI":"10.1016\/j.ipl.2019.105837","volume":"151","author":"A Mostefaoui","year":"2019","unstructured":"Mostefaoui, A., Perrin, M., Raynal, M., Cao, J.: Crash-tolerant causal broadcast in o (n) messages. Inf. Process. Lett. 151, 105837 (2019)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"7_CR22","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1006\/jpdc.1996.1300","volume":"41","author":"R Prakash","year":"1997","unstructured":"Prakash, R., Raynal, M., Singhal, M.: An adaptive causal ordering algorithm suited to mobile computing environments. J. Parallel Distrib. Comput. 41(2), 190\u2013204 (1997)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"6","key":"7_CR23","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0020-0190(91)90008-6","volume":"39","author":"M Raynal","year":"1991","unstructured":"Raynal, M., Schiper, A., Toueg, S.: The causal ordering abstraction and a simple way to implement it. Inf. Process. Lett. 39(6), 343\u2013350 (1991)","journal-title":"Inf. Process. Lett."},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-51687-5_45","volume-title":"Distributed Algorithms","author":"A Schiper","year":"1989","unstructured":"Schiper, A., Eggli, J., Sandoz, A.: A new algorithm to implement causal ordering. In: Bermond, J.-C., Raynal, M. (eds.) WDAG 1989. LNCS, vol. 392, pp. 219\u2013232. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/3-540-51687-5_45"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Tseng, L., Wang, Z., Zhao, Y., Pan, H.: Distributed causal memory in the presence of byzantine servers. In: 2019 IEEE 18th International Symposium on Network Computing and Applications (NCA), pp. 1\u20138 (2019)","DOI":"10.1109\/NCA.2019.8935059"}],"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-17436-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T14:21:33Z","timestamp":1664288493000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17436-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031174353","9783031174360"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17436-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"28 September 2022","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2022","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":"100","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":"18","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":"2","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":"18% - 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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}