The Longest-Chain Protocol Under Random Delays
The Longest-Chain Protocol Under Random Delays
复制标题
随机延迟下的最长链协议
作者：
Suryanarayana Sankagiri;Shreyas Gandlur;B. Hajek
在分布式共识和区块链领域，同步通信模型假设诚实各方之间的所有消息都被延迟了最多一个已知的常数Δ。最近的文献表明，最长链的区块链协议在同步通信下是安全的。然而，这些安全保证随着Δ而降低。在现实世界的网络中，通信延迟有时可能远远超过其典型值。在这种情况下，基于同步模型的安全保证可能过于悲观，因为它们是基于最坏情况的延迟。本文在一个新的网络模型下分析了最长链协议，该模型假设通信延迟是随机的、独立的和同分布的。该模型允许无限支持的延迟分布。本文的主要结果是最长链协议在该模型下运行的安全保证。我们的安全结果取决于延迟超过块间时间段的概率，而不是最坏情况下的延迟。我们提供了简单的，明确的安全违反概率的安全参数呈指数衰减的界限。在网络条件下，延迟是偶发性的大，我们的研究结果可以提供更好的安全保证比以前的工作。资金：这项工作得到了NSF的部分支持[Grant CCF 19-00636]。
In the field of distributed consensus and blockchains, the synchronous communication model assumes that all messages between honest parties are delayed by at most a known constant Δ. Recent literature establishes that the longest-chain blockchain protocol is secure under synchronous communication. However, these security guarantees degrade with Δ. In real-world networks, communication delays may occasionally be far more than their typical value. In such a scenario, the security guarantees based on the synchronous model may be overly pessimistic, because they are based on the worst-case delay. This work analyzes the longest-chain protocol under a new network model that assumes the communication delays are random, independent, and identically distributed. The model allows for delay distributions with unbounded support. The main result of this paper is a security guarantee for the longest-chain protocol operating under this model. Our security results depend on the probability that delays exceed the interblock time period, rather than on the worst-case delay. We provide simple, explicit bounds on the security-violation probability that decays exponentially with the security parameter. Under network conditions where delays are sporadically large, our results can provide better security guarantees than prior work. Funding: This work was supported in part by NSF [Grant CCF 19-00636].
一切都是一场竞赛，中本聪总是获胜
DOI：
10.1145/3372297.3417290
发表时间：
2020
期刊：
CCS '20: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security
影响因子：
--
作者：
Dembo, Amir;Kannan, Sreeram;Tas, Ertem Nusret;Tse, David;Viswanath, Pramod;Wang, Xuechao;Zeitouni, Ofer
通讯作者：
Zeitouni, Ofer
DOI：
10.1145/3323679.3326533
发表时间：
2019-07
期刊：
Proceedings of the Twentieth ACM International Symposium on Mobile Ad Hoc Networking and Computing
影响因子：
--
作者：
G. Fanti;Jiantao Jiao;Ashok Vardhan Makkuva;Sewoong Oh;Ranvir Rana;P. Viswanath
通讯作者：
G. Fanti;Jiantao Jiao;Ashok Vardhan Makkuva;Sewoong Oh;Ranvir Rana;P. Viswanath
最长链规则的组合：权益证明区块链的线性一致性
DOI：
10.1137/1.9781611975994.69
发表时间：
2020
期刊：
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms
影响因子：
--
作者：
Blum, Erica;Kiayias, Aggelos;Moore, Cristopher;Quader, Saad;Russell, Alexander
通讯作者：
Russell, Alexander