{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T08:41:36Z","timestamp":1753519296960,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,9,26]],"date-time":"2021-09-26T00:00:00Z","timestamp":1632614400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"MIUR","award":["E11G18000350001"],"award-info":[{"award-number":["E11G18000350001"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,9,26]]},"DOI":"10.1145\/3479722.3480996","type":"proceedings-article","created":{"date-parts":[[2021,11,23]],"date-time":"2021-11-23T17:35:26Z","timestamp":1637688926000},"page":"170-182","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Private attacks in longest chain proof-of-stake protocols with single secret leader elections"],"prefix":"10.1145","author":[{"given":"Sarah","family":"Azouvi","sequence":"first","affiliation":[{"name":"Protocol Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Cappelletti","sequence":"additional","affiliation":[{"name":"Politecnico di Torino"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,11,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Lecture2: Random walks reflection and reversal. http:\/\/cgm.cs.mcgill.ca\/~breed\/MATH671\/lecture2corrected.pdf.  Lecture2: Random walks reflection and reversal. http:\/\/cgm.cs.mcgill.ca\/~breed\/MATH671\/lecture2corrected.pdf."},{"key":"e_1_3_2_1_2_1","volume-title":"Winning the caucus race: Continuous leader election via public randomness. arXiv preprint arXiv:1801.07965","author":"Azouvi Sarah","year":"2018","unstructured":"Sarah Azouvi , Patrick McCorry , and Sarah Meiklejohn . Winning the caucus race: Continuous leader election via public randomness. arXiv preprint arXiv:1801.07965 , 2018 . Sarah Azouvi, Patrick McCorry, and Sarah Meiklejohn. Winning the caucus race: Continuous leader election via public randomness. arXiv preprint arXiv:1801.07965, 2018."},{"key":"e_1_3_2_1_3_1","volume-title":"Proof-of-stake longest chain protocols: Security vs predictability. arXiv preprint arXiv:1910.02218","author":"Bagaria Vivek","year":"2019","unstructured":"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 . 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."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881412.1881450"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.15"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.2307\/1426138"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.69"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3419614.3423258"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61204-1_27"},{"key":"e_1_3_2_1_10_1","unstructured":"Dario Catalano Dario Fiore and Emanuele Giunta. Efficient and universally composable single secret leader election from pairings.  Dario Catalano Dario Fiore and Emanuele Giunta. Efficient and universally composable single secret leader election from pairings."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32101-7_2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78375-8_3"},{"key":"e_1_3_2_1_13_1","volume-title":"Posat: Proof-of-work availability and unpredictability, without the work. arXiv preprint arXiv:2010.08154","author":"Deb Soubhik","year":"2020","unstructured":"Soubhik Deb , Sreeram Kannan , and David Tse . Posat: Proof-of-work availability and unpredictability, without the work. arXiv preprint arXiv:2010.08154 , 2020 . Soubhik Deb, Sreeram Kannan, and David Tse. Posat: Proof-of-work availability and unpredictability, without the work. arXiv preprint arXiv:2010.08154, 2020."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417290"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_1_17_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_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_12"},{"key":"e_1_3_2_1_19_1","volume-title":"Close latency-security trade-off for the nakamoto consensus. CoRR, abs\/2011.14051","author":"Li Jing","year":"2020","unstructured":"Jing Li , Dongning Guo , and Ling Ren . Close latency-security trade-off for the nakamoto consensus. CoRR, abs\/2011.14051 , 2020 . Jing Li, Dongning Guo, and Ling Ren. Close latency-security trade-off for the nakamoto consensus. CoRR, abs\/2011.14051, 2020."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.45"}],"event":{"name":"AFT '21: 3rd ACM Conference on Advances in Financial Technologies","sponsor":["ACM Association for Computing Machinery"],"location":"Arlington Virginia","acronym":"AFT '21"},"container-title":["Proceedings of the 3rd ACM Conference on Advances in Financial Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3479722.3480996","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3479722.3480996","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:19:00Z","timestamp":1750191540000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3479722.3480996"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,26]]},"references-count":20,"alternative-id":["10.1145\/3479722.3480996","10.1145\/3479722"],"URL":"https:\/\/doi.org\/10.1145\/3479722.3480996","relation":{},"subject":[],"published":{"date-parts":[[2021,9,26]]},"assertion":[{"value":"2021-11-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}