Everything is a Race and Nakamoto Always Wins
Everything is a Race and Nakamoto Always Wins
复制标题
一切都是一场竞赛，中本聪总是获胜
DOI：
10.1145/3372297.3417290
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Zeitouni, Ofer
中科院分区：
文献类型：
--
作者：
Dembo, Amir;Kannan, Sreeram;Tas, Ertem Nusret;Tse, David;Viswanath, Pramod;Wang, Xuechao;Zeitouni, Ofer
中本聪发明了最长链协议，并通过分析私人双花攻击（对手与诚实节点之间争夺更长链的竞赛）来声称其安全性。但这是最严重的攻击吗？对于针对不同共识模型设计的三类最长链协议，我们对这个问题的回答是肯定的：1）中本聪最初的工作量证明协议； 2) Ouroboros 和 SnowWhite 权益证明协议； 3) Chia 空间证明协议。因此，每个协议的最大可容忍对手功率的精确表征是通过网络延迟归一化的平均块时间的函数。这些协议的安全分析是通过一种新颖的方法以统一的方式执行的，该方法将所有攻击减少为对手和诚实节点之间的竞争。
Nakamoto invented the longest chain protocol, and claimed its security by analyzing the private double-spend attack, a race between the adversary and the honest nodes to grow a longer chain. But is it the worst attack? We answer the question in the affirmative for three classes of longest chain protocols, designed for different consensus models: 1) Nakamoto's original Proof-of-Work protocol; 2) Ouroboros and SnowWhite Proof-of-Stake protocols; 3) Chia Proof-of-Space protocol. As a consequence, exact characterization of the maximum tolerable adversary power is obtained for each protocol as a function of the average block time normalized by the network delay. The security analysis of these protocols is performed in a unified manner by a novel method of reducing all attacks to a race between the adversary and the honest nodes.
权益证明区块链与并发诚实老虎机领导者的一致性
DOI：
10.1109/icdcs47774.2020.00065
发表时间：
2020
期刊：
2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS
影响因子：
--
作者：
Kiayias, Aggelos;Quader, Saad;Russell, Alexander
通讯作者：
Russell, Alexander
DOI：
10.1145/3560829.3563559
发表时间：
2019-10
期刊：
Proceedings of the 2022 ACM Workshop on Developments in Consensus
影响因子：
--
作者：
V. Bagaria;A. Dembo;Sreeram Kannan;Sewoong Oh;David Tse;P. Viswanath;Xuechao Wang;O. Zeitouni
通讯作者：
V. Bagaria;A. Dembo;Sreeram Kannan;Sewoong Oh;David Tse;P. Viswanath;Xuechao Wang;O. Zeitouni
增加树木的高度
影响因子：
0.5
作者：
M. Drmota
通讯作者：
M. Drmota