{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:43:16Z","timestamp":1783010596042,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":26,"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":["DMS-1954337"],"award-info":[{"award-number":["DMS-1954337"]}]},{"name":"National Science Foundation","award":["CCF-1705007"],"award-info":[{"award-number":["CCF-1705007"]}]},{"name":"National Science Foundation","award":["1651236"],"award-info":[{"award-number":["1651236"]}]},{"name":"Army Research Office","award":["W911NF-14-1-0220"],"award-info":[{"award-number":["W911NF-14-1-0220"]}]},{"name":"Stanford Center for Blockchain Research"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,30]]},"DOI":"10.1145\/3372297.3417290","type":"proceedings-article","created":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T18:27:02Z","timestamp":1604341622000},"page":"859-878","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":73,"title":["Everything is a Race and Nakamoto Always Wins"],"prefix":"10.1145","author":[{"given":"Amir","family":"Dembo","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sreeram","family":"Kannan","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ertem Nusret","family":"Tas","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Tse","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pramod","family":"Viswanath","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xuechao","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ofer","family":"Zeitouni","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,11,2]]},"reference":[{"key":"e_1_3_2_2_1_1","first-page":"357","volume-title":"International Conference on the Theory and Application of Cryptology and Information Security","author":"Abusalah Hamza","year":"2017","unstructured":"7]abusalah2017beyond Hamza Abusalah , Jo\u00ebl Alwen , Bram Cohen , Danylo Khilko , Krzysztof Pietrzak , and Leonid Reyzin . Beyond hellman's time-memory trade-offs with applications to proofs of space . In International Conference on the Theory and Application of Cryptology and Information Security , pages 357 -- 379 . Springer , 2017 . 7]abusalah2017beyondHamza Abusalah, Jo\u00ebl Alwen, Bram Cohen, Danylo Khilko, Krzysztof Pietrzak, and Leonid Reyzin. Beyond hellman's time-memory trade-offs with applications to proofs of space. In International Conference on the Theory and Application of Cryptology and Information Security, pages 357--379. Springer, 2017."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOP750"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"e_1_3_2_2_4_1","volume-title":"Proof-of-stake longest chain protocols: Security vs predictability. arXiv preprint arXiv:1910.02218","author":"Bagaria Vivek","year":"2019","unstructured":"9]pos_paper Vivek Bagaria , Amir Dembo , Sreeram Kannan , Sewoong Oh , David Tse , Pramod Viswanath , Xuechao Wang , and Ofer Zeitouni . Proof-of-stake longest chain protocols: Security vs predictability. arXiv preprint arXiv:1910.02218 , 2019 . 9]pos_paperVivek Bagaria, Amir Dembo, Sreeram Kannan, Sewoong Oh, David Tse, Pramod Viswanath, Xuechao Wang, and Ofer Zeitouni. Proof-of-stake longest chain protocols: Security vs predictability. arXiv preprint arXiv:1910.02218, 2019."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243848"},{"key":"e_1_3_2_2_6_1","volume-title":"Snow white: Provably secure proofs of stake. IACR Cryptology ePrint Archive","author":"Bentov Iddo","year":"2016","unstructured":"Iddo Bentov , Rafael Pass , and Elaine Shi . Snow white: Provably secure proofs of stake. IACR Cryptology ePrint Archive , 2016 :919, 2016. Iddo Bentov, Rafael Pass, and Elaine Shi. Snow white: Provably secure proofs of stake. IACR Cryptology ePrint Archive, 2016:919, 2016."},{"key":"e_1_3_2_2_7_1","volume-title":"The chia network blockchain. https:\/\/www.chia.net\/assets\/ChiaGreenPaper.pdf","author":"Cohen Bram","year":"2019","unstructured":"Bram Cohen and Krzysztof Pietrzak . The chia network blockchain. https:\/\/www.chia.net\/assets\/ChiaGreenPaper.pdf , 2019 . Bram Cohen and Krzysztof Pietrzak. The chia network blockchain. https:\/\/www.chia.net\/assets\/ChiaGreenPaper.pdf, 2019."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_29"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_3"},{"key":"e_1_3_2_2_10_1","volume-title":"David Tse, Pramod Viswanath, Xuechao Wang, and Ofer Zeitouni. Everything is a race and nakamoto always wins. arXiv preprint arXiv:2005.10484","author":"Dembo Amir","year":"2020","unstructured":"0]dem20_arxiv Amir Dembo , Sreeram Kannan , Ertem Nusret Tas , David Tse, Pramod Viswanath, Xuechao Wang, and Ofer Zeitouni. Everything is a race and nakamoto always wins. arXiv preprint arXiv:2005.10484 , 2020 . 0]dem20_arxivAmir Dembo, Sreeram Kannan, Ertem Nusret Tas, David Tse, Pramod Viswanath, Xuechao Wang, and Ofer Zeitouni. Everything is a race and nakamoto always wins. arXiv preprint arXiv:2005.10484, 2020."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00026-009-0009-x"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_10"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOP419"},{"key":"e_1_3_2_2_16_1","volume-title":"Consistency of proof-of-stake blockchains with concurrent honest slot leaders. arXiv preprint arXiv:2001.06403","author":"Kiayias Aggelos","year":"2020","unstructured":"Aggelos Kiayias , Saad Quader , and Alexander Russell . Consistency of proof-of-stake blockchains with concurrent honest slot leaders. arXiv preprint arXiv:2001.06403 , 2020 . Aggelos Kiayias, Saad Quader, and Alexander Russell. Consistency of proof-of-stake blockchains with concurrent honest slot leaders. arXiv preprint arXiv:2001.06403, 2020."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_12"},{"key":"e_1_3_2_2_18_1","volume-title":"Continuous-time analysis of the bitcoin and prism backbone protocols. arXiv preprint arXiv:2001.05644","author":"Li Jing","year":"2020","unstructured":"Jing Li and Dongning Guo . Continuous-time analysis of the bitcoin and prism backbone protocols. arXiv preprint arXiv:2001.05644 , 2020 . Jing Li and Dongning Guo. Continuous-time analysis of the bitcoin and prism backbone protocols. arXiv preprint arXiv:2001.05644, 2020."},{"key":"e_1_3_2_2_19_1","volume-title":"Bitcoin: A peer-to-peer electronic cash system","author":"Nakamoto Satoshi","year":"2008","unstructured":"Satoshi Nakamoto . Bitcoin: A peer-to-peer electronic cash system . 2008 . Satoshi Nakamoto. Bitcoin: A peer-to-peer electronic cash system. 2008."},{"key":"e_1_3_2_2_20_1","volume-title":"10th innovations in theoretical computer science conference (itcs","author":"Pietrzak Krzysztof","year":"2019","unstructured":"Krzysztof Pietrzak . Simple verifiable delay functions . In 10th innovations in theoretical computer science conference (itcs 2019 ). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik , 2018. Krzysztof Pietrzak. Simple verifiable delay functions. In 10th innovations in theoretical computer science conference (itcs 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240050207"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-58387-6_26"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70697-9_14"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56614-6_22"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25372-5"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2019.00016"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47854-7_32"},{"key":"e_1_3_2_2_29_1","volume-title":"Bitcoin's security model revisited. arXiv preprint arXiv:1605.09193","author":"Sompolinsky Yonatan","year":"2016","unstructured":"Yonatan Sompolinsky and Aviv Zohar . Bitcoin's security model revisited. arXiv preprint arXiv:1605.09193 , 2016 . Yonatan Sompolinsky and Aviv Zohar. Bitcoin's security model revisited. arXiv preprint arXiv:1605.09193, 2016."}],"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.3417290","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3417290","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3417290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:31Z","timestamp":1750197691000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417290"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,30]]},"references-count":26,"alternative-id":["10.1145\/3372297.3417290","10.1145\/3372297"],"URL":"https:\/\/doi.org\/10.1145\/3372297.3417290","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"}}]}}