{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:10:38Z","timestamp":1755839438290,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031210167"},{"type":"electronic","value":"9783031210174"}],"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-21017-4_20","type":"book-chapter","created":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T18:06:34Z","timestamp":1667930794000},"page":"299-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Consensus on\u00a0Demand"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Sliwinski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yann","family":"Vonlanthen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,9]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/TDSC.2010.70","volume":"8","author":"Y Amir","year":"2011","unstructured":"Amir, Y., Coan, B., Kirsch, J., Lane, J.: Prime: byzantine replication under attack. IEEE Trans. Dependable Secure Comput. 8, 564\u2013577 (2011)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Antoniadis, K., Desjardins, A., Gramoli, V., Guerraoui, R., Zablotchi, I.: Leaderless consensus. In: 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS), pp. 392\u2013402 (2021)","DOI":"10.1109\/ICDCS51616.2021.00045"},{"key":"20_CR3","unstructured":"Auvolat, A., Frey, D., Raynal, M., Ta\u00efani, F.: Money transfer made simple: a specification, a generic algorithm, and its proof. arXiv preprint arXiv:2006.12276 (2020)"},{"key":"20_CR4","unstructured":"Avarikioti, G., Kokoris-Kogias, E., Wattenhofer, R.: Divide and scale: formalization of distributed ledger sharding protocols. arXiv preprint arXiv:1910.10434 (2019)"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Baudet, M., Danezis, G., Sonnino, A.: Fastpay: high-performance byzantine fault tolerant settlement. In: Proceedings of the 2nd ACM Conference on Advances in Financial Technologies, pp. 163\u2013177 (2020)","DOI":"10.1145\/3419614.3423249"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Bazzi, R., Herlihy, M.: Clairvoyant state machine replication. Inf. Comput. 285, 104701 (2021)","DOI":"10.1016\/j.ic.2021.104701"},{"issue":"2","key":"20_CR7","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":"20_CR8","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. JACM 32(4), 824\u2013840 (1985)","journal-title":"JACM"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Burckhardt, S., Gotsman, A., Yang, H., Zawirski, M.: Replicated data types: specification, verification, optimality. In: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 271\u2013284. POPL 2014, Association for Computing Machinery, New York, NY, USA (2014)","DOI":"10.1145\/2535838.2535848"},{"issue":"4","key":"20_CR10","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. (TOCS) 20(4), 398\u2013461 (2002)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"key":"20_CR11","unstructured":"Clement, A., Wong, E., Alvisi, L., Dahlin, M., Marchetti, M.: Making byzantine fault tolerant systems tolerate byzantine faults. In: Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, pp. 153\u2013168. NSDI 2009, USENIX Association, USA (2009)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Collins, D., et al.: Online payments by merely broadcasting messages. In: 2020 50th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 26\u201338. IEEE (2020)","DOI":"10.1109\/DSN48063.2020.00023"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Crain, T., Natoli, C., Gramoli, V.: Red belly: a secure, fair and scalable open blockchain. In: 2021 IEEE Symposium on Security and Privacy (SP), pp. 466\u2013483. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00087"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Danezis, G., Kokoris-Kogias, L., Sonnino, A., Spiegelman, A.: Narwhal and tusk: a DAG-based mempool and efficient BFT consensus. In: Proceedings of the 17th European Conference on Computer Systems, pp. 34\u201350 (2022)","DOI":"10.1145\/3492321.3519594"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Duan, S., Reiter, M.K., Zhang, H.: Beat: asynchronous BFT made practical. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 2028\u20132041. CCS 2018 (2018)","DOI":"10.1145\/3243734.3243812"},{"key":"20_CR16","unstructured":"Foundation, E.: Ethereum wire protocol (eth) (2021). https:\/\/github.com\/ethereum\/devp2p\/blob\/master\/caps\/eth.md"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: scaling byzantine agreements for cryptocurrencies. In: Proceedings of the 26th symposium on operating systems principles, pp. 51\u201368 (2017)","DOI":"10.1145\/3132747.3132757"},{"key":"20_CR18","unstructured":"Guerraoui, R., Kuznetsov, P., Monti, M., Pavlovic, M., Seredinschi, D.A., Vonlanthen, Y.: Scalable byzantine reliable broadcast (extended version). arXiv preprint arXiv:1908.01738 (2019)"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Guerraoui, R., Kuznetsov, P., Monti, M., Pavlovi\u010d, M., Seredinschi, D.A.: The consensus number of a cryptocurrency. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing - PODC 2019 (2019)","DOI":"10.1145\/3293611.3331589"},{"key":"20_CR20","unstructured":"Gupta, S.: A non-consensus based decentralized financial transaction processing model with support for efficient auditing. Arizona State University (2016)"},{"issue":"1","key":"20_CR21","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1145\/114005.102808","volume":"13","author":"M Herlihy","year":"1991","unstructured":"Herlihy, M.: Wait-free synchronization. ACM Trans. Program. Lang. Syst. (TOPLAS) 13(1), 124\u2013149 (1991)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-63688-7_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"A Kiayias","year":"2017","unstructured":"Kiayias, A., Russell, A., David, B., Oliynykov, R.: Ouroboros: a provably secure proof-of-stake blockchain protocol. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 357\u2013388. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_12"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Kursawe, K.: Optimistic byzantine agreement. In: 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings, pp. 262\u2013267. IEEE (2002)","DOI":"10.1109\/RELDIS.2002.1180196"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Kuznetsov, P., Tonkikh, A., Zhang, Y.X.: Revisiting optimal resilience of fast byzantine consensus. In: Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pp. 343\u2013353 (2021)","DOI":"10.1145\/3465084.3467924"},{"key":"20_CR25","unstructured":"Lamport, L.: Generalized consensus and paxos (2005)"},{"issue":"2","key":"20_CR26","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s00446-006-0155-x","volume":"19","author":"L Lamport","year":"2006","unstructured":"Lamport, L.: Lower bounds for asynchronous consensus. Distrib. Comput. 19(2), 104\u2013125 (2006)","journal-title":"Distrib. Comput."},{"issue":"2","key":"20_CR27","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.: A high-throughput secure reliable multicast protocol. J. Comput. Secur. 5(2), 113\u2013127 (1997)","journal-title":"J. Comput. Secur."},{"issue":"3","key":"20_CR28","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TDSC.2006.35","volume":"3","author":"JP Martin","year":"2006","unstructured":"Martin, J.P., Alvisi, L.: Fast byzantine consensus. IEEE Trans. Dependable Secure Comput. 3(3), 202\u2013215 (2006)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Mathys, M., Schmid, R., Sliwinski, J., Wattenhofer, R.: A limitlessly scalable transaction system. In: 6th International Workshop on Cryptocurrencies and Blockchain Technology (CBT), Copenhagen, Denmark (2022)","DOI":"10.1007\/978-3-031-25734-6_18"},{"key":"20_CR30","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2009). http:\/\/www.bitcoin.org\/bitcoin.pdf"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Nasirifard, P., Mayer, R., Jacobsen, H.A.: Fabriccrdt: a conflict-free replicated datatypes approach to permissioned blockchains. In: Proceedings of the 20th International Middleware Conference, pp. 110\u2013122. Middleware 2019 (2019)","DOI":"10.1145\/3361525.3361540"},{"key":"20_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-48169-9_7","volume-title":"Distributed Computing","author":"F Pedone","year":"1999","unstructured":"Pedone, F., Schiper, A.: Generic broadcast. In: Jayanti, P. (ed.) DISC 1999. LNCS, vol. 1693, pp. 94\u2013106. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48169-9_7"},{"issue":"9","key":"20_CR33","doi-asserted-by":"publisher","first-page":"141","DOI":"10.3390\/a11090141","volume":"11","author":"M Pires","year":"2018","unstructured":"Pires, M., Ravi, S., Rodrigues, R.: Generalized paxos made byzantine (and less complex). Algorithms 11(9), 141 (2018)","journal-title":"Algorithms"},{"key":"20_CR34","doi-asserted-by":"crossref","unstructured":"Pregui\u00e7a, N.: Conflict-free replicated data types: an overview. arXiv preprint arXiv:1806.10254 (2018)","DOI":"10.1007\/978-3-319-63962-8_185-1"},{"key":"20_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-642-25873-2_23","volume-title":"Principles of Distributed Systems","author":"P Raykov","year":"2011","unstructured":"Raykov, P., Schiper, N., Pedone, F.: Byzantine fault-tolerance with commutative commands. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol. 7109, pp. 329\u2013342. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25873-2_23"},{"key":"20_CR36","doi-asserted-by":"crossref","unstructured":"Sliwinski, J., Vonlanthen, Y., Wattenhofer, R.: Consensus on demand. arXiv preprint arXiv:2202.03756 (2022)","DOI":"10.1007\/978-3-031-21017-4_20"},{"key":"20_CR37","doi-asserted-by":"crossref","unstructured":"Sliwinski, J., Wattenhofer, R.: Asynchronous proof-of-stake. In: 23rd International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (2021)","DOI":"10.1007\/978-3-030-91081-5_13"},{"key":"20_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-87779-0_30","volume-title":"Distributed Computing","author":"YJ Song","year":"2008","unstructured":"Song, Y.J., van Renesse, R.: Bosco: one-step byzantine asynchronous consensus. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 438\u2013450. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87779-0_30"},{"issue":"2","key":"20_CR39","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BF01667080","volume":"2","author":"TK Srikanth","year":"1987","unstructured":"Srikanth, T.K., Toueg, S.: Simulating authenticated broadcasts to derive simple fault-tolerant algorithms. Distrib. Comput. 2(2), 80\u201394 (1987)","journal-title":"Distrib. Comput."},{"key":"20_CR40","unstructured":"Suri-Payer, F., Burke, M., Wang, Z., Zhang, Y., Alvisi, L., Crooks, N.: Basil: breaking up BFT with acid (transactions). In: Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles, pp. 1\u201317 (2021)"},{"key":"20_CR41","unstructured":"Vonlanthen, Y.: Cascadeth (2021). https:\/\/github.com\/yannvon\/cascadeth"},{"key":"20_CR42","unstructured":"Vonlanthen, Y.: Multishot (2021). https:\/\/github.com\/yannvon\/aposteriori"},{"key":"20_CR43","doi-asserted-by":"crossref","unstructured":"Yin, M., Malkhi, D., Reiter, M.K., Gueta, G.G., Abraham, I.: Hotstuff: BFT consensus with linearity and responsiveness. In: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pp. 347\u2013356 (2019)","DOI":"10.1145\/3293611.3331591"}],"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-031-21017-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T18:40:55Z","timestamp":1728326455000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21017-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031210167","9783031210174"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21017-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 November 2022","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":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sss2022.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}