{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:06Z","timestamp":1750220166496,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":64,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ARC","award":["180100496"],"award-info":[{"award-number":["180100496"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,11,7]]},"DOI":"10.1145\/3560829.3563558","type":"proceedings-article","created":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T16:05:45Z","timestamp":1667318745000},"page":"15-27","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Leveraging Democracy to Optimize Distributed Random Beacons"],"prefix":"10.1145","author":[{"given":"Alejandro","family":"Ranchal-Pedrosa","sequence":"first","affiliation":[{"name":"Protocol Labs and University of Sydney, Sydney, Australia"}]},{"given":"Vincent","family":"Gramoli","sequence":"additional","affiliation":[{"name":"University of Sydney and Redbelly Network, Sydney, Australia"}]}],"member":"320","published-online":{"date-parts":[[2022,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2019. RANDAO: A DAO working as RNG of Ethereum. https:\/\/github.com\/randao\/randao  2019. RANDAO: A DAO working as RNG of Ethereum. https:\/\/github.com\/randao\/randao"},{"key":"e_1_3_2_1_2_1","unstructured":"2020. Babe: Blind Assignment for Blockchain Extension protocol. https:\/\/w3fresearch.readthedocs.io\/en\/latest\/polkadot\/block-production\/Babe.html  2020. Babe: Blind Assignment for Blockchain Extension protocol. https:\/\/w3fresearch.readthedocs.io\/en\/latest\/polkadot\/block-production\/Babe.html"},{"key":"e_1_3_2_1_3_1","unstructured":"2020. Drand - a distributed randomness beacon daemon. https:\/\/github.com\/drand\/drand.  2020. Drand - a distributed randomness beacon daemon. https:\/\/github.com\/drand\/drand."},{"key":"e_1_3_2_1_4_1","unstructured":"2020. Polkadot: Learn Randomness. https:\/\/wiki.polkadot.network\/docs\/en\/learn-randomness  2020. Polkadot: Learn Randomness. https:\/\/wiki.polkadot.network\/docs\/en\/learn-randomness"},{"key":"e_1_3_2_1_5_1","volume-title":"Sync hotstuff: Simple and practical synchronous state machine replication. S&P","author":"Abraham Ittai","year":"2020","unstructured":"Ittai Abraham , Dahlia Malkhi , Kartik Nayak , Ling Ren , and Maofan Yin . 2020. Sync hotstuff: Simple and practical synchronous state machine replication. S&P ( 2020 ). Ittai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren, and Maofan Yin. 2020. Sync hotstuff: Simple and practical synchronous state machine replication. S&P (2020)."},{"key":"e_1_3_2_1_6_1","volume-title":"Aguilera and Sam Toueg","author":"Marcos","year":"2012","unstructured":"Marcos K. Aguilera and Sam Toueg . 2012 . The correctness proof of Ben-Or's randomized consensus algorithm. Distributed Computing ( 2012). Marcos K. Aguilera and Sam Toueg. 2012. The correctness proof of Ben-Or's randomized consensus algorithm. Distributed Computing (2012)."},{"key":"e_1_3_2_1_7_1","volume-title":"High-threshold avss with optimal communication complexity. Financial Cryptography and Data Security","author":"Alhaddad Nicolas","year":"2021","unstructured":"Nicolas Alhaddad , Mayank Varia , and Haibin Zhang . 2021. High-threshold avss with optimal communication complexity. Financial Cryptography and Data Security ( 2021 ). Nicolas Alhaddad, Mayank Varia, and Haibin Zhang. 2021. High-threshold avss with optimal communication complexity. Financial Cryptography and Data Security (2021)."},{"key":"e_1_3_2_1_8_1","volume-title":"Helix: A scalable and fair consensus algorithm resistant to ordering manipulation.","author":"Asayag Avi","year":"2018","unstructured":"Avi Asayag , Gad Cohen , Ido Grayevsky , Maya Leshkowitz , Ori Rottenstreich , Ronen Tamari , and David Yakira . 2018 . Helix: A scalable and fair consensus algorithm resistant to ordering manipulation. (2018). https:\/\/eprint.iacr.org\/2018\/863 Avi Asayag, Gad Cohen, Ido Grayevsky, Maya Leshkowitz, Ori Rottenstreich, Ronen Tamari, and David Yakira. 2018. Helix: A scalable and fair consensus algorithm resistant to ordering manipulation. (2018). https:\/\/eprint.iacr.org\/2018\/863"},{"key":"e_1_3_2_1_9_1","volume-title":"Efficient Verifiable Secret Sharing with Share Recovery in BFT Protocols. CCS","author":"Basu Soumya","year":"2019","unstructured":"Soumya Basu , Alin Tomescu , Ittai Abraham , Dahlia Malkhi , Michael K. Reiter , and Emin G\u00fcn Sirer . 2019. Efficient Verifiable Secret Sharing with Share Recovery in BFT Protocols. CCS ( 2019 ). Soumya Basu, Alin Tomescu, Ittai Abraham, Dahlia Malkhi, Michael K. Reiter, and Emin G\u00fcn Sirer. 2019. Efficient Verifiable Secret Sharing with Share Recovery in BFT Protocols. CCS (2019)."},{"key":"e_1_3_2_1_10_1","volume-title":"Jesper Buus Nielsen, and Sabine Oechsner","author":"Baum Carsten","year":"2020","unstructured":"Carsten Baum , Bernardo David , Rafael Dowsley , Jesper Buus Nielsen, and Sabine Oechsner . 2020 . CRAFT : Composable Randomness and Almost Fairness from Time. Technical Report. Cryptology ePrint Archive . https:\/\/eprint.iacr.org\/2020\/784 Carsten Baum, Bernardo David, Rafael Dowsley, Jesper Buus Nielsen, and Sabine Oechsner. 2020. CRAFT: Composable Randomness and Almost Fairness from Time. Technical Report. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2020\/784"},{"key":"e_1_3_2_1_12_1","volume-title":"Short signatures from the Weil pairing. Journal of cryptology","author":"Boneh Dan","year":"2004","unstructured":"Dan Boneh , Ben Lynn , and Hovav Shacham . 2004. Short signatures from the Weil pairing. Journal of cryptology ( 2004 ). Dan Boneh, Ben Lynn, and Hovav Shacham. 2004. Short signatures from the Weil pairing. Journal of cryptology (2004)."},{"key":"e_1_3_2_1_13_1","volume-title":"Leakage-resilient coin tossing. Distributed computing","author":"Boyle Elette","year":"2014","unstructured":"Elette Boyle , Shafi Goldwasser , and Yael Tauman Kalai . 2014. Leakage-resilient coin tossing. Distributed computing ( 2014 ). Elette Boyle, Shafi Goldwasser, and Yael Tauman Kalai. 2014. Leakage-resilient coin tossing. Distributed computing (2014)."},{"key":"e_1_3_2_1_14_1","volume-title":"Asynchronous Byzantine agreement protocols. Information and Computation","author":"Bracha Gabriel","year":"1987","unstructured":"Gabriel Bracha . 1987. Asynchronous Byzantine agreement protocols. Information and Computation ( 1987 ). Gabriel Bracha. 1987. Asynchronous Byzantine agreement protocols. Information and Computation (1987)."},{"key":"e_1_3_2_1_15_1","volume-title":"Proofs-of-delay and randomness beacons in ethereum. S&P","author":"B\u00fcnz Benedikt","year":"2017","unstructured":"Benedikt B\u00fcnz , Steven Goldfeder , and Joseph Bonneau . 2017. Proofs-of-delay and randomness beacons in ethereum. S&P ( 2017 ). Benedikt B\u00fcnz, Steven Goldfeder, and Joseph Bonneau. 2017. Proofs-of-delay and randomness beacons in ethereum. S&P (2017)."},{"key":"e_1_3_2_1_16_1","volume-title":"Secure and Efficient Asynchronous Broadcast Protocols. CRYPTO","author":"Cachin Christian","year":"2001","unstructured":"Christian Cachin , Klaus Kursawe , Frank Petzold , and Victor Shoup . 2001. Secure and Efficient Asynchronous Broadcast Protocols. CRYPTO ( 2001 ). Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. 2001. Secure and Efficient Asynchronous Broadcast Protocols. CRYPTO (2001)."},{"key":"e_1_3_2_1_17_1","volume-title":"Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography. Journal of Cryptology","author":"Cachin Christian","year":"2005","unstructured":"Christian Cachin , Klaus Kursawe , and Victor Shoup . 2005. Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography. Journal of Cryptology ( 2005 ). Christian Cachin, Klaus Kursawe, and Victor Shoup. 2005. Random oracles in Constantinople: Practical asynchronous Byzantine agreement using cryptography. Journal of Cryptology (2005)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Jan Camenisch Manu Drijvers Timo Hanke Yvonne-Anne Pignolet Victor Shoup and Dominic Williams. 2021. Internet Computer Consensus. https:\/\/ia.cr\/2021\/632  Jan Camenisch Manu Drijvers Timo Hanke Yvonne-Anne Pignolet Victor Shoup and Dominic Williams. 2021. Internet Computer Consensus. https:\/\/ia.cr\/2021\/632","DOI":"10.1145\/3519270.3538430"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_2_1_20_1","volume-title":"SCRAPE: Scalable Randomness Attested by Public Entities. Applied Cryptography and Network Security","author":"Cascudo Ignacio","year":"2017","unstructured":"Ignacio Cascudo and Bernardo David . 2017 . SCRAPE: Scalable Randomness Attested by Public Entities. Applied Cryptography and Network Security (2017). Ignacio Cascudo and Bernardo David. 2017. SCRAPE: Scalable Randomness Attested by Public Entities. Applied Cryptography and Network Security (2017)."},{"key":"e_1_3_2_1_21_1","volume-title":"ALBATROSS: Publicly AttestabLe BATched Randomness Based On Secret Sharing. ASIACRYPT","author":"Cascudo Ignacio","year":"2020","unstructured":"Ignacio Cascudo and Bernardo David . 2020 . ALBATROSS: Publicly AttestabLe BATched Randomness Based On Secret Sharing. ASIACRYPT (2020). Ignacio Cascudo and Bernardo David. 2020. ALBATROSS: Publicly AttestabLe BATched Randomness Based On Secret Sharing. ASIACRYPT (2020)."},{"key":"e_1_3_2_1_22_1","volume-title":"Wallet Databases with Observers. CRYPTO","author":"Chaum David","year":"1993","unstructured":"David Chaum and Torben Pryds Pedersen . 1993. Wallet Databases with Observers. CRYPTO ( 1993 ). David Chaum and Torben Pryds Pedersen. 1993. Wallet Databases with Observers. CRYPTO (1993)."},{"key":"e_1_3_2_1_24_1","volume-title":"Polygraph: Accountable Byzantine Agreement. ICDCS","author":"Civit Pierre","year":"2021","unstructured":"Pierre Civit , Seth Gilbert , and Vincent Gramoli . 2021 . Polygraph: Accountable Byzantine Agreement. ICDCS (2021). Pierre Civit, Seth Gilbert, and Vincent Gramoli. 2021. Polygraph: Accountable Byzantine Agreement. ICDCS (2021)."},{"key":"e_1_3_2_1_25_1","volume-title":"DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains. NCA","author":"Crain Tyler","year":"2018","unstructured":"Tyler Crain , Vincent Gramoli , Mikel Larrea , and Michel Raynal . 2018 . DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains. NCA (2018). Tyler Crain, Vincent Gramoli, Mikel Larrea, and Michel Raynal. 2018. DBFT: Efficient Leaderless Byzantine Consensus and its Application to Blockchains. NCA (2018)."},{"key":"e_1_3_2_1_26_1","volume-title":"Red Belly: A Secure, Fair and Scalable Open Blockchain. S&P","author":"Crain Tyler","year":"2021","unstructured":"Tyler Crain , Christopher Natoli , and Vincent Gramoli . 2021 . Red Belly: A Secure, Fair and Scalable Open Blockchain. S&P (2021). Tyler Crain, Christopher Natoli, and Vincent Gramoli. 2021. Red Belly: A Secure, Fair and Scalable Open Blockchain. S&P (2021)."},{"key":"e_1_3_2_1_27_1","volume-title":"Irene Miriam Isaac, and Ling Ren","author":"Das Sourav","year":"2022","unstructured":"Sourav Das , Vinith Krishnan , Irene Miriam Isaac, and Ling Ren . 2022 . SPURT : Scalable Distributed Randomness Beacon with Transparent Setup. S&P (2022). Sourav Das, Vinith Krishnan, Irene Miriam Isaac, and Ling Ren. 2022. SPURT: Scalable Distributed Randomness Beacon with Transparent Setup. S&P (2022)."},{"key":"e_1_3_2_1_28_1","volume-title":"Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain. 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. EUROCRYPT (2018). Bernardo David, Peter Gazi, Aggelos Kiayias, and Alexander Russell. 2018. Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain. EUROCRYPT (2018)."},{"key":"e_1_3_2_1_29_1","volume-title":"FAST: Fair Auctions via Secret Transactions. Applied Cryptography and Network Security","author":"David Bernardo","year":"2022","unstructured":"Bernardo David , Lorenzo Gentile , and Mohsen Pourpouneh . 2022 . FAST: Fair Auctions via Secret Transactions. Applied Cryptography and Network Security (2022). Bernardo David, Lorenzo Gentile, and Mohsen Pourpouneh. 2022. FAST: Fair Auctions via Secret Transactions. Applied Cryptography and Network Security (2022)."},{"key":"e_1_3_2_1_30_1","volume-title":"Jesper Buus Nielsen, and Daniel Tschudi","author":"David Bernardo","year":"2021","unstructured":"Bernardo David , Bernardo Magri , Christian Matt , Jesper Buus Nielsen, and Daniel Tschudi . 2021 . GearBox: An Efficient UC Sharded Ledger Leveraging the Safety Liveness Dichotomy. Technical Report. Cryptology ePrint Archive . https:\/\/eprint.iacr.org\/2021\/211 Bernardo David, Bernardo Magri, Christian Matt, Jesper Buus Nielsen, and Daniel Tschudi. 2021. GearBox: An Efficient UC Sharded Ledger Leveraging the Safety Liveness Dichotomy. Technical Report. Cryptology ePrint Archive. https:\/\/eprint.iacr.org\/2021\/211"},{"key":"e_1_3_2_1_31_1","unstructured":"Luciano Freitas de Souza Sara Tucci-Piergiovanni Renaud Sirdey Oana Stan Nicolas Quero and Petr Kuznetsov. 2021. RandSolomon: optimally resilient multi-party random number generation protocol. (2021). http:\/\/arxiv.org\/abs\/2109.04911  Luciano Freitas de Souza Sara Tucci-Piergiovanni Renaud Sirdey Oana Stan Nicolas Quero and Petr Kuznetsov. 2021. RandSolomon: optimally resilient multi-party random number generation protocol. (2021). http:\/\/arxiv.org\/abs\/2109.04911"},{"key":"e_1_3_2_1_32_1","volume-title":"Consensus in the presence of partial synchrony. Journal of the ACM (JACM)","author":"Dwork Cynthia","year":"1988","unstructured":"Cynthia Dwork , Nancy Lynch , and Larry Stockmeyer . 1988. Consensus in the presence of partial synchrony. Journal of the ACM (JACM) ( 1988 ). Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. 1988. Consensus in the presence of partial synchrony. Journal of the ACM (JACM) (1988)."},{"key":"e_1_3_2_1_33_1","unstructured":"A Elrond. 2019. Highly Scalable Public Blockchain via Adaptive State Sharding and Secure Proof of Stake. https:\/\/elrond.com\/assets\/files\/elrond-whitepaper.pdf  A Elrond. 2019. Highly Scalable Public Blockchain via Adaptive State Sharding and Secure Proof of Stake. https:\/\/elrond.com\/assets\/files\/elrond-whitepaper.pdf"},{"key":"e_1_3_2_1_34_1","volume-title":"How To Prove Yourself: Practical Solutions to Identification and Signature Problems. CRYPTO","author":"Fiat Amos","year":"1987","unstructured":"Amos Fiat and Adi Shamir . 1987. How To Prove Yourself: Practical Solutions to Identification and Signature Problems. CRYPTO ( 1987 ). Amos Fiat and Adi Shamir. 1987. How To Prove Yourself: Practical Solutions to Identification and Signature Problems. CRYPTO (1987)."},{"key":"e_1_3_2_1_35_1","unstructured":"Yingzi Gao Yuan Lu Zhenliang Lu Qiang Tang Jing Xu and Zhenfeng Zhang. 2021. Efficient Asynchronous Byzantine Agreement without Private Setups. (2021). http:\/\/arxiv.org\/abs\/2106.07831  Yingzi Gao Yuan Lu Zhenliang Lu Qiang Tang Jing Xu and Zhenfeng Zhang. 2021. Efficient Asynchronous Byzantine Agreement without Private Setups. (2021). http:\/\/arxiv.org\/abs\/2106.07831"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318041.3355467"},{"volume-title":"Foundations of cryptography","author":"Goldreich Oded","key":"e_1_3_2_1_38_1","unstructured":"Oded Goldreich . 2009. Foundations of cryptography : volume 2 , basic applications. Cambridge university press . Oded Goldreich. 2009. Foundations of cryptography: volume 2, basic applications. Cambridge university press."},{"key":"e_1_3_2_1_39_1","unstructured":"Timo Hanke Mahnush Movahedi and Dominic Williams. 2018. Dfinity technology overview series consensus system. (2018). http:\/\/arxiv.org\/abs\/1805.04548  Timo Hanke Mahnush Movahedi and Dominic Williams. 2018. Dfinity technology overview series consensus system. (2018). http:\/\/arxiv.org\/abs\/1805.04548"},{"key":"e_1_3_2_1_40_1","volume-title":"Villar","author":"Heidarvand Somayeh","year":"2009","unstructured":"Somayeh Heidarvand and Jorge L . Villar . 2009 . Public Verifiability from Pairings in Secret Sharing Schemes. Selected Areas in Cryptography ( 2009). Somayeh Heidarvand and Jorge L. Villar. 2009. Public Verifiability from Pairings in Secret Sharing Schemes. Selected Areas in Cryptography (2009)."},{"key":"e_1_3_2_1_41_1","unstructured":"C. Edward Kelso. 2018. Bitcoin Gold Hacked for $18 Million. https:\/\/news. bitcoin.com\/bitcoin-gold-hacked-for-18-million\/  C. Edward Kelso. 2018. Bitcoin Gold Hacked for $18 Million. https:\/\/news. bitcoin.com\/bitcoin-gold-hacked-for-18-million\/"},{"key":"e_1_3_2_1_42_1","volume-title":"Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol. 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. CRYPTO (2017). Aggelos Kiayias, Alexander Russell, Bernardo David, and Roman Oliynykov. 2017. Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol. CRYPTO (2017)."},{"key":"e_1_3_2_1_43_1","volume-title":"Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures. CCS","author":"Kogias Eleftherios Kokoris","year":"2020","unstructured":"Eleftherios Kokoris Kogias , Dahlia Malkhi , and Alexander Spiegelman . 2020. Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures. CCS ( 2020 ). Eleftherios Kokoris Kogias, Dahlia Malkhi, and Alexander Spiegelman. 2020. Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures. CCS (2020)."},{"key":"e_1_3_2_1_44_1","volume-title":"No-Dealer: Byzantine Fault-Tolerant Random Number Generator. INFOCOM workshops","author":"Krasnoselskii Mikhail","year":"2020","unstructured":"Mikhail Krasnoselskii , Grigorii Melnikov , and Yury Yanovich . 2020 . No-Dealer: Byzantine Fault-Tolerant Random Number Generator. INFOCOM workshops (2020). Mikhail Krasnoselskii, Grigorii Melnikov, and Yury Yanovich. 2020. No-Dealer: Byzantine Fault-Tolerant Random Number Generator. INFOCOM workshops (2020)."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405707"},{"key":"e_1_3_2_1_47_1","volume-title":"Sarwate","author":"McEliece Robert J.","year":"1981","unstructured":"Robert J. McEliece and Dilip V . Sarwate . 1981 . On sharing secrets and Reed Solomon codes. Commun. ACM ( 1981). Robert J. McEliece and Dilip V. Sarwate. 1981. On sharing secrets and Reed Solomon codes. Commun. ACM (1981)."},{"key":"e_1_3_2_1_48_1","volume-title":"The Honey Badger of BFT Protocols. CCS","author":"Miller Andrew","year":"2016","unstructured":"Andrew Miller , Yu Xia , Kyle Croman , Elaine Shi , and Dawn Song . 2016. The Honey Badger of BFT Protocols. CCS ( 2016 ). Andrew Miller, Yu Xia, Kyle Croman, Elaine Shi, and Dawn Song. 2016. The Honey Badger of BFT Protocols. CCS (2016)."},{"key":"e_1_3_2_1_49_1","volume-title":"Bitcoin: A peer-to-peer electronic cash system. Decentralized Business Review","author":"Nakamoto Satoshi","year":"2008","unstructured":"Satoshi Nakamoto . 2008 . Bitcoin: A peer-to-peer electronic cash system. Decentralized Business Review (2008), 21260. Satoshi Nakamoto. 2008. Bitcoin: A peer-to-peer electronic cash system. Decentralized Business Review (2008), 21260."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/Blockchain.2019.00083"},{"key":"e_1_3_2_1_51_1","volume-title":"Security Proofs for Signature Schemes. EUROCRYPT","author":"Pointcheval David","year":"1996","unstructured":"David Pointcheval and Jacques Stern . 1996. Security Proofs for Signature Schemes. EUROCRYPT ( 1996 ). David Pointcheval and Jacques Stern. 1996. Security Proofs for Signature Schemes. EUROCRYPT (1996)."},{"key":"e_1_3_2_1_52_1","volume-title":"Competitive Decentralized Randomness Beacon Protocols. International Symposium on Blockchain and Secure Critical Infrastructure","author":"Raikwar Mayank","year":"2022","unstructured":"Mayank Raikwar . 2022 . Competitive Decentralized Randomness Beacon Protocols. International Symposium on Blockchain and Secure Critical Infrastructure (2022). Mayank Raikwar. 2022. Competitive Decentralized Randomness Beacon Protocols. International Symposium on Blockchain and Secure Critical Infrastructure (2022)."},{"key":"e_1_3_2_1_53_1","unstructured":"Jamie Redman. 2020. Bitcoin Gold 51% Attacked - Network Loses $70 000 in Double Spends. https:\/\/news.bitcoin.com\/bitcoin-gold-51-attacked-network loses-70000-in-double-spends\/  Jamie Redman. 2020. Bitcoin Gold 51% Attacked - Network Loses $70 000 in Double Spends. https:\/\/news.bitcoin.com\/bitcoin-gold-51-attacked-network loses-70000-in-double-spends\/"},{"key":"e_1_3_2_1_54_1","volume-title":"Polynomial codes over certain finite fields. Journal of the society for industrial and applied mathematics","author":"Reed Irving S","year":"1960","unstructured":"Irving S Reed and Gustave Solomon . 1960. Polynomial codes over certain finite fields. Journal of the society for industrial and applied mathematics ( 1960 ). Irving S Reed and Gustave Solomon. 1960. Polynomial codes over certain finite fields. Journal of the society for industrial and applied mathematics (1960)."},{"key":"e_1_3_2_1_55_1","volume-title":"Western European Workshop on Research in Cryptology","author":"Ruiz Alexandre","year":"2005","unstructured":"Alexandre Ruiz and Jorge L Villar . 2005 . Publicly verifiable secret sharing from Paillier's cryptosystem . Western European Workshop on Research in Cryptology (2005). Alexandre Ruiz and Jorge L Villar. 2005. Publicly verifiable secret sharing from Paillier's cryptosystem. Western European Workshop on Research in Cryptology (2005)."},{"key":"e_1_3_2_1_56_1","volume-title":"Randrunner: Distributed randomness from trapdoor vdfs with strong uniqueness. Technical Report. https:\/\/eprints.cs.univie.ac.at\/6629\/1\/2020--942.pdf","author":"Schindler Philipp","year":"2021","unstructured":"Philipp Schindler , Aljosha Judmayer , Markus Hittmeir , Nicholas Stifter , and Edgar Weippl . 2021 . Randrunner: Distributed randomness from trapdoor vdfs with strong uniqueness. Technical Report. https:\/\/eprints.cs.univie.ac.at\/6629\/1\/2020--942.pdf Philipp Schindler, Aljosha Judmayer, Markus Hittmeir, Nicholas Stifter, and Edgar Weippl. 2021. Randrunner: Distributed randomness from trapdoor vdfs with strong uniqueness. Technical Report. https:\/\/eprints.cs.univie.ac.at\/6629\/1\/2020--942.pdf"},{"key":"e_1_3_2_1_57_1","volume-title":"A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting. CRYPTO","author":"Schoenmakers Berry","year":"1999","unstructured":"Berry Schoenmakers . 1999. A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting. CRYPTO ( 1999 ). Berry Schoenmakers. 1999. A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting. CRYPTO (1999)."},{"key":"e_1_3_2_1_58_1","volume-title":"How to Share a Secret. Commun. ACM","author":"Shamir Adi","year":"1979","unstructured":"Adi Shamir . 1979. How to Share a Secret. Commun. ACM ( 1979 ). Adi Shamir. 1979. How to Share a Secret. Commun. ACM (1979)."},{"key":"e_1_3_2_1_59_1","unstructured":"Chrysoula Stathakopoulou Tudor David and Marko Vukolic. 2019. Mir-BFT: High-Throughput Robust BFT for Decentralized Networks. http:\/\/arxiv.org\/abs\/1906.05552  Chrysoula Stathakopoulou Tudor David and Marko Vukolic. 2019. Mir-BFT: High-Throughput Robust BFT for Decentralized Networks. http:\/\/arxiv.org\/abs\/1906.05552"},{"key":"e_1_3_2_1_60_1","volume-title":"State Machine Replication Scalability Made Simple. EuroSys","author":"Stathakopoulou Chrysoula","year":"2022","unstructured":"Chrysoula Stathakopoulou , Matej Pavlovic , and Marko Vukolic . 2022. State Machine Replication Scalability Made Simple. EuroSys ( 2022 ). Chrysoula Stathakopoulou, Matej Pavlovic, and Marko Vukolic. 2022. State Machine Replication Scalability Made Simple. EuroSys (2022)."},{"key":"e_1_3_2_1_61_1","volume-title":"Nicolas Gailly, Linus Gasser, Ismail Khoffi, Michael J. Fischer, and Bryan Ford.","author":"Syta Ewa","year":"2017","unstructured":"Ewa Syta , Philipp Jovanovic , Eleftherios Kokoris Kogias , Nicolas Gailly, Linus Gasser, Ismail Khoffi, Michael J. Fischer, and Bryan Ford. 2017 . Scalable Bias Resistant Distributed Randomness. S&P (2017). Ewa Syta, Philipp Jovanovic, Eleftherios Kokoris Kogias, Nicolas Gailly, Linus Gasser, Ismail Khoffi, Michael J. Fischer, and Bryan Ford. 2017. Scalable Bias Resistant Distributed Randomness. S&P (2017)."},{"key":"e_1_3_2_1_62_1","volume-title":"Dispel: Byzantine SMR with Distributed Pipelining. Technical Report. arXiv","author":"Voron Gauthier","year":"2019","unstructured":"Gauthier Voron and Vincent Gramoli . 2019 . Dispel: Byzantine SMR with Distributed Pipelining. Technical Report. arXiv . http:\/\/arxiv.org\/abs\/1912.10367 Gauthier Voron and Vincent Gramoli. 2019. Dispel: Byzantine SMR with Distributed Pipelining. Technical Report. arXiv. http:\/\/arxiv.org\/abs\/1912.10367"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/Blockchain50366.2020.00064"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.45"},{"key":"e_1_3_2_1_65_1","volume-title":"Guy Golan Gueta, and Ittai Abraham","author":"Yin Maofan","year":"2019","unstructured":"Maofan Yin , Dahlia Malkhi , Michael K. Reiter , Guy Golan Gueta, and Ittai Abraham . 2019 . HotStuff: BFT Consensus with Linearity and Responsiveness. PODC ( 2019). Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan Gueta, and Ittai Abraham. 2019. HotStuff: BFT Consensus with Linearity and Responsiveness. PODC (2019)."},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"crossref","unstructured":"Thomas Yurek Licheng Luo Jaiden Fairoze Aniket Kate and Andrew Miller. 2021. hbACSS: How to Robustly Share Many Secrets. https:\/\/eprint.iacr.org\/2021\/159  Thomas Yurek Licheng Luo Jaiden Fairoze Aniket Kate and Andrew Miller. 2021. hbACSS: How to Robustly Share Many Secrets. https:\/\/eprint.iacr.org\/2021\/159","DOI":"10.14722\/ndss.2022.23120"},{"key":"e_1_3_2_1_67_1","unstructured":"Terence Zimwara. 2020. $5.6 Million Double Spent: ETC Team Finally Acknowledges the 51% Attack on Network. https:\/\/news.bitcoin.com\/5-  Terence Zimwara. 2020. $5.6 Million Double Spent: ETC Team Finally Acknowledges the 51% Attack on Network. https:\/\/news.bitcoin.com\/5-"}],"event":{"name":"CCS '22: 2022 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Los Angeles CA USA","acronym":"CCS '22"},"container-title":["Proceedings of the 2022 ACM Workshop on Developments in Consensus"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3560829.3563558","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3560829.3563558","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:34Z","timestamp":1750186834000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3560829.3563558"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":64,"alternative-id":["10.1145\/3560829.3563558","10.1145\/3560829"],"URL":"https:\/\/doi.org\/10.1145\/3560829.3563558","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]},"assertion":[{"value":"2022-11-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}