Blockchain Security when Messages are Lost

Taha Ameen, Suryanarayana Sankagiri, B. Hajek
{"title":"Blockchain Security when Messages are Lost","authors":"Taha Ameen, Suryanarayana Sankagiri, B. Hajek","doi":"10.1145/3560829.3563557","DOIUrl":null,"url":null,"abstract":"Security analyses for consensus protocols in blockchain research have primarily focused on the synchronous model, where point-to-point communication delays are upper bounded by a known finite constant. These models are unrealistic in noisy settings, where messages may be lost (i.e. incur infinite delay). In this work, we study the impact of message losses on the security of the proof-of-work longest-chain protocol. We introduce a new communication model to capture the impact of message loss called the 0-∞ model, and derive a region of tolerable adversarial power under which the consensus protocol is secure. The guarantees are derived as a simple bound for the probability that a transaction violates desired security properties. Specifically, we show that this violation probability decays almost exponentially in the security parameter. Our approach involves constructing combinatorial objects from blocktrees, and identifying random variables associated with them that are amenable to analysis. This approach improves existing bounds and extends the known regime for tolerable adversarial threshold in settings where messages may be lost.","PeriodicalId":182280,"journal":{"name":"Proceedings of the 2022 ACM Workshop on Developments in Consensus","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2022 ACM Workshop on Developments in Consensus","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3560829.3563557","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Security analyses for consensus protocols in blockchain research have primarily focused on the synchronous model, where point-to-point communication delays are upper bounded by a known finite constant. These models are unrealistic in noisy settings, where messages may be lost (i.e. incur infinite delay). In this work, we study the impact of message losses on the security of the proof-of-work longest-chain protocol. We introduce a new communication model to capture the impact of message loss called the 0-∞ model, and derive a region of tolerable adversarial power under which the consensus protocol is secure. The guarantees are derived as a simple bound for the probability that a transaction violates desired security properties. Specifically, we show that this violation probability decays almost exponentially in the security parameter. Our approach involves constructing combinatorial objects from blocktrees, and identifying random variables associated with them that are amenable to analysis. This approach improves existing bounds and extends the known regime for tolerable adversarial threshold in settings where messages may be lost.
消息丢失时的区块链安全性
区块链研究中共识协议的安全性分析主要集中在同步模型上,其中点对点通信延迟的上限是已知的有限常数。这些模型在嘈杂的环境中是不现实的,在嘈杂的环境中消息可能会丢失(即导致无限延迟)。在这项工作中,我们研究了消息丢失对工作量证明最长链协议安全性的影响。我们引入了一种新的通信模型来捕捉消息丢失的影响,称为0-∞模型,并推导了一个可容忍对抗能力的区域,在该区域下共识协议是安全的。保证是作为事务违反所需安全属性的概率的简单界限派生出来的。具体来说,我们证明了这种违反概率在安全参数中几乎呈指数衰减。我们的方法包括从块树中构造组合对象,并识别与它们相关的随机变量,这些变量可以进行分析。这种方法改进了现有的边界,并在消息可能丢失的设置中扩展了可容忍的对抗性阈值的已知机制。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信