{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:19:21Z","timestamp":1783610361696,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3662158.3662799","type":"proceedings-article","created":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T14:38:06Z","timestamp":1717598286000},"page":"283-294","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Swiper: a new paradigm for efficient weighted distributed protocols"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8764-8760","authenticated-orcid":false,"given":"Andrei","family":"Tonkikh","sequence":"first","affiliation":[{"name":"LTCI, Telecom Paris, Institut Polytechnique Paris, Palaiseau, Essonne, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7444-7345","authenticated-orcid":false,"given":"Luciano","family":"Freitas","sequence":"additional","affiliation":[{"name":"LTCI, Telecom Paris, Institut Polytechnique Paris, Palaiseau, Essonne, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. ACM, Italy, virtual, 363--373","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 Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing. ACM, Italy, virtual, 363--373."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331612"},{"key":"e_1_3_2_1_3_1","unstructured":"Algoexplorer. 2023. Algorand stake distribution. https:\/\/algoexplorer.io\/top-accounts. Accessed: 2023-03-28."},{"key":"e_1_3_2_1_5_1","unstructured":"Aptoscan. 2023. Aptos stake distribution. https:\/\/aptoscan.com\/validators?ps=100&p=. Accessed: 2023-03-28."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 2022 ACM Workshop on Developments in Consensus. ACM","author":"Azouvi Sarah","year":"2022","unstructured":"Sarah Azouvi and Marko Vukoli\u0107. 2022. Pikachu: Securing PoS Blockchains from Long-Range Attacks by Checkpointing into Bitcoin PoW using Taproot. In Proceedings of the 2022 ACM Workshop on Developments in Consensus. ACM, Los Angeles, 53--65."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1126302.1711160"},{"key":"e_1_3_2_1_8_1","unstructured":"Fabrice Benhamouda Shai Halevi and Lev Stambler. 2022. Weighted Secret Sharing from Wiretap Channels. Cryptology ePrint Archive Paper 2022\/1578. https:\/\/eprint.iacr.org\/2022\/1578 https:\/\/eprint.iacr.org\/2022\/1578."},{"key":"e_1_3_2_1_9_1","volume-title":"Public Key Cryptography --- PKC","author":"Boldyreva Alexandra","year":"2003","unstructured":"Alexandra Boldyreva. 2002. Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme. In Public Key Cryptography --- PKC 2003, Yvo G. Desmedt (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 31--46."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3419614.3423258"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings, Part I 38","author":"Boneh Dan","year":"2018","unstructured":"Dan Boneh, Rosario Gennaro, Steven Goldfeder, Aayush Jain, Sam Kim, Peter MR Rasmussen, and Amit Sahai. 2018. Threshold cryptosystems from threshold fully homomorphic encryption. In Advances in Cryptology-CRYPTO 2018: 38th Annual International Cryptology Conference, August 19--23, 2018, Proceedings, Part I 38. Springer, Santa Barbara, CA, USA, 565--596."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/4221.214134"},{"key":"e_1_3_2_1_13_1","volume-title":"Introduction to reliable and secure distributed programming","author":"Cachin Christian","unstructured":"Christian Cachin, Rachid Guerraoui, and Lu\u00eds Rodrigues. 2011. Introduction to reliable and secure distributed programming. Springer Science & Business Media, Berlin, Heidelberg."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the 9th ACM Conference on Computer and Communications Security. ACM, Washington, DC USA, 88--97","author":"Cachin Christian","year":"2002","unstructured":"Christian Cachin, Klaus Kursawe, Anna Lysyanskaya, and Reto Strobl. 2002. Asynchronous verifiable secret sharing and proactive cryptosystems. In Proceedings of the 9th ACM Conference on Computer and Communications Security. ACM, Washington, DC USA, 88--97."},{"key":"e_1_3_2_1_15_1","volume-title":"Advances in Cryptology---CRYPTO 2001: 21st Annual International Cryptology Conference, August 19--23","author":"Cachin Christian","year":"2001","unstructured":"Christian Cachin, Klaus Kursawe, Frank Petzold, and Victor Shoup. 2001. Secure and efficient asynchronous broadcast protocols. In Advances in Cryptology---CRYPTO 2001: 21st Annual International Cryptology Conference, August 19--23, 2001 Proceedings. Springer, Santa Barbara, California, USA, 524--541."},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing. ACM, Portland Oregon USA, 123--132","author":"Cachin Christian","year":"2000","unstructured":"Christian Cachin, Klaus Kursawe, and Victor Shoup. 2000. Random oracles in constantipole: practical asynchronous byzantine agreement using cryptography. In Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing. ACM, Portland Oregon USA, 123--132."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/RELDIS.2005.9"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of the twenty-fifth annual ACM symposium on Theory of computing. ACM, San Diego California USA, 42--51","author":"Canetti Ran","year":"1993","unstructured":"Ran Canetti and Tal Rabin. 1993. Fast asynchronous Byzantine agreement with optimal resilience. In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing. ACM, San Diego California USA, 42--51."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/296806.296824"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538424"},{"key":"e_1_3_2_1_21_1","volume-title":"Public-Key Cryptography-PKC 2023: 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, May 7--10","author":"Catalano Dario","year":"2023","unstructured":"Dario Catalano, Dario Fiore, and Emanuele Giunta. 2023. Efficient and universally composable single secret leader election from pairings. In Public-Key Cryptography-PKC 2023: 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, May 7--10, 2023, Proceedings, Part I. Springer, Atlanta, GA, USA, 471--499."},{"key":"e_1_3_2_1_22_1","volume-title":"Mithril: Stake-based threshold multisignatures.","author":"Chaidos Pyrros","year":"2021","unstructured":"Pyrros Chaidos and Aggelos Kiayias. 2021. Mithril: Stake-based threshold multisignatures."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3492321.3519594"},{"key":"e_1_3_2_1_24_1","unstructured":"Sourav Das Philippe Camacho Zhuolun Xiang Javier Nieto Benedikt Bunz and Ling Ren. 2023. Threshold Signatures from Inner Product Argument: Succinct Weighted and Multi-threshold."},{"key":"e_1_3_2_1_25_1","unstructured":"Sourav Das Benny Pinkas Alin Tomescu and Zhuolun Xiang. 2024. Distributed Randomness using Weighted VRFs."},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. ACM, Virtual Event Republic of Korea, 2705--2721","author":"Das Sourav","year":"2021","unstructured":"Sourav Das, Zhuolun Xiang, and Ling Ren. 2021. Asynchronous data dissemination and its applications. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security. ACM, Virtual Event Republic of Korea, 2705--2721."},{"key":"e_1_3_2_1_27_1","volume-title":"2022 IEEE Symposium on Security and Privacy (SP). IEEE","author":"Das Sourav","year":"2022","unstructured":"Sourav Das, Thomas Yurek, Zhuolun Xiang, Andrew Miller, Lefteris Kokoris-Kogias, and Ling Ren. 2022. Practical asynchronous distributed key generation. In 2022 IEEE Symposium on Security and Privacy (SP). IEEE, San Francisco, CA, USA, 2518--2534."},{"key":"e_1_3_2_1_28_1","volume-title":"Advances in Cryptology---AUSCRYPT'92: Workshop on the Theory and Application of Cryptographic Techniques Gold Coast, December 13--16, 1992 Proceedings 3. Springer","author":"Desmedt Yvo","year":"1993","unstructured":"Yvo Desmedt. 1993. Threshold cryptosystems. In Advances in Cryptology---AUSCRYPT'92: Workshop on the Theory and Application of Cryptographic Techniques Gold Coast, December 13--16, 1992 Proceedings 3. Springer, Queensland, Australia, 1--14."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243812"},{"key":"e_1_3_2_1_30_1","unstructured":"Filfox. 2023. Filecoin stake distribution. https:\/\/filfox.info\/en\/ranks\/power. Accessed: 2023-03-28."},{"key":"e_1_3_2_1_31_1","unstructured":"Fish. 2023. Tezos stake distribution. https:\/\/tezos.fish\/leaderboard\/all. Accessed: 2023-03-28."},{"key":"e_1_3_2_1_32_1","unstructured":"Luciano Freitas Andrei Tonkikh Adda-Akram Bendoukha Sara Tucci-Piergiovanni Renaud Sirdey Oana Stan and Petr Kuznetsov. 2023. Homomorphic Sortition-Single Secret Leader Election for PoS Blockchains."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Sanjam Garg Abhishek Jain Pratyay Mukherjee Rohit Sinha Mingyuan Wang and Yinuo Zhang. 2022. Cryptography with Weights: MPC Encryption and Signatures.","DOI":"10.1007\/978-3-031-38557-5_10"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.021913.122427"},{"key":"e_1_3_2_1_35_1","volume-title":"Proceedings of the seventh ACM symposium on Operating systems principles. ACM, Pacific Grove California USA, 150--162","author":"Gifford David K","year":"1979","unstructured":"David K Gifford. 1979. Weighted voting for replicated data. In Proceedings of the seventh ACM symposium on Operating systems principles. ACM, Pacific Grove California USA, 150--162."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281100.1281122"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1002\/ecjc.4430720906"},{"key":"e_1_3_2_1_39_1","volume-title":"Peter MR Rasmussen, and Amit Sahai","author":"Jain Aayush","year":"2017","unstructured":"Aayush Jain, Peter MR Rasmussen, and Amit Sahai. 2017. Threshold fully homo-morphic encryption."},{"key":"e_1_3_2_1_40_1","volume-title":"On the complexity of decoding Reed-Solomon codes (Corresp.)","author":"Justesen J\u00f8rn","year":"1976","unstructured":"J\u00f8rn Justesen. 1976. On the complexity of decoding Reed-Solomon codes (Corresp.). IEEE transactions on information theory 22, 2 (1976), 237--238."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467905"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"H. Kellerer U. Pferschy and D. Pisinger. 2004. Knapsack Problems. Springer Berlin Germany.","DOI":"10.1007\/978-3-540-24777-7"},{"key":"e_1_3_2_1_44_1","volume-title":"The theory of error-correcting codes","author":"MacWilliams Florence Jessie","unstructured":"Florence Jessie MacWilliams and Neil James Alexander Sloane. 1977. The theory of error-correcting codes. Vol. 16. Elsevier, Philadelphia, PA, USA."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258650"},{"key":"e_1_3_2_1_46_1","volume-title":"ALGORAND: The Efficient and Democratic Ledger. arXiv:1607.01341 http:\/\/arxiv.org\/abs\/1607.01341","author":"Micali Silvio","year":"2016","unstructured":"Silvio Micali. 2016. ALGORAND: The Efficient and Democratic Ledger. arXiv:1607.01341 http:\/\/arxiv.org\/abs\/1607.01341"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795281232"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2020.28"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","unstructured":"Kamilla Nazirkhanova Joachim Neu and David Tse. 2021. Information dispersal with provable retrievability for rollups.","DOI":"10.1145\/3558535.3559778"},{"key":"e_1_3_2_1_51_1","first-page":"21","article-title":"Multi-signature schemes secure against active insider attacks","volume":"82","author":"Ohta Kazuo","year":"1999","unstructured":"Kazuo Ohta and Tatsuaki Okamoto. 1999. Multi-signature schemes secure against active insider attacks. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences 82, 1 (1999), 21--31.","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/62044.62050"},{"key":"e_1_3_2_1_54_1","volume-title":"Information Security and Privacy: 27th Australasian Conference, ACISP","author":"Raikwar Mayank","year":"2022","unstructured":"Mayank Raikwar and Danilo Gligoroski. 2022. SoK: Decentralized Randomness Beacon Protocols. In Information Security and Privacy: 27th Australasian Conference, ACISP 2022, November 28--30, 2022, Proceedings. Springer, Wollongong, NSW, Australia, 420--446."},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_56_1","volume-title":"Advances in Cryptology---EUROCRYPT 2000: International Conference on the Theory and Application of Cryptographic Techniques, May 14--18","author":"Shoup Victor","year":"2000","unstructured":"Victor Shoup. 2000. Practical threshold signatures. In Advances in Cryptology---EUROCRYPT 2000: International Conference on the Theory and Application of Cryptographic Techniques, May 14--18, 2000 Proceedings 19. Springer, Bruges, Belgium, 207--220."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559361"},{"key":"e_1_3_2_1_58_1","volume-title":"Proceedings of the 6th Australasian Conference on Information Security and Privacy (ACISP '01)","author":"Douglas","unstructured":"Douglas R. Stinson and Reto Strobl. 2001. Provably Secure Distributed Schnorr Signatures and a (t, n) Threshold Scheme for Implicit Certificates. In Proceedings of the 6th Australasian Conference on Information Security and Privacy (ACISP '01). Springer-Verlag, Berlin, Heidelberg, 417--434."},{"key":"e_1_3_2_1_59_1","unstructured":"Andrei Tonkikh and Luciano Freitas. 2023. Swiper: a new paradigm for efficient weighted distributed protocols. Cryptology ePrint Archive Paper 2023\/1164. https:\/\/eprint.iacr.org\/2023\/1164 Full version of this paper. https:\/\/eprint.iacr.org\/2023\/1164."},{"key":"e_1_3_2_1_60_1","volume-title":"DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks. In 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22)","author":"Yang Lei","year":"2022","unstructured":"Lei Yang, Seo Jin Park, Mohammad Alizadeh, Sreeram Kannan, and David Tse. 2022. DispersedLedger: High-Throughput Byzantine Consensus on Variable Bandwidth Networks. In 19th USENIX Symposium on Networked Systems Design and Implementation (NSDI 22). USENIX, Renton, WA, USA, 493--512."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331591"}],"event":{"name":"PODC '24: 43rd ACM Symposium on Principles of Distributed Computing","location":"Nantes France","acronym":"PODC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662799","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:41Z","timestamp":1750290221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662799"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":58,"alternative-id":["10.1145\/3662158.3662799","10.1145\/3662158"],"URL":"https:\/\/doi.org\/10.1145\/3662158.3662799","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}