Sleepy Consensus 中的完全波动参与
Fully-Fluctuating Participation in Sleepy Consensus
AI总结：
提出 external adversary 对手模型，证明 sleepy model 中的协议在完全波动参与下仍保持安全，且不牺牲效率或抗腐败能力，同时绕过了近期工作中的理论障碍。
摘要：
工作量证明使得 Bitcoin 能够在矿工参与度随时间任意波动的情况下保持安全性，只要在任意时刻多数算力是诚实的。然而近年来，天平已转向基于权益证明的共识协议。其中，sleepy model 是处理节点参与度波动的最突出模型。但迄今为止，sleepy model 中尚无协议能在应对参与度剧烈波动的鲁棒性上与 Bitcoin 媲美，现有最先进的协议均做出了各种限制性假设。在本研究中，我们提出了一种名为 external adversary 的新对手模型。直观地说，在我们的模型中，腐败节点不会泄露其私钥信息。在此模型下，我们证明了 sleepy model 中的协议可以有意义地声称在面对完全波动的参与度时仍保持安全，且不牺牲效率或抗腐败能力。我们的对手模型非常自然，可以说自然地捕捉了协议中恶意行为的产生过程，这与传统的最坏情况建模形成对比。此外，该模型在理论上也颇具吸引力，绕过了 Malkhi、Momose 和 Ren 最近一项工作中建立的障碍。
英文摘要：
Proof-of-work allows Bitcoin to boast security amidst arbitrary fluctuations in participation of miners throughout time, so long as, at any point in time, a majority of hash power is honest. In recent years, however, the pendulum has shifted in favor of proof-of-stake-based consensus protocols. There, the sleepy model is the most prominent model for handling fluctuating participation of nodes. However, to date, no protocol in the sleepy model rivals Bitcoin in its robustness to drastic fluctuations in participation levels, with state-of-the-art protocols making various restrictive assumptions. In this work, we present a new adversary model, called external adversary. Intuitively, in our model, corrupt nodes do not divulge information about their secret keys. In this model, we show that protocols in the sleepy model can meaningfully claim to remain secure against fully fluctuating participation, without compromising efficiency or corruption resilience. Our adversary model is quite natural, and arguably naturally captures the process via which malicious behavior arises in protocols, as opposed to traditional worst-case modeling. On top of which, the model is also theoretically appealing, circumventing a barrier established in a recent work of Malkhi, Momose, and Ren.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
