Mobius: Enabling Byzantine-Resilient Single Secret Leader Election with Uniquely Verifiable State
Hanyue Dou, Peifang Ni, Yingzi Gao, Jing Xu
Abstract
Single Secret Leader Election (SSLE) protocol facilitates the election of a single leader per round among a group of registered nodes while ensuring unpredictability. Ethereum has identified SSLE as an essential component in its development roadmap and has adopted it as a potential solution to counteract potential attacks. However, we identify a new form of attack termed the textitstate uniqueness attack that is caused by malicious leaders proposing multiple publicly verifiable states. This attack undermines the property of textituniqueness in subsequent leader elections and, with high probability, leads to violations of fundamental security properties of the over-layer protocol such as liveness. The vulnerability stems inherently from the designs reducing the uniqueness guarantee to a unique state per election, and can be generalized to the existing SSLE constructions. We further quantify the severity of this attack based on theoretical analysis and real-world executions on Ethereum, highlighting the critical challenges in designing provably secure SSLE protocols. To address the textitstate uniqueness attack while ensuring both security and practical performance, we present a universal SSLE protocol called Mobius that does not rely on extra trust assumptions. Specifically, Mobius prevents the generation of multiple verifiable states for each election and achieves a unique state across consecutive executions through an innovative textitapproximately-unique randomization mechanism. In addition to providing a comprehensive security analysis in the Universal Composability framework, we develop a proof-of-concept implementation of Mobius, and conduct extensive experiments to evaluate the security and overhead. The experimental results show that Mobius exhibits enhanced security while significantly reducing communication complexity throughout the protocol execution, achieving over 80% reduction in the registration phase.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers1
Ask how each one uses itBuilds on5
- The Honey Badger of BFT ProtocolsAndrew Miller, Yu Xia, Kyle Croman, Elaine Shi et al.CCS 2016 · 974 citations
- Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic AvailabilityChristian Badertscher, Peter Gazi, Aggelos Kiayias, Alexander Russell et al.CCS 2018 · 306 citations
- Sync HotStuff: Simple and Practical Synchronous State Machine ReplicationIttai Abraham, Dahlia Malkhi, Kartik Nayak, Ling Ren et al.S&P 2020 · 240 citations
- Ebb-and-Flow Protocols: A Resolution of the Availability-Finality DilemmaJoachim Neu, Ertem Nusret Tas, David TseS&P 2021 · 105 citations
- Everything is a Race and Nakamoto Always WinsAmir Dembo, Sreeram Kannan, Ertem Nusret Tas, David Tse et al.CCS 2020 · 3 citations
Related papers
- Beyond Anonymity Sets: A Security Model for Distributed Shuffling in Adversarial EnvironmentsAdrian Cinal, Oliwer Sobolewski, Gabriel Wechta, Filip ZagórskiCCS 2026
- Qelect: Lattice-based Single Secret Leader Election Made PracticalYunhao Wang, Fan ZhangUSENIX Security 2025
- A Liveness Attack to Ethereum PoS with No Additional CostMingfei Zhang, Rujia Li, Xueqian Lu, Sisi DuanS&P 2026 · 2 citations
- Eclipse Attacks on Ethereum's Peer-to-Peer NetworkRuisheng Shi, Yuxuan Liang, Zijun Guo, Qin Wang et al.WWW 2026
- Quantitative Runtime Monitoring of Ethereum Transaction AttacksXinyao Xu, Ziyu Mao, Jianzhong Su, Xingwei Lin et al.WWW 2025 · 1 citation
