Scalable and Adaptively Secure Any-Trust Distributed Key Generation and All-hands Checkpointing
Hanwen Feng, Tiancheng Mai, Qiang Tang
摘要
The classical distributed key generation protocols (DKG) are resurging due to their widespread applications in blockchain. While efforts have been made to improve DKG communication, practical largescale deployments are still yet to come due to various challenges, including the heavy computation and communication (particularly broadcast) overhead in their adversarial cases. In this paper, we propose a practical DKG for DLog-based cryptosystems, which achieves (quasi-)linear computation and communication per-node cost with the help of a common coin, even in the face of the maximal amount of Byzantine nodes. Moreover, our protocol is secure against adaptive adversaries, which can corrupt less than half of all nodes. The key to our improvements lies in delegating the most costly operations to an Any-Trust group together with a set of techniques for adaptive security. This group is randomly sampled and consists of a small number of individuals. The population only trusts that at least one member in the group is honest, without knowing which one. Moreover, we present a generic transformer that enables us to efficiently deploy a conventional distributed protocol like our DKG, even when the participants have different weights. Additionally, we introduce an extended broadcast channel based on a blockchain and data dispersal network (such as IPFS), enabling reliable broadcasting of arbitrary-size messages at the cost of constant-size blockchain storage. Our DKG leads to a fully practical instantiation of Filecoin's checkpointing mechanism, in which all validators of a Proof-of-Stake (PoS) blockchain periodically run DKG and threshold signing to create checkpoints on Bitcoin, to enhance the security of the PoS chain. In comparison with the recent checkpointing approach of Babylon (Oakland, 2023), ours enjoys a significantly smaller cost of Bitcoin transaction fees. For 2 12 validators, our cost is merely 0.4% of that incurred by Babylon's approach.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- SoK: Dlog-Based Distributed Key GenerationRenas Bacho, Alireza KavousiS&P 2025
- Anchor-DKG: Distributed Key Generation with Repeating PartiesHanwen Feng, Qiang Tang, Sri AravindaKrishnan ThyagarajanCCS 2026
它引用的顶会 Paper19
- The Honey Badger of BFT ProtocolsAndrew Miller, Yu Xia, Kyle Croman, Elaine Shi 等CCS 2016 · 被引用 974 次
- Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic AvailabilityChristian Badertscher, Peter Gazi, Aggelos Kiayias, Alexander Russell 等CCS 2018 · 被引用 306 次
- Design and evaluation of IPFS: a storage layer for the decentralized webDennis Trautwein, Aravindh Raman, Gareth Tyson, Ignacio Castro 等SIGCOMM 2022 · 被引用 188 次
- Practical Asynchronous Distributed Key GenerationSourav Das, Thomas Yurek, Zhuolun Xiang, Andrew Miller 等S&P 2022 · 被引用 136 次
- Towards Scalable Threshold CryptosystemsAlin Tomescu, Robert Chen, Yiming Zheng, Ittai Abraham 等S&P 2020 · 被引用 102 次
相关 Paper
- Practical Asynchronous High-threshold Distributed Key Generation and Distributed Polynomial SamplingSourav Das, Zhuolun Xiang, Lefteris Kokoris-Kogias, Ling RenUSENIX Security 2023
- Bitcoin-Enhanced Proof-of-Stake Security: Possibilities and ImpossibilitiesErtem Nusret Tas, David Tse, Fangyu Gai, Sreeram Kannan 等S&P 2023
- GRandLine: Adaptively Secure DKG and Randomness Beacon with (Log-)Quadratic Communication ComplexityRenas Bacho, Christoph Lenzen, Julian Loss, Simon Ochsenreither 等CCS 2024 · 被引用 7 次
- Gossiping for Communication-Efficient BroadcastGeorgios Tsimos, Julian Loss, Charalampos PapamanthouCRYPTO 2022 · 被引用 21 次
- Asymptotically Optimal Message Dissemination with Applications to BlockchainsChen-Da Liu-Zhang, Christian Matt, Søren Eller ThomsenEUROCRYPT 2024 · 被引用 9 次
