当前位置: X-MOL 学术J. Parallel Distrib. Comput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Resisting newborn attacks via shared Proof-of-Space
Journal of Parallel and Distributed Computing ( IF 3.4 ) Pub Date : 2021-01-06 , DOI: 10.1016/j.jpdc.2020.12.011
Shuyang Tang , Jilai Zheng , Yao Deng , Qinxiang Cao

In the cryptocurrency literature, Proof-of-Space has been a potential alternative for permissionless distributed consensus protocols not only due to its recyclable nature but also the potential to support multiple chains simultaneously. Namely, the same storage resource can be contributed to the consensus of more than one chain. However, a direct shared proof of the same storage brings about newborn attacks on new chain launching since holders of a substantial amount of resources can easily devastate a new chain with minor underlying storage at almost no cost, deviating from the decentralized principle of cryptocurrencies. To fix this gap, we propose an innovative framework of single-chain Proof-of-Space and further present a novel multi-chain scheme which resists newborn attacks effectively by elaborately combining shared proof and chain-specific proof of storage. Our framework covers both classical Nakamoto consensus (with one leader per round) and hybrid consensus (with multiple leaders per round). Specific protocols for both cases are presented. A committee-based consensus is leveraged to realize the multiple leader case. We show that both consensus schemes have realized our desired functionality without compromising consistency or liveness.



中文翻译:

通过共享的空间证明抵抗新生攻击

在加密货币文献中,空间证明已成为无许可分布式共识协议的潜在替代方案,这不仅是因为其具有可回收性,而且还具有同时支持多条链的潜力。即,相同的存储资源可以促成一个以上链的共识。但是,对相同存储的直接共享证明会导致对新链的启动产生新的攻击,因为拥有大量资源的人可以轻易地以几乎没有任何成本的基础存储来破坏一条新链,这与加密货币的分散化原理有所不同。为了弥补这一差距,我们提出了一种创新的单链空间证明框架,并进一步提出了一种新颖的多链计划,该计划通过精心组合共享证据和特定于链的存储证据来有效抵御新生代攻击。我们的框架涵盖了经典的中本聪共识(每轮有一位领导者)和混合共识(每轮有多位领导者)。给出了两种情况的特定协议。利用基于委员会的共识来实现多头案例。我们表明,这两种共识方案都实现了我们所需的功能,而没有损害一致性或活跃性。利用基于委员会的共识来实现多头案例。我们表明,这两种共识方案都实现了我们所需的功能,而没有损害一致性或活跃性。利用基于委员会的共识来实现多头案例。我们表明,这两种共识方案都实现了我们所需的功能,而没有损害一致性或活跃性。

更新日期:2021-01-18
down
wechat
bug