4.5 Article

n-HTLC: Neo hashed time-Lock commitment to defend against wormhole attack in payment channel networks

期刊

COMPUTERS & SECURITY
卷 106, 期 -, 页码 -

出版社

ELSEVIER ADVANCED TECHNOLOGY
DOI: 10.1016/j.cose.2021.102291

关键词

Blockchain; Payment channel network (PCN); Security; Privacy; Anonymity; Hashed time-lock contract (HTLC); Wormhole attack

资金

  1. Ministry of Human Resource Development, Government of India

向作者/读者索取更多资源

This work introduces a secure and privacy-preserving payment channel network protocol named n-HTLC, which allows payments without sending any information to intermediate users and proposes the kTLC protocol, compatible with the Sphinx onion packet format. Experimental results demonstrate that both n-HTLC and kTLC outperform other off-chain payment protocols in terms of computational and communication overhead.
In today's cryptocurrency, the Payment Channel Network (PCN) is noticed as one of the most gifted off-chain solutions for scalability issues. Besides this, it consumes lesser transaction fees and low transaction confirmation time. However, security and privacy issues need to be addressed appropriately to make the solution even more effective. Most of the existing HTLC (Hashed Time-Lock Contract) protocols revealed the sender's information to the intermediate users in the payment route. In this work, we propose an effective secure and privacy-preserving Payment Channel Network protocol, named Neo Hashed Time-Lock Commitment (n-HTLC) protocol. (n-HTLC) does not require the sender to send any information to each intermediate user along the payment route, thus preserves the identity of the sender. But, (n-HTLC) is not compatible with Sphinx onion packet format. Therefore, a symmetric key encryption-based protocol called kTLC has been proposed. kTLC is compatible with the Sphinx onion packet format, which is used in the current Lightning network atop of the Bitcoin blockchain network. The security of both n-HTLC and kTLC are proved using the Universal Composability (UC) framework. It is observed that both ensure that no attacker can extract information on the payment route if at least one of the users in the path is honest. To analyze the performance of both n-HTLC and kTLC payment protocol, we conduct experiments using the snapshots of Ripple network(1), Lightning network(2), and synthetic network of Mazumdar and Ruj (2020). Our experimental results show that both n-HTLC and kTLC outperform state-of-the-art off-chain payment protocols in terms of computational and communication overhead. (C) 2021 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据