{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:17:34Z","timestamp":1763414254844,"version":"3.45.0"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032111265","type":"print"},{"value":"9783032111272","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-11127-2_29","type":"book-chapter","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:40Z","timestamp":1763409820000},"page":"376-391","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deterministic Causal Order Under Byzantine Sybil Tolerance: Techniques and\u00a0Limitations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2451-7306","authenticated-orcid":false,"given":"Ajay D.","family":"Kshemkalyani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3987-7945","authenticated-orcid":false,"given":"Anshuman","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,18]]},"reference":[{"key":"29_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":"29_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 Transactions on Computer Systems 5(1), 47\u201376 (1987)","journal-title":"ACM Transactions on Computer Systems"},{"issue":"2","key":"29_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)","journal-title":"Inf. Comput."},{"issue":"4","key":"29_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":"29_CR5","doi-asserted-by":"crossref","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. IACR Cryptol. ePrint Arch., p.\u00a06 (2001). http:\/\/eprint.iacr.org\/2001\/006","DOI":"10.1007\/3-540-44647-8_31"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Chandra, P., Gambhire, P., Kshemkalyani, A.D.: Performance of the optimal causal multicast algorithm: a statistical analysis. IEEE Trans. Parallel Distributed Syst. 15(1), 40\u201352 (2004). https:\/\/doi.org\/10.1109\/TPDS.2004.1264784","DOI":"10.1109\/TPDS.2004.1264784"},{"key":"29_CR7","doi-asserted-by":"crossref","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":"29_CR8","doi-asserted-by":"crossref","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","DOI":"10.1137\/0212045"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-45748-8_24","volume-title":"Peer-to-Peer Systems","author":"JR Douceur","year":"2002","unstructured":"Douceur, J.R.: The sybil attack. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 251\u2013260. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45748-8_24"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Duan, S., Reiter, M.K., Zhang, H.: Secure causal atomic broadcast, revisited. In: 2017 47th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 61\u201372. IEEE (2017)","DOI":"10.1109\/DSN.2017.64"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Dwork, C., Lynch, N.A., Stockmeyer, L.J.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988). http:\/\/doi.acm.org\/10.1145\/42282.42283","DOI":"10.1145\/42282.42283"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Jacob, F., Beer, C., Henze, N., Hartenstein, H.: Analysis of the matrix event graph replicated data type. IEEE Access 9, 28317\u201328333 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3058576","DOI":"10.1109\/ACCESS.2021.3058576"},{"key":"29_CR13","unstructured":"Kleppmann, M., Howard, H.: Byzantine eventual consistency and the fundamental limits of peer-to-peer databases. arXiv preprint arXiv:2012.00472 (2020)"},{"key":"29_CR14","doi-asserted-by":"crossref","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 (PODC), p.\u00a087. ACM (1996). https:\/\/doi.org\/10.1145\/248052.248064","DOI":"10.1145\/248052.248064"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Kshemkalyani, A.D., Singhal, M.: Necessary and sufficient conditions on information for causal message ordering and their optimal implementation. Distributed Comput. 11(2), 91\u2013111 (1998). https:\/\/doi.org\/10.1007\/s004460050044","DOI":"10.1007\/s004460050044"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Kshemkalyani, A.D., Singhal, M.: Distributed Computing: Principles, Algorithms, and Systems. Cambridge University Press (2011). https:\/\/doi.org\/10.1017\/CBO9780511805318","DOI":"10.1017\/CBO9780511805318"},{"issue":"7","key":"29_CR17","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":"29_CR18","doi-asserted-by":"crossref","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982). http:\/\/doi.acm.org\/10.1145\/357172.357176","DOI":"10.1145\/357172.357176"},{"key":"29_CR19","doi-asserted-by":"crossref","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)","DOI":"10.1109\/ICDCS.1997.597857"},{"issue":"2","key":"29_CR20","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)","journal-title":"J. Comput. Secur."},{"key":"29_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-60042-6_14","volume-title":"Theory and Practice in Distributed Systems","author":"F Mattern","year":"1995","unstructured":"Mattern, F., F\u00fcnfrocken, S.: A non-blocking lightweight implementation of causal order message delivery. In: Birman, K.P., Mattern, F., Schiper, A. (eds.) Theory and Practice in Distributed Systems. LNCS, vol. 938, pp. 197\u2013213. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60042-6_14"},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Misra, A., Kshemkalyani, A.D.: Causal ordering in the presence of byzantine processes. In: 28th IEEE International Conference on Parallel and Distributed Systems, pp. 130\u2013138. IEEE (2022). https:\/\/doi.org\/10.1109\/ICPADS56603.2022.00025","DOI":"10.1109\/ICPADS56603.2022.00025"},{"key":"29_CR23","doi-asserted-by":"crossref","unstructured":"Misra, A., Kshemkalyani, A.D.: Solvability of byzantine fault-tolerant causal ordering problems. In: Koulali, M., Mezini, M. (eds.) 10th International Conference on Networked Systems. LNCS, vol. 13464, pp. 87\u2013103. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-17436-0_7","DOI":"10.1007\/978-3-031-17436-0_7"},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"Misra, A., Kshemkalyani, A.D.: Byzantine fault-tolerant causal order satisfying strong safety. In: Proceedings of the 25th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp. 111\u2013125 (2023). https:\/\/doi.org\/10.1007\/978-3-031-44274-2_10","DOI":"10.1007\/978-3-031-44274-2_10"},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"Misra, A., Kshemkalyani, A.D.: Byzantine fault-tolerant causal ordering. In: 24th International Conference on Distributed Computing and Networking, pp. 100\u2013109. ACM (2023). https:\/\/doi.org\/10.1145\/3571306.3571395","DOI":"10.1145\/3571306.3571395"},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"Misra, A., Kshemkalyani, A.D.: Byzantine-tolerant causal ordering for unicasts, multicasts, and broadcasts. IEEE Trans. Parallel Distributed Syst. 35(5), 814\u2013828 (2024). https:\/\/doi.org\/10.1109\/TPDS.2024.3368280","DOI":"10.1109\/TPDS.2024.3368280"},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Misra, A., Kshemkalyani, A.D.: Detecting causality in the presence of byzantine processes: the case of synchronous systems. Inf. Comput. 301, 105212 (2024). https:\/\/doi.org\/10.1016\/j.ic.2024.105212","DOI":"10.1016\/j.ic.2024.105212"},{"key":"29_CR28","doi-asserted-by":"crossref","unstructured":"Misra, A., Kshemkalyani, A.D.: Solvabiity of byzantine fault-tolerant causal ordering: synchronous systems case. In: Proceedings of the 39th ACM Symposium on Applied Computing (SAC), pp. 251\u2013256 (2024). https:\/\/doi.org\/10.1145\/3605098.3636063","DOI":"10.1145\/3605098.3636063"},{"key":"29_CR29","doi-asserted-by":"crossref","unstructured":"Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980). http:\/\/doi.acm.org\/10.1145\/322186.322188","DOI":"10.1145\/322186.322188"},{"issue":"6","key":"29_CR30","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."}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11127-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:45Z","timestamp":1763409825000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11127-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,18]]},"ISBN":["9783032111265","9783032111272"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11127-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,18]]},"assertion":[{"value":"18 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kathmandu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nepal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}