论文标题

同态分类 - POS区块链的秘密负责人选举

Homomorphic Sortition -- Secret Leader Election for PoS Blockchains

论文作者

Freitas, Luciano, Tonkikh, Andrei, Bendoukha, Adda-Akram, Tucci-Piergiovanni, Sara, Sirdey, Renaud, Stan, Oana, Kuznetsov, Petr

论文摘要

在单个秘密领导者选举方案(SSLE)中,选择了其中一个参与者,除非它决定揭示自己,否则没有其他参与者可以识别它。 SSLE具有保护区块链共识方案免受拒绝服务(DOS)攻击的巨大潜力。但是,所有现有的解决方案要么做出强大的同步假设,要么有到期注册,这意味着他们需要当选的流程才能重新注册自己,然后才能再次当选。反过来,这禁止使用这些SSLE协议在部分同步共识方案中选举领导者,因为当没有决定新的块时,网络不稳定性可能会存在很长时间,因此,没有新的注册(或重新注册)。在本文中,我们提出了同态分类,这是第一个具有非验证注册的异步SSLE协议,使其成为与部分基于基于领导者的共识协议兼容的第一个解决方案。 同态分类依赖于完全同态加密(THFHE)的阈值,并根据先前的提案进行了一些重要的优化,并针对有验证的(POS)区块链量身定制。特别是,与大多数现有的SSLE协议不同,它可以与任意股权分布一起使用,并且不需要多次注册多个硬币的用户。我们的协议是高度可行的,可以在设置后完全脱链运行。 一些区块链需要一系列巡回赛才能具有不重复的领导者。我们定义了SSLE的概括,称为Secret Leader置换(SLP),其中应用程序可以选择应以一系列弹性输出多少不重复的领导者,我们显示同态分类如何也解决了这个问题。

In a single secret leader election protocol (SSLE), one of the system participants is chosen and, unless it decides to reveal itself, no other participant can identify it. SSLE has a great potential in protecting blockchain consensus protocols against denial of service (DoS) attacks. However, all existing solutions either make strong synchrony assumptions or have expiring registration, meaning that they require elected processes to re-register themselves before they can be re-elected again. This, in turn, prohibits the use of these SSLE protocols to elect leaders in partially-synchronous consensus protocols as there may be long periods of network instability when no new blocks are decided and, thus, no new registrations (or re-registrations) are possible. In this paper, we propose Homomorphic Sortition -- the first asynchronous SSLE protocol with non-expiring registration, making it the first solution compatible with partially-synchronous leader-based consensus protocols. Homomorphic Sortition relies on Threshold Fully Homomorphic Encryption (ThFHE) and is tailored to proof-of-stake (PoS) blockchains, with several important optimizations with respect to prior proposals. In particular, unlike most existing SSLE protocols, it works with arbitrary stake distributions and does not require a user with multiple coins to be registered multiple times. Our protocol is highly parallelizable and can be run completely off-chain after setup. Some blockchains require a sequence of rounds to have non-repeating leaders. We define a generalization of SSLE, called Secret Leader Permutation (SLP) in which the application can choose how many non-repeating leaders should be output in a sequence of rounds and we show how Homomorphic Sortition also solves this problem.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源