{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:43:54Z","timestamp":1787017434447,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":78,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"European Research Council","doi-asserted-by":"publisher","award":["101116713"],"award-info":[{"award-number":["101116713"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["507237585"],"award-info":[{"award-number":["507237585"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3690287","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"941-955","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["GRandLine: Adaptively Secure DKG and Randomness Beacon with (Log-)Quadratic Communication Complexity"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-7037-2458","authenticated-orcid":false,"given":"Renas","family":"Bacho","sequence":"first","affiliation":[{"name":"CISPA Helmholtz Center for Information Security & Saarland University, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3290-0674","authenticated-orcid":false,"given":"Christoph","family":"Lenzen","sequence":"additional","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7979-3810","authenticated-orcid":false,"given":"Julian","family":"Loss","sequence":"additional","affiliation":[{"name":"CISPA Helmholtz Center for Information Security, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-2568-5628","authenticated-orcid":false,"given":"Simon","family":"Ochsenreither","sequence":"additional","affiliation":[{"name":"Vector Informatik GmbH, Stuttgart, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-4341-0680","authenticated-orcid":false,"given":"Dimitrios","family":"Papachristoudis","sequence":"additional","affiliation":[{"name":"Researcher, Saarbr\u00fccken, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2023. Library implementation for the BN254 pairing-friendly elliptic curve. docs.rs. https:\/\/docs.rs\/ark-bn254\/0.4.0\/ark_bn254\/index.html"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031--38557--5_2"},{"key":"e_1_3_2_1_3_1","volume-title":"Reaching Consensus for Asynchronous Distributed Key Generation. In 40th ACM Symposium Annual on Principles of Distributed Computing. Association for Computing Machinery","author":"Abraham Ittai","year":"2021","unstructured":"Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, and Alin Tomescu. 2021. Reaching Consensus for Asynchronous Distributed Key Generation. In 40th ACM Symposium Annual on Principles of Distributed Computing. Association for Computing Machinery, Portland, OR, USA, 363--373."},{"key":"e_1_3_2_1_4_1","unstructured":"Ittai Abraham Dahlia Malkhi Kartik Nayak and Ling Ren. 2018. Dfinity Consensus Explored. Cryptology ePrint Archive Report 2018\/1153. https: \/\/eprint.iacr.org\/2018\/1153."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","unstructured":"Nicolas Alhaddad Mayank Varia and Haibin Zhang. 2021. High-Threshold AVSS with Optimal Communication Complexity. 479--498. https:\/\/doi.org\/10.1007\/978- 3--662--64331-0_25","DOI":"10.1007\/978-"},{"key":"e_1_3_2_1_6_1","unstructured":"Anonymous. 2023. Cryptography for GRandLine. GitHub repository. https: \/\/github.com\/DiPa0123\/Optrand-PVSS"},{"key":"e_1_3_2_1_7_1","unstructured":"Anonymous. 2023. Implementation of GRandLine. GitHub repository. https: \/\/github.com\/DiPa0123\/GRandLine"},{"key":"e_1_3_2_1_8_1","unstructured":"arkworks contributors. 2022. arkworks zkSNARK ecosystem. https:\/\/arkworks.rs"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","unstructured":"Thomas Attema Ronald Cramer and Matthieu Rambaud. 2021. Compressed Sigma- Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures. 526--556. https:\/\/doi.org\/10.1007\/978--3-030- 92068--5_18","DOI":"10.1007\/978--3-030-"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031--38557--5_3"},{"key":"e_1_3_2_1_11_1","unstructured":"Renas Bacho Christoph Lenzen Julian Loss Simon Ochsenreither and Dimitrios Papachristoudis. 2023. GRandLine: Adaptively Secure DKG and Randomness Beacon with (Log-)Quadratic Communication Complexity. Cryptology ePrint Archive Paper 2023\/1887. https:\/\/eprint.iacr.org\/2023\/1887"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","unstructured":"Renas Bacho and Julian Loss. 2022. On the Adaptive Security of the Threshold BLS Signature Scheme. 193--207. https:\/\/doi.org\/10.1145\/3548606.3560656","DOI":"10.1145\/3548606.3560656"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3576915.3623106"},{"key":"e_1_3_2_1_14_1","volume-title":"HARTS: High-Threshold, Adaptively Secure, and Robust Threshold Schnorr Signatures. Cryptology ePrint Archive, Paper 2024\/280. https:\/\/eprint.iacr.org\/2024\/280 https:\/\/eprint.iacr.org\/2024\/280.","author":"Bacho Renas","year":"2024","unstructured":"Renas Bacho, Julian Loss, Gilad Stern, and Benedikt Wagner. 2024. HARTS: High-Threshold, Adaptively Secure, and Robust Threshold Schnorr Signatures. Cryptology ePrint Archive, Paper 2024\/280. https:\/\/eprint.iacr.org\/2024\/280 https:\/\/eprint.iacr.org\/2024\/280."},{"key":"e_1_3_2_1_15_1","unstructured":"Akhil Bandarupalli Adithya Bhat Saurabh Bagchi Aniket Kate and Michael Reiter. 2023. HashRand: Efficient Asynchronous Random Beacon without Threshold Cryptographic Setup. Cryptology ePrint Archive Paper 2023\/1755. https:\/\/eprint.iacr.org\/2023\/1755 https:\/\/eprint.iacr.org\/2023\/1755."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","unstructured":"Mihir Bellare and Phillip Rogaway. 1993. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. 62--73. https:\/\/doi.org\/10.1145\/168588. 168596","DOI":"10.1145\/168588"},{"key":"e_1_3_2_1_17_1","volume-title":"Perry","author":"Berman Piotr","year":"1989","unstructured":"Piotr Berman, Juan A. Garay, and Kenneth J. Perry. 1989. Towards Optimal Distributed Consensus (Extended Abstract). 410--415. https:\/\/doi.org\/10.1109\/ SFCS.1989.63511"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2023.24832"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","unstructured":"Adithya Bhat Nibesh Shrestha Zhongtang Luo Aniket Kate and Kartik Nayak. 2021. RandPiper - Reconfiguration-Friendly Random Beacons with Quadratic Communication. 3502--3524. https:\/\/doi.org\/10.1145\/3460120.3484574","DOI":"10.1145\/3460120.3484574"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","unstructured":"Alexandra Boldyreva. 2003. Threshold Signatures Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme. 31--46. https:\/\/doi.org\/10.1007\/3--540--36288--6_3","DOI":"10.1007\/3--540--36288--6_3"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","unstructured":"Dan Boneh Joseph Bonneau Benedikt B\u00fcnz and Ben Fisch. 2018. Verifiable Delay Functions. 757--788. https:\/\/doi.org\/10.1007\/978--3--319--96884--1_25","DOI":"10.1007\/978--3--319--96884--1_25"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","unstructured":"Dan Boneh Benedikt B\u00fcnz and Ben Fisch. 2019. Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains. 561--586. https:\/\/doi.org\/10.1007\/978--3-030--26948--7_20","DOI":"10.1007\/978--3-030--26948--7_20"},{"key":"e_1_3_2_1_23_1","unstructured":"Benedikt B\u00fcnz Steven Goldfeder and Joseph Bonneau. 2017. Proofs-of-delay and randomness beacons in Ethereum."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0318-0"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","unstructured":"Ran Canetti Rosario Gennaro Stanislaw Jarecki Hugo Krawczyk and Tal Rabin. 1999. Adaptive Security for Threshold Cryptosystems. 98--115. https:\/\/doi.org\/ 10.1007\/3--540--48405--1_7","DOI":"10.1007\/3--540--48405--1_7"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--61204--1_27"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-030--64840--4_11"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-031--58740--5_8"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--48071--4_7"},{"key":"e_1_3_2_1_30_1","unstructured":"Alisa Cherniaeva Ilia Shirobokov and Omer Shlomovits. 2019. Homomorphic Encryption Random Beacon. Cryptology ePrint Archive Report 2019\/1320. https:\/\/eprint.iacr.org\/2019\/1320."},{"key":"e_1_3_2_1_31_1","volume-title":"Bicorn: An optimistically efficient distributed randomness beacon. Cryptology ePrint Archive, Report 2023\/221. https:\/\/eprint.iacr.org\/2023\/221.","author":"Choi Kevin","year":"2023","unstructured":"Kevin Choi, Arasu Arun, Nirvan Tyagi, and Joseph Bonneau. 2023. Bicorn: An optimistically efficient distributed randomness beacon. Cryptology ePrint Archive, Report 2023\/221. https:\/\/eprint.iacr.org\/2023\/221."},{"key":"e_1_3_2_1_32_1","volume-title":"SoK: Distributed Randomness Beacons. In 44th IEEE Symposium on Security and Privacy, SP 2023","author":"Choi Kevin","year":"2023","unstructured":"Kevin Choi, Aathira Manoj, and Joseph Bonneau. 2023. SoK: Distributed Randomness Beacons. In 44th IEEE Symposium on Security and Privacy, SP 2023, San Francisco, CA, USA, May 21--25, 2023. IEEE, 75--92. https:\/\/doi.org\/10.1109\/ SP46215.2023.10179419"},{"key":"e_1_3_2_1_33_1","unstructured":"Tokio contributors. 2023. Tokio library for networking in Rust. https:\/\/tokio.rs\/"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833580"},{"key":"e_1_3_2_1_35_1","unstructured":"Sourav Das Benny Pinkas Alin Tomescu and Zhuolun Xiang. 2024. Distributed Randomness using Weighted VRFs. Cryptology ePrint Archive Paper 2024\/198. https:\/\/eprint.iacr.org\/2024\/198 https:\/\/eprint.iacr.org\/2024\/198."},{"key":"e_1_3_2_1_36_1","volume-title":"Practical Asynchronous High-threshold Distributed Key Generation and Distributed Polynomial Sampling. In 32nd USENIX Security Symposium (USENIX Security . USENIX Association","author":"Das Sourav","year":"2023","unstructured":"Sourav Das, Zhuolun Xiang, Lefteris Kokoris-Kogias, and Ling Ren. 2023. Practical Asynchronous High-threshold Distributed Key Generation and Distributed Polynomial Sampling. In 32nd USENIX Security Symposium (USENIX Security . USENIX Association, Anaheim, CA, 5359--5376. https:\/\/www.usenix.org\/ conference\/usenixsecurity23\/presentation\/das"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833584"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--319--78375--8_3"},{"key":"e_1_3_2_1_39_1","volume-title":"Syverson","author":"Dingledine Roger","year":"2004","unstructured":"Roger Dingledine, Nick Mathewson, and Paul F. Syverson. 2004. Tor: The Second- Generation Onion Router. 303--320."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056650"},{"key":"e_1_3_2_1_43_1","unstructured":"Justin Drake. 2018. Minimal VDF randomness beacon. (2018). https:\/\/ethresear. ch\/t\/minimal-vdf-randomness-beacon\/3566"},{"key":"e_1_3_2_1_44_1","unstructured":"Hanwen Feng Zhenliang Lu and Qiang Tang. 2024. Breaking the Cubic Barrier: Distributed Key and Randomness Generation through Deterministic Sharding. Cryptology ePrint Archive Paper 2024\/168. https:\/\/eprint.iacr.org\/2024\/168 https:\/\/eprint.iacr.org\/2024\/168."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","unstructured":"Georg Fuchsbauer Eike Kiltz and Julian Loss. 2018. The Algebraic Group Model and its Applications. 33--62. https:\/\/doi.org\/10.1007\/978--3--319--96881-0_2","DOI":"10.1007\/978--3--319--96881-0_2"},{"key":"e_1_3_2_1_46_1","unstructured":"Yingzi Gao Yuan Lu Zhenliang Lu Qiang Tang Jing Xu and Zhenfeng Zhang. 2021. Efficient Asynchronous Byzantine Agreement without Private Setups. Cryptology ePrint Archive Report 2021\/810. https:\/\/eprint.iacr.org\/2021\/810."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-006-0347--3"},{"key":"e_1_3_2_1_48_1","volume-title":"Jesper Buus Nielsen, and Sophia Yakoubov","author":"Gentry Craig","year":"2021","unstructured":"Craig Gentry, Shai Halevi, Bernardo Magri, Jesper Buus Nielsen, and Sophia Yakoubov. 2021. Random-Index PIR and Applications. 32--61. https:\/\/doi.org\/10. 1007\/978--3-030--90456--2_2"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132757"},{"key":"e_1_3_2_1_50_1","unstructured":"Jens Groth. 2021. Non-interactive distributed key generation and key resharing. Cryptology ePrint Archive Report 2021\/339. https:\/\/eprint.iacr.org\/2021\/339."},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","unstructured":"Kobi Gurkan Philipp Jovanovic Mary Maller Sarah Meiklejohn Gilad Stern and Alin Tomescu. 2021. Aggregatable Distributed Key Generation. 147--176. https:\/\/doi.org\/10.1007\/978--3-030--77870--5_6","DOI":"10.1007\/978--3-030--77870--5_6"},{"key":"e_1_3_2_1_52_1","unstructured":"Runchao Han Jiangshan Yu and Haoyu Lin. 2020. RandChain: Decentralised Randomness Beacon from Sequential Proof-of-Work. Cryptology ePrint Archive Report 2020\/1033. https:\/\/eprint.iacr.org\/2020\/1033."},{"key":"e_1_3_2_1_53_1","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_1_54_1","doi-asserted-by":"publisher","unstructured":"Stanislaw Jarecki and Anna Lysyanskaya. 2000. Adaptively Secure Threshold Cryptography: Introducing Concurrency Removing Erasures. 221--242. https: \/\/doi.org\/10.1007\/3--540--45539--6_16","DOI":"10.1007\/3--540--45539--6_16"},{"key":"e_1_3_2_1_55_1","volume-title":"Pratyay Mukherjee, Hamza Saleem, and Sri Aravinda Krishnan Thyagarajan.","author":"Kate Aniket","year":"2023","unstructured":"Aniket Kate, Easwar Vivek Mangipudi, Pratyay Mukherjee, Hamza Saleem, and Sri Aravinda Krishnan Thyagarajan. 2023. Non-interactive VSS using Class Groups and Application to DKG. Cryptology ePrint Archive, Paper 2023\/451. https:\/\/eprint.iacr.org\/2023\/451 https:\/\/eprint.iacr.org\/2023\/451."},{"key":"e_1_3_2_1_56_1","unstructured":"Alireza Kavousi Zhipeng Wang and Philipp Jovanovic. 2023. SoK: Public Randomness. Cryptology ePrint Archive Paper 2023\/1121. https:\/\/eprint.iacr.org\/ 2023\/1121 https:\/\/eprint.iacr.org\/2023\/1121."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"crossref","unstructured":"Eleftherios Kokoris-Kogias Dahlia Malkhi and Alexander Spiegelman. 2020. Asynchronous Distributed Key Generation for Computationally-Secure Randomness Consensus and Threshold Signatures. 1751--1767. https:\/\/doi.org\/10.1145\/ 3372297.3423364","DOI":"10.1145\/3372297.3423364"},{"key":"e_1_3_2_1_58_1","unstructured":"SCIPR Lab. 2021. C library for Finite Fields and Elliptic Curves. GitHub repository. https:\/\/github.com\/scipr-lab\/libff"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538425"},{"key":"e_1_3_2_1_61_1","unstructured":"Zhongtang Luo. 2022. Implementation for RandPiper. Github. https:\/\/github. com\/zhtluo\/randpiper-rs"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2021.32"},{"key":"e_1_3_2_1_63_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). https:\/\/bitcoin.org\/bitcoin.pdf"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2020.28"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_19"},{"key":"e_1_3_2_1_66_1","unstructured":"Valeria Nikolaenko Sam Ragsdale Joseph Bonneau and Dan Boneh. 2022. Powers-of-Tau to the People: Decentralizing Setup Ceremonies. Cryptology ePrint Archive Report 2022\/1592. https:\/\/eprint.iacr.org\/2022\/1592."},{"key":"e_1_3_2_1_67_1","unstructured":"Drand Organization. 2020. Drand - A Distributed Randomness Beacon Daemon. GitHub repository. https:\/\/github.com\/drand\/drand"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","unstructured":"Torben P. Pedersen. 1992. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. 129--140. https:\/\/doi.org\/10.1007\/3--540--46766--1_9","DOI":"10.1007\/3--540--46766--1_9"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_1_70_1","volume-title":"Wahby","author":"Sakemi Yumi","year":"2022","unstructured":"Yumi Sakemi, Tetsutaro Kobayashi, Tsunekazu Saito, and Riad S. Wahby. 2022. Internet Research Task Force (IRTF) Draft for Pairing-Friendly Curves. https: \/\/datatracker.ietf.org\/doc\/draft-irtf-cfrg-pairing-friendly-curves\/"},{"key":"e_1_3_2_1_71_1","volume-title":"Weippl","author":"Schindler Philipp","year":"2021","unstructured":"Philipp Schindler, Aljosha Judmayer, Markus Hittmeir, Nicholas Stifter, and Edgar R. Weippl. 2021. RandRunner: Distributed Randomness from Trapdoor VDFs with Strong Uniqueness."},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00003"},{"key":"e_1_3_2_1_73_1","unstructured":"Nibesh Shrestha. 2022. Implementation for OptRand. Github. https:\/\/github. com\/nibeshrestha\/optrand\/tree\/crypto_dev"},{"key":"e_1_3_2_1_74_1","unstructured":"Nibesh Shrestha Adithya Bhat Aniket Kate and Kartik Nayak. 2021. Synchronous Distributed Key Generation without Broadcasts. Cryptology ePrint Archive Report 2021\/1635. https:\/\/eprint.iacr.org\/2021\/1635."},{"key":"e_1_3_2_1_75_1","doi-asserted-by":"crossref","unstructured":"Markus Stadler. 1996. Publicly Verifiable Secret Sharing. 190--199. https:\/\/doi. org\/10.1007\/3--540--68339--9_17","DOI":"10.1007\/3-540-68339-9_17"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","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. 444--460. https:\/\/doi.org\/10.1109\/SP.2017.45","DOI":"10.1109\/SP.2017.45"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","unstructured":"Alin Tomescu Robert Chen Yiming Zheng Ittai Abraham Benny Pinkas Guy Golan-Gueta and Srinivas Devadas. 2020. Towards Scalable Threshold Cryptosystems. 877--893. https:\/\/doi.org\/10.1109\/SP40000.2020.00059","DOI":"10.1109\/SP40000.2020.00059"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","unstructured":"Maofan Yin Dahlia Malkhi Michael K. Reiter Guy Golan-Gueta and Ittai Abraham. 2019. HotStuff: BFT Consensus with Linearity and Responsiveness. 347--356. https:\/\/doi.org\/10.1145\/3293611.3331591","DOI":"10.1145\/3293611.3331591"}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","location":"Salt Lake City UT USA","acronym":"CCS '24","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690287","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3690287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:17:53Z","timestamp":1755843473000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":78,"alternative-id":["10.1145\/3658644.3690287","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3690287","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}