Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Image from Google Jackets

Secure off-chain transactions in blockchain-based payment channel networks/ Subhra Mazumdar

By: Material type: TextTextPublication details: Kolkata: Indian Statistical Institute, 2022Description: 187 pagesSubject(s): DDC classification:
  • 23 332.1780285582 M475
Online resources:
Contents:
Introduction -- Preliminaries and Background -- Literature Survey -- HushRelay: A Scalable Routing Algorithm for Off-Chain Payments -- CryptoMaze: Privacy-Preserving Splitting of Off-Chain Payments -- Griefing-penalty: Countermeasure for Griefing Attack in Lightning Network -- Strategic Analysis of Griefing Attack in Lightning Network
Production credits:
  • Guided by Prof. Sushmita Ruj and Prof. Bimal Kumar Roy
Dissertation note: Thesis (Ph. D.) - Indian Statistical Insitute, 2022 Summary: Cryptocurrencies enable users to execute a financial transaction without relying on any third party. The use of Blockchain technology guarantees the security and immutability of transactions. Despite these features, blockchain-based financial transactions fail to compete with conventional payment systems like Visa, and PayPal, in terms of scalability. Layer 2 protocols built on top of blockchain solve the scaling difficulties that are faced by the major cryptocurrency networks. Payment Channel Network or PCN is one of the most widely deployed layer 2 protocols. Users are allowed to execute off-chain payments, leading to high throughput. PCN relies on the underlying blockchain for security. After studying the literature, we observed that routing and payment in PCN are the two most challenging tasks. The network is susceptible to attacks where malicious players can intentionally stall payments and eliminate their competitors from the network. In this thesis, we propose an efficient privacy-preserving distributed routing algorithm HushRelay. Experimental analysis shows that our proposed routing algorithm has a higher success ratio and lower execution time compared to the state-of-the-art. Given a set of routes, we propose an atomic and privacy-preserving multi-path payment protocol, CryptoMaze. No honest intermediary loses funds in the process, ensuring balance security. We observe that CryptoMaze is quite efficient and the communication overhead is within feasible bounds. We discuss the griefing attack, a major vulnerability in Bitcoin’s PCN, and propose an efficient countermeasure for the attack, termed Griefing-Penalty. The penalty charged compensates parties who incurred loss by locking funds. We propose a new payment protocol HTLC-GP or Hashed Timelock Contract with Griefing-Penalty that demonstrates the utility of the countermeasure. Finally, we have analyzed griefing attacks in the network from a game-theoretic point of view and observed that HTLC-GP is weakly effective in disincentivizing the attacker in certain conditions. To further increase the cost of attack, we introduce the concept of guaranteed minimum compensation and integrate it into HTLC-GP. This modified payment protocol, HTLC-GP⇣ , considers the participants to act rationally. By experimenting on several real instances of PCN, we observed that HTLC-GP⇣ is better than HTLC-GP to counter griefing attacks.
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Call number Status Notes Date due Barcode Item holds
THESIS ISI Library, Kolkata 332.1780285582 M475 (Browse shelf(Opens below)) Available E-Thesis. Guided by Prof. Sushmita Ruj and Bimal Kumar Roy TH564
Total holds: 0

Thesis (Ph. D.) - Indian Statistical Insitute, 2022

Includes bibliography

Introduction -- Preliminaries and Background -- Literature Survey -- HushRelay: A Scalable Routing Algorithm for Off-Chain Payments -- CryptoMaze: Privacy-Preserving Splitting of Off-Chain Payments -- Griefing-penalty: Countermeasure for Griefing Attack in Lightning Network -- Strategic Analysis of Griefing Attack in Lightning Network

Guided by Prof. Sushmita Ruj and Prof. Bimal Kumar Roy

Cryptocurrencies enable users to execute a financial transaction without relying on any third party. The use of Blockchain technology guarantees the security and immutability of transactions. Despite these features, blockchain-based financial transactions fail to compete with conventional payment systems like Visa, and PayPal, in terms of scalability. Layer 2 protocols built on top of blockchain solve the scaling difficulties that are faced by the major cryptocurrency networks. Payment Channel Network or PCN is one of the most widely deployed layer 2 protocols. Users are allowed to execute off-chain payments, leading to high throughput. PCN relies on the underlying blockchain for security. After studying the literature, we observed that routing and payment in PCN are the two most challenging tasks. The network is susceptible to attacks where malicious players can intentionally stall payments and eliminate their competitors from the network.

In this thesis, we propose an efficient privacy-preserving distributed routing algorithm HushRelay. Experimental analysis shows that our proposed routing algorithm has a higher success ratio and lower execution time compared to the state-of-the-art. Given a set of routes, we propose an atomic and privacy-preserving multi-path payment protocol, CryptoMaze. No honest intermediary
loses funds in the process, ensuring balance security. We observe that CryptoMaze is quite efficient and the communication overhead is within feasible bounds. We discuss the griefing attack, a major vulnerability in Bitcoin’s PCN, and propose an efficient countermeasure for the attack, termed Griefing-Penalty. The penalty charged compensates parties who incurred loss by locking
funds. We propose a new payment protocol HTLC-GP or Hashed Timelock Contract with Griefing-Penalty that demonstrates the utility of the countermeasure. Finally, we have analyzed griefing attacks in the network from a game-theoretic point of view and observed that HTLC-GP is weakly effective in disincentivizing the attacker in certain conditions. To further increase the cost of attack, we introduce the concept of guaranteed minimum compensation and integrate it into HTLC-GP. This modified payment protocol, HTLC-GP⇣ , considers the participants to act rationally. By experimenting on several real instances of PCN, we observed that HTLC-GP⇣ is better than HTLC-GP to counter griefing attacks.

There are no comments on this title.

to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in