{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T09:00:56Z","timestamp":1790499656571,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T00:00:00Z","timestamp":1604016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["1717432"],"award-info":[{"award-number":["1717432"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,30]]},"DOI":"10.1145\/3372297.3423365","type":"proceedings-article","created":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T16:20:42Z","timestamp":1614874842000},"page":"819-838","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Tight Consistency Bounds for Bitcoin"],"prefix":"10.1145","author":[{"given":"Peter","family":"Ga\u017ei","sequence":"first","affiliation":[{"name":"IOHK, Bratislava, Slovakia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aggelos","family":"Kiayias","sequence":"additional","affiliation":[{"name":"University of Edinburgh & IOHK, Edinburgh, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Russell","sequence":"additional","affiliation":[{"name":"University of Connecticut & IOHK, Storrs, CT, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,11,2]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"31st SODA","author":"Blum Erica","year":"1975","unstructured":"Erica Blum , Aggelos Kiayias , Cristopher Moore , Saad Quader , and Alexander Russell . 2020. The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains . In 31st SODA , Shuchi Chawla (Ed.). ACM-SIAM , 1135--1154. https:\/\/doi.org\/10.1137\/1.978161 1975 994.69 10.1137\/1.9781611975994.69 Erica Blum, Aggelos Kiayias, Cristopher Moore, Saad Quader, and Alexander Russell. 2020. The Combinatorics of the Longest-Chain Rule: Linear Consistency for Proof-of-Stake Blockchains. In 31st SODA, Shuchi Chawla (Ed.). ACM-SIAM, 1135--1154. https:\/\/doi.org\/10.1137\/1.9781611975994.69"},{"key":"e_1_3_2_2_2_1","unstructured":"Vitalik Buterin. 2013. A Next-Generation Smart Contract and Decentralized Application Platform. https:\/\/github.com\/ethereum\/wiki\/wiki\/White-Paper.  Vitalik Buterin. 2013. A Next-Generation Smart Contract and Decentralized Application Platform. https:\/\/github.com\/ethereum\/wiki\/wiki\/White-Paper."},{"key":"e_1_3_2_2_3_1","volume-title":"Bernoulli","author":"Cam L. Le","unstructured":"L. Le Cam . 1965. On the distribution of sums of independent random variables . In Bernoulli , Bayes, Laplace : Anniversary Volume. Springer-Verlag . L. Le Cam. 1965. On the distribution of sums of independent random variables. In Bernoulli, Bayes, Laplace: Anniversary Volume. Springer-Verlag."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_2"},{"key":"e_1_3_2_2_5_1","volume-title":"Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain. In EUROCRYPT","author":"David Bernardo","year":"2018","unstructured":"Bernardo David , Peter Gazi , Aggelos Kiayias , and Alexander Russell . 2018 . Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain. In EUROCRYPT 2018, Part II (LNCS), Jesper Buus Nielsen and Vincent Rijmen (Eds.), Vol. 10821 . Springer , Heidelberg, 66--98. https:\/\/doi.org\/10.1007\/978--3--319--78375--8_3 10.1007\/978--3--319--78375--8_3 Bernardo David, Peter Gazi, Aggelos Kiayias, and Alexander Russell. 2018. Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain. In EUROCRYPT 2018, Part II (LNCS), Jesper Buus Nielsen and Vincent Rijmen (Eds.), Vol. 10821. Springer, Heidelberg, 66--98. https:\/\/doi.org\/10.1007\/978--3--319--78375--8_3"},{"key":"e_1_3_2_2_6_1","volume-title":"David Tse, Pramod Viswanath, Xuechao Wang, and Ofer Zeitouni.","author":"Dembo Amir","year":"2020","unstructured":"Amir Dembo , Sreeram Kannan , Ertem Nusret Tas , David Tse, Pramod Viswanath, Xuechao Wang, and Ofer Zeitouni. 2020 . Everything is a Race and Nakamoto Always Wins . https:\/\/arxiv.org\/abs\/2005.10484 .arxiv: cs.CR\/2005.10484 Amir Dembo, Sreeram Kannan, Ertem Nusret Tas, David Tse, Pramod Viswanath, Xuechao Wang, and Ofer Zeitouni. 2020. Everything is a Race and Nakamoto Always Wins. https:\/\/arxiv.org\/abs\/2005.10484 .arxiv: cs.CR\/2005.10484"},{"key":"e_1_3_2_2_7_1","volume-title":"Majority Is Not Enough: Bitcoin Mining Is Vulnerable. In FC 2014 (LNCS), Nicolas Christin and Reihaneh Safavi-Naini (Eds.)","volume":"8437","author":"Eyal Ittay","year":"2014","unstructured":"Ittay Eyal and Emin G\u00fcn Sirer . 2014 . Majority Is Not Enough: Bitcoin Mining Is Vulnerable. In FC 2014 (LNCS), Nicolas Christin and Reihaneh Safavi-Naini (Eds.) , Vol. 8437 . Springer, Heidelberg, 436--454. https:\/\/doi.org\/10.1007\/978--3--662--45472--5_28 10.1007\/978--3--662--45472--5_28 Ittay Eyal and Emin G\u00fcn Sirer. 2014. Majority Is Not Enough: Bitcoin Mining Is Vulnerable. In FC 2014 (LNCS), Nicolas Christin and Reihaneh Safavi-Naini (Eds.), Vol. 8437. Springer, Heidelberg, 436--454. https:\/\/doi.org\/10.1007\/978--3--662--45472--5_28"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_10"},{"key":"e_1_3_2_2_11_1","unstructured":"Yaonan Jin Yingkai Li Yining Wang and Yuan Zhou. 2019. On Asymptotically Tight Tail Bounds for Sums of Geometric and Exponential Random Variables. arxiv: math.ST\/1902.02852  Yaonan Jin Yingkai Li Yining Wang and Yuan Zhou. 2019. On Asymptotically Tight Tail Bounds for Sums of Geometric and Exponential Random Variables. arxiv: math.ST\/1902.02852"},{"key":"e_1_3_2_2_12_1","first-page":"41","article-title":"Consistency in Proof-of-Stake Blockchains with Concurrent Honest Slot Leaders","volume":"2020","author":"Kiayias Aggelos","year":"2020","unstructured":"Aggelos Kiayias , Saad Quader , and Alexander Russell . 2020 . Consistency in Proof-of-Stake Blockchains with Concurrent Honest Slot Leaders . IACR Cryptology ePrint Archive , Vol. 2020 (2020), 41 . https:\/\/eprint.iacr.org\/2020\/041 Aggelos Kiayias, Saad Quader, and Alexander Russell. 2020. Consistency in Proof-of-Stake Blockchains with Concurrent Honest Slot Leaders. IACR Cryptology ePrint Archive, Vol. 2020 (2020), 41. https:\/\/eprint.iacr.org\/2020\/041","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_13_1","volume-title":"Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol. In CRYPTO","author":"Kiayias Aggelos","year":"2017","unstructured":"Aggelos Kiayias , Alexander Russell , Bernardo David , and Roman Oliynykov . 2017 . Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol. In CRYPTO 2017, Part I (LNCS ), Jonathan Katz and Hovav Shacham (Eds.), Vol. 10401 . Springer , Heidelberg, 357--388. https:\/\/doi.org\/10.1007\/978--3--319--63688--7_12 10.1007\/978--3--319--63688--7_12 Aggelos Kiayias, Alexander Russell, Bernardo David, and Roman Oliynykov. 2017. Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol. In CRYPTO 2017, Part I (LNCS ), Jonathan Katz and Hovav Shacham (Eds.), Vol. 10401. Springer, Heidelberg, 357--388. https:\/\/doi.org\/10.1007\/978--3--319--63688--7_12"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243814"},{"key":"e_1_3_2_2_15_1","volume-title":"Bitcoin: A Peer-to-Peer Electronic Cash System.","author":"Nakamoto Satoshi","year":"2008","unstructured":"Satoshi Nakamoto . 2008 . Bitcoin: A Peer-to-Peer Electronic Cash System. (2008). Satoshi Nakamoto. 2008. Bitcoin: A Peer-to-Peer Electronic Cash System. (2008)."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56614-6_22"}],"event":{"name":"CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event USA","acronym":"CCS '20","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3423365","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3423365","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3423365","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:20Z","timestamp":1750197740000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3423365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,30]]},"references-count":14,"alternative-id":["10.1145\/3372297.3423365","10.1145\/3372297"],"URL":"https:\/\/doi.org\/10.1145\/3372297.3423365","relation":{},"subject":[],"published":{"date-parts":[[2020,10,30]]},"assertion":[{"value":"2020-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}