{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T13:50:52Z","timestamp":1774965052624,"version":"3.50.1"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030568764","type":"print"},{"value":"9783030568771","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-56877-1_16","type":"book-chapter","created":{"date-parts":[[2020,8,11]],"date-time":"2020-08-11T17:17:58Z","timestamp":1597166278000},"page":"451-480","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":120,"title":["Order-Fairness for Byzantine Consensus"],"prefix":"10.1007","author":[{"given":"Mahimna","family":"Kelkar","sequence":"first","affiliation":[]},{"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Steven","family":"Goldfeder","sequence":"additional","affiliation":[]},{"given":"Ari","family":"Juels","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,10]]},"reference":[{"key":"16_CR1","unstructured":"Abraham, I., et al.: Solida: a blockchain protocol based on reconfigurable byzantine consensus. In: OPODIS, pp. 25:1\u201325:19 (2017)"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Abraham, I., et al.: Sync HotStuff: simple and practical synchronous state machine replication. Cryptology ePrint Archive, Report 2019\/270 (2019)","DOI":"10.1109\/SP40000.2020.00044"},{"issue":"4","key":"16_CR3","first-page":"564","volume":"8","author":"Y Amir","year":"2011","unstructured":"Amir, Y., et al.: Prime: byzantine replication under attack. IEEE TDSC 8(4), 564\u2013577 (2011)","journal-title":"IEEE TDSC"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Asayag, A., et al.: A fair consensus protocol for transaction ordering. In: ICNP, pp. 55\u201365 (2018)","DOI":"10.1109\/ICNP.2018.00016"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Aublin, P.-L., Mokhtar, S.B., Qu\u00e9ma, V.: RBFT: redundant byzantine fault tolerance. In: ICDCS, pp. 297\u2013306 (2013)","DOI":"10.1109\/ICDCS.2013.53"},{"key":"16_CR6","unstructured":"Baird, L.: The Swirlds Hashgraph Consensus Algorithm: Fair, Fast, Byzantine Fault Tolerance (2016). https:\/\/www.swirlds.com\/downloads\/SWIRLDS-TR-2016-01.pdf"},{"key":"16_CR7","unstructured":"Bano, S., et al.: Consensus in the age of blockchains. arXiv:1711.03936 (2017)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Bessani, A., Sousa, J., Alchieri, E.E.P.: State machine replication for the masses with BFT-SMART. In: DSN, pp. 355\u2013362 (2014)","DOI":"10.1109\/DSN.2014.43"},{"issue":"4","key":"16_CR9","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)","journal-title":"J. ACM"},{"key":"16_CR10","unstructured":"Cachin, C., Vukoli\u0107, M.: Blockchain consensus protocols in the wild. arXiv:1707.01873 (2017)"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/3-540-44647-8_31","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"C Cachin","year":"2001","unstructured":"Cachin, C., Kursawe, K., Petzold, F., Shoup, V.: Secure and efficient asynchronous broadcast protocols. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 524\u2013541. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_31"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013147 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-45146-4_16","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"R Canetti","year":"2003","unstructured":"Canetti, R., Rabin, T.: Universal composition with joint state. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 265\u2013281. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_16"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-540-70936-7_4","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2007","unstructured":"Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally composable security with global setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 61\u201385. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_4"},{"key":"16_CR15","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: OSDI, pp. 173\u2013186 (1999)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1007\/978-3-030-17653-2_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"T-H Hubert Chan","year":"2019","unstructured":"Hubert Chan, T.-H., Pass, R., Shi, E.: Consensus through herding. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 720\u2013749. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_24"},{"key":"16_CR17","unstructured":"Clement, A., et al.: Making byzantine fault tolerant systems tolerate byzantine faults. In: NDSI, pp. 153\u2013168 (2009)"},{"key":"16_CR18","unstructured":"Condorcet Paradox. https:\/\/wikipedia.org\/wiki\/Condorcet_paradox"},{"issue":"1","key":"16_CR19","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1006\/inco.1995.1060","volume":"118","author":"F Cristian","year":"1995","unstructured":"Cristian, F., et al.: Atomic broadcast: from simple message diffusion to byzantine agreement. Inf. Comput. 118(1), 158\u2013179 (1995)","journal-title":"Inf. Comput."},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Daian, P., et al.: Flash boys 2.0: frontrunning in decentralized exchanges, miner extractable value, and consensus instability. In: IEEE S&P, pp. 585\u2013602 (2020)","DOI":"10.1109\/SP40000.2020.00040"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Raymond Strong, H.: Authenticated algorithms for byzantine agreement. SIAM J. Comput. 12, 656\u2013666 (1983)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"16_CR22","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"key":"16_CR23","unstructured":"Ethereum. https:\/\/ethereum.org\/"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-662-45472-5_28","volume-title":"Financial Cryptography and Data Security","author":"I Eyal","year":"2014","unstructured":"Eyal, I., Sirer, E.G.: Majority is not enough: bitcoin mining is vulnerable. In: Christin, N., Safavi-Naini, R. (eds.) FC 2014. LNCS, vol. 8437, pp. 436\u2013454. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45472-5_28"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Gilad, Y., et al.: Algorand: scaling byzantine agreements for cryptocurrencies. In: SOSP, pp. 51\u201368 (2017)","DOI":"10.1145\/3132747.3132757"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-540-77096-1_17","volume-title":"Principles of Distributed Systems","author":"C Ho","year":"2007","unstructured":"Ho, C., Dolev, D., van Renesse, R.: Making distributed applications robust. In: Tovar, E., Tsigas, P., Fouchal, H. (eds.) OPODIS 2007. LNCS, vol. 4878, pp. 232\u2013246. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77096-1_17"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Kelkar, M., et al.: Order-fairness for byzantine consensus. Cryptology ePrint Archive, Report 2020\/269 (2020)","DOI":"10.1007\/978-3-030-56877-1_16"},{"key":"16_CR28","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":"16_CR29","doi-asserted-by":"crossref","unstructured":"Kokoris-Kogias, E., et al.: OmniLedger: a secure, scale-out, decentralized ledger via sharding. In: IEEE S&P, pp. 583\u2013598 (2018)","DOI":"10.1109\/SP.2018.000-5"},{"issue":"3","key":"16_CR30","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. TOPLAS 4(3), 382\u2013401 (1982)","journal-title":"TOPLAS"},{"key":"16_CR31","unstructured":"Lev-Ari, K., et al.: FairLedger: a fair blockchain protocol for financial institutions. In: OPODIS, pp. 1:1\u20131:16 (2019)"},{"key":"16_CR32","volume-title":"Flash Boys: A Wall Street Revolt","author":"M Lewis","year":"2014","unstructured":"Lewis, M.: Flash Boys: A Wall Street Revolt. WW Norton & Company, New York (2014)"},{"key":"16_CR33","unstructured":"Luu, L., et al.: SmartPool: practical decentralized pooled mining. In: USENIX Security, pp. 1409\u20131426 (2017)"},{"issue":"3","key":"16_CR34","first-page":"202","volume":"3","author":"J-P Martin","year":"2006","unstructured":"Martin, J.-P., Alvisi, L.: Fast byzantine consensus. IEEE TDSC 3(3), 202\u2013215 (2006)","journal-title":"IEEE TDSC"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Miller, A., et al.: Non-outsourceable scratch-off puzzles to discourage bitcoin mining coalitions. In: ACM CCS, pp. 680\u2013691 (2015)","DOI":"10.1145\/2810103.2813621"},{"key":"16_CR36","doi-asserted-by":"crossref","unstructured":"Miller, A., et al.: The honey badger of BFT protocols. In: ACM CCS, pp. 31\u201342 (2016)","DOI":"10.1145\/2976749.2978399"},{"key":"16_CR37","doi-asserted-by":"crossref","unstructured":"Pass, R., Shi, E.: FruitChains: a fair blockchain. In: PODC, pp. 315\u2013324 (2017)","DOI":"10.1145\/3087801.3087809"},{"key":"16_CR38","unstructured":"Pass, R., Shi, E.: Hybrid consensus: efficient consensus in the permissionless model. In: DISC, pp. 1\u201316 (2017)"},{"key":"16_CR39","doi-asserted-by":"crossref","unstructured":"Pass, R., Shi, E.: Rethinking large-scale consensus. In: CSF, pp. 15\u2013129 (2017)","DOI":"10.1109\/CSF.2017.37"},{"key":"16_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-78375-8_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"R Pass","year":"2018","unstructured":"Pass, R., Shi, E.: Thunderella: blockchains with optimistic instant confirmation. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 3\u201333. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_1"},{"key":"16_CR41","unstructured":"Rocket, T., et al.: Scalable and probabilistic leaderless BFT consensus through metastability. arXiv:1906.08936 (2019)"},{"issue":"1","key":"16_CR42","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TC.2011.221","volume":"62","author":"GS Veronese","year":"2013","unstructured":"Veronese, G.S., et al.: Efficient byzantine fault-tolerance. IEEE Trans. Comput. 62(1), 16\u201330 (2013)","journal-title":"IEEE Trans. Comput."},{"key":"16_CR43","doi-asserted-by":"crossref","unstructured":"Veronese, G.S., et al.: Spin one\u2019s wheels? Byzantine fault tolerance with a spinning primary. In: SRDS, pp. 135\u2013144 (2009)","DOI":"10.1109\/SRDS.2009.36"},{"key":"16_CR44","doi-asserted-by":"crossref","unstructured":"Yin, M., et al.: HotStuff: BFT consensus with linearity and responsiveness. In: PODC, pp. 347\u2013356 (2019)","DOI":"10.1145\/3293611.3331591"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-56877-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T00:07:40Z","timestamp":1691712460000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-56877-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030568764","9783030568771"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-56877-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"40","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2020\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"371","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":"85","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":"23% - 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":"2.82","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":"19.43","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"}]}}