Concurrency and Privacy with Payment-Channel Networks

计算机科学 计算机安全 付款 并发 协议(科学) 计算机网络 分布式计算 医学 万维网 病理 替代医学
作者
Giulio Malavolta,Pedro Moreno-Sánchez,Aniket Kate,Matteo Maffei,Srivatsan Ravi
标识
DOI:10.1145/3133956.3134096
摘要

Permissionless blockchains protocols such as Bitcoin are inherently limited in transaction throughput and latency. Current efforts to address this key issue focus on off-chain payment channels that can be combined in a Payment-Channel Network (PCN) to enable an unlimited number of payments without requiring to access the blockchain other than to register the initial and final capacity of each channel. While this approach paves the way for low latency and high throughput of payments, its deployment in practice raises several privacy concerns as well as technical challenges related to the inherently concurrent nature of payments that have not been sufficiently studied so far. In this work, we lay the foundations for privacy and concurrency in PCNs, presenting a formal definition in the Universal Composability framework as well as practical and provably secure solutions. In particular, we present Fulgor and Rayo. Fulgor is the first payment protocol for PCNs that provides provable privacy guarantees for PCNs and is fully compatible with the Bitcoin scripting system. However, Fulgor is a blocking protocol and therefore prone to deadlocks of concurrent payments as in currently available PCNs. Instead, Rayo is the first protocol for PCNs that enforces non-blocking progress (i.e., at least one of the concurrent payments terminates). We show through a new impossibility result that non-blocking progress necessarily comes at the cost of weaker privacy. At the core of Fulgor and Rayo is Multi-Hop HTLC, a new smart contract, compatible with the Bitcoin scripting system, that provides conditional payments while reducing running time and communication overhead with respect to previous approaches. Our performance evaluation of Fulgor and Rayo shows that a payment with 10 intermediate users takes as few as 5 seconds, thereby demonstrating their feasibility to be deployed in practice.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Lucky完成签到,获得积分10
刚刚
xiaoxiao完成签到,获得积分10
刚刚
sn完成签到 ,获得积分10
1秒前
1秒前
虚幻问枫发布了新的文献求助20
1秒前
1秒前
SanXing三醒完成签到,获得积分10
2秒前
研友_pLw3vL完成签到,获得积分10
2秒前
4秒前
4秒前
5秒前
丁丁丁尼美完成签到,获得积分10
6秒前
sn关注了科研通微信公众号
6秒前
qise完成签到,获得积分20
6秒前
6秒前
7秒前
今夕何夕完成签到,获得积分10
7秒前
命运的X号发布了新的文献求助10
7秒前
7秒前
NCU-Xzzzz完成签到,获得积分10
9秒前
热闹的冬天完成签到,获得积分10
9秒前
9秒前
10秒前
王悦靓发布了新的文献求助10
11秒前
Wang发布了新的文献求助10
12秒前
酷炫熊猫发布了新的文献求助10
12秒前
13秒前
彭于晏应助xrhk采纳,获得10
13秒前
13秒前
imemorizedpi发布了新的文献求助10
13秒前
14秒前
16秒前
北斗发布了新的文献求助10
16秒前
哈哈发布了新的文献求助10
17秒前
LY完成签到,获得积分10
18秒前
19秒前
19秒前
芊芊君子完成签到,获得积分10
21秒前
CipherSage应助PolarisRan采纳,获得10
22秒前
科烟生完成签到,获得积分10
22秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Principles of town planning: translating concepts to applications 1000
2016 Venous Blood Study (VBS) (Final V3.0) 510
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
The Effective Clinical Neurologist 3ed 500
The Great Hymn to Šamaš 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7702027
求助须知:如何正确求助?哪些是违规求助? 9260794
关于积分的说明 20028217
捐赠科研通 7277747
什么是DOI,文献DOI怎么找? 3294115
关于科研通互助平台的介绍 2449576
邀请新用户注册赠送积分活动 2300729