{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T12:41:56Z","timestamp":1771332116595,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":49,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T00:00:00Z","timestamp":1636761600000},"content-version":"vor","delay-in-days":1,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"VMWare Research"},{"name":"Novi Research"},{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-20-2-0026"],"award-info":[{"award-number":["W911NF-20-2-0026"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005825","name":"National Institute of Food and Agriculture","doi-asserted-by":"publisher","award":["2021-67021-34251"],"award-info":[{"award-number":["2021-67021-34251"]}],"id":[{"id":"10.13039\/100005825","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1846316"],"award-info":[{"award-number":["CNS-1846316"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484574","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:27Z","timestamp":1636805127000},"page":"3502-3524","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["RandPiper \u0096 Reconfiguration-Friendly Random Beacons with Quadratic Communication"],"prefix":"10.1145","author":[{"given":"Adithya","family":"Bhat","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}]},{"given":"Nibesh","family":"Shrestha","sequence":"additional","affiliation":[{"name":"Rochester Institute of Technology, Rochester, NY, USA"}]},{"given":"Zhongtang","family":"Luo","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}]},{"given":"Aniket","family":"Kate","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}]},{"given":"Kartik","family":"Nayak","sequence":"additional","affiliation":[{"name":"Duke University, Durham, NC, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Expected O(n2) Communication, and Optimal Resilience","author":"Abraham Ittai","unstructured":"Ittai Abraham, Srinivas Devadas, Danny Dolev, Kartik Nayak, and Ling Ren. 2019 a. Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n2) Communication, and Optimal Resilience. In Financial Cryptography and Data Security, Ian Goldberg and Tyler Moore (Eds.). Springer International Publishing, Cham, 320--334."},{"key":"e_1_3_2_2_2_1","first-page":"1153","article-title":"Dfinity Consensus","volume":"2018","author":"Abraham Ittai","year":"2018","unstructured":"Ittai Abraham, Dahlia Malkhi, Kartik Nayak, and Ling Ren. 2018. Dfinity Consensus, Explored. IACR Cryptol. ePrint Arch., Vol. 2018 (2018), 1153.","journal-title":"Explored. IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00044"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331612"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Ittai Abraham Kartik Nayak Ling Ren and Zhuolun Xiang. 2021. Good-case Latency of Byzantine Broadcast: a Complete Categorization. arxiv: 2102.07240 [cs.DC]","DOI":"10.1145\/3465084.3467899"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_32"},{"key":"e_1_3_2_2_7_1","volume-title":"Zekun Li, Dahlia Malkhi, Oded Naor, Dmitri Perelman, et al.","author":"Bano Shehar","year":"2020","unstructured":"Shehar Bano, Mathieu Baudet, Avery Ching, Andrey Chursin, George Danezis, Francc ois Garillot, Zekun Li, Dahlia Malkhi, Oded Naor, Dmitri Perelman, et al. 2020. State machine replication in the Libra Blockchain."},{"key":"e_1_3_2_2_8_1","volume-title":"Advances in Cryptology -- EUROCRYPT '97","author":"Bari\u0107 Niko","unstructured":"Niko Bari\u0107 and Birgit Pfitzmann. 1997. Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees. In Advances in Cryptology -- EUROCRYPT '97, Walter Fumy (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 480--494."},{"key":"e_1_3_2_2_9_1","unstructured":"Paulo S. L. M. Barreto Ben Lynn and Michael Scott. 2002. Constructing Elliptic Curves with Prescribed Embedding Degrees. Cryptology ePrint Archive Report 2002\/088. https:\/\/eprint.iacr.org\/2002\/088."},{"key":"e_1_3_2_2_10_1","unstructured":"Adithya Bhat Nibesh Shrestha Aniket Kate and Kartik Nayak. 2020 a. RandPiper -- Reconfiguration-Friendly Random Beacons with Quadratic Communication. Cryptology ePrint Archive Report 2020\/1590. https:\/\/eprint.iacr.org\/2020\/1590."},{"key":"e_1_3_2_2_11_1","first-page":"1590","article-title":"b. RandPiper-Reconfiguration-Friendly Random Beacons with Quadratic Communication","volume":"2020","author":"Bhat Adithya","year":"2020","unstructured":"Adithya Bhat, Nibesh Shrestha, Aniket Kate, and Kartik Nayak. 2020 b. RandPiper-Reconfiguration-Friendly Random Beacons with Quadratic Communication. IACR Cryptol. ePrint Arch., Vol. 2020 (2020), 1590.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9005-7"},{"key":"e_1_3_2_2_14_1","volume-title":"The latest gossip on BFT consensus. arxiv","author":"Buchman Ethan","year":"1807","unstructured":"Ethan Buchman, Jae Kwon, and Zarko Milosevic. 2019. The latest gossip on BFT consensus. arxiv: 1807.04938 [cs.DC]"},{"key":"e_1_3_2_2_15_1","unstructured":"Vitalik Buterin and Virgil Griffith. 2019. Casper the Friendly Finality Gadget. arxiv: 1710.09437 [cs.CR]"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0318-0"},{"key":"e_1_3_2_2_17_1","volume-title":"SCRAPE: Scalable Randomness Attested by Public Entities","author":"Cascudo Ignacio","year":"2017","unstructured":"Ignacio Cascudo and Bernardo David. 2017. SCRAPE: Scalable Randomness Attested by Public Entities. In Applied Cryptography and Network Security, Dieter Gollmann, Atsuko Miyaji, and Hiroaki Kikuchi (Eds.). Springer International Publishing, Cham, 537--556."},{"key":"e_1_3_2_2_18_1","unstructured":"Chainlink. 2021. Generate Random Numbers for Smart Contracts using Chainlink VRF. https:\/\/docs.chain.link\/docs\/chainlink-vrf"},{"key":"e_1_3_2_2_19_1","unstructured":"T-H. Hubert Chan Rafael Pass and Elaine Shi. 2018. PiLi: An Extremely Simple Synchronous Blockchain. Cryptology ePrint Archive Report 2018\/980. https:\/\/ia.cr\/2018\/980."},{"key":"e_1_3_2_2_20_1","first-page":"1320","article-title":"Homomorphic Encryption Random Beacon","volume":"2019","author":"Cherniaeva Alisa","year":"2019","unstructured":"Alisa Cherniaeva, Ilia Shirobokov, and Omer Shlomovits. 2019. Homomorphic Encryption Random Beacon. IACR Cryptol. ePrint Arch., Vol. 2019 (2019), 1320.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_21_1","unstructured":"Information Technology Laboratory Computer Security Division. 2021. Interoperable Randomness Beacons: CSRC. https:\/\/csrc.nist.gov\/projects\/interoperable-randomness-beacons"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_2_24_1","volume-title":"Minimal VDF randomness beacon. Ethereum Research Post","author":"Drake J","year":"2018","unstructured":"J Drake. 2021. Minimal VDF randomness beacon. Ethereum Research Post (2018)."},{"key":"e_1_3_2_2_25_1","unstructured":"Drand. 2021. Drand - A Distributed Randomness Beacon Daemon. https:\/\/github.com\/drand\/drand"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539790187084"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_2_28_1","unstructured":"Mads Haahr. 2021. True Random Number Service. https:\/\/www.random.org\/"},{"key":"e_1_3_2_2_29_1","unstructured":"Runchao Han Haoyu Lin and Jiangshan Yu. 2020. RandChain: Decentralised Randomness Beacon from Sequential Proof-of-Work. Cryptology ePrint Archive Report 2020\/1033. https:\/\/ia.cr\/2020\/1033."},{"key":"e_1_3_2_2_30_1","volume-title":"Consensus System. arxiv","author":"Hanke Timo","year":"1805","unstructured":"Timo Hanke, Mahnush Movahedi, and Dominic Williams. 2018. DFINITY Technology Overview Series, Consensus System. arxiv: 1805.04548 [cs.DC]"},{"key":"e_1_3_2_2_31_1","volume-title":"Selected Areas in Cryptography: 15th International Workshop, SAC 2008","author":"Heidarvand Somayeh","unstructured":"Somayeh Heidarvand and Jorge L. Villar. 2009. Public Verifiability from Pairings in Secret Sharing Schemes. In Selected Areas in Cryptography: 15th International Workshop, SAC 2008, Sackville, New Brunswick, Canada, August 14--15, Revised Selected Papers. Springer-Verlag, Berlin, Heidelberg, 294--308."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_27"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339817"},{"key":"e_1_3_2_2_35_1","volume-title":"Optimal Communication Complexity of Authenticated Byzantine Agreement. arxiv","author":"Momose Atsuki","year":"2007","unstructured":"Atsuki Momose and Ling Ren. 2021. Optimal Communication Complexity of Authenticated Byzantine Agreement. arxiv: 2007.13175 [cs.DC]"},{"key":"e_1_3_2_2_36_1","volume-title":"Improved Extension Protocols for Byzantine Broadcast and Agreement. arxiv","author":"Nayak Kartik","year":"2002","unstructured":"Kartik Nayak, Ling Ren, Elaine Shi, Nitin H. Vaidya, and Zhuolun Xiang. 2020. Improved Extension Protocols for Byzantine Broadcast and Agreement. arxiv: 2002.11321 [cs.CR]"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_19"},{"key":"e_1_3_2_2_38_1","volume-title":"Advances in Cryptology -- CRYPTO '91","author":"Pedersen Torben Pryds","unstructured":"Torben Pryds Pedersen. 1992. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In Advances in Cryptology -- CRYPTO '91, Joan Feigenbaum (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 129--140."},{"key":"e_1_3_2_2_39_1","unstructured":"Provable. 2021. blockchain oracle service enabling data-rich smart contracts. https:\/\/provable.xyz\/"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_2_42_1","unstructured":"Philipp Schindler. 2021. HydRand. https:\/\/github.com\/PhilippSchindler\/hydrand"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Philipp Schindler Aljosha Judmayer Markus Hittmeir Nicholas Stifter and Edgar Weippl. 2020 a. RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness. Technical Report. Cryptology ePrint Archive Report 2020\/942 https:\/\/eprint. iacr. org\/2020\/942.","DOI":"10.14722\/ndss.2021.24116"},{"key":"e_1_3_2_2_44_1","volume-title":"HydRand: Efficient Continuous Distributed Randomness. In 2020 IEEE Symposium on Security and Privacy (SP). IEEE, Oakland, 73--89","author":"Schindler Philipp","year":"2020","unstructured":"Philipp Schindler, Aljosha Judmayer, Nicholas Stifter, and Edgar Weippl. 2020 b. HydRand: Efficient Continuous Distributed Randomness. In 2020 IEEE Symposium on Security and Privacy (SP). IEEE, Oakland, 73--89."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417284"},{"key":"e_1_3_2_2_47_1","volume-title":"Scalable Bias-Resistant Distributed Randomness. In 2017 IEEE Symposium on Security and Privacy (SP). IEEE, Oakland, 444--460","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. In 2017 IEEE Symposium on Security and Privacy (SP). IEEE, Oakland, 444--460."},{"key":"e_1_3_2_2_48_1","unstructured":"Tokio-Rs. 2021. tokio-rs\/tokio. https:\/\/github.com\/tokio-rs\/tokio"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event Republic of Korea","acronym":"CCS '21","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484574","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484574","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484574","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:43:40Z","timestamp":1763498620000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484574"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":49,"alternative-id":["10.1145\/3460120.3484574","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484574","relation":{},"subject":[],"published":{"date-parts":[[2021,11,12]]},"assertion":[{"value":"2021-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}