Advances in efficiency and privacy in payment channel network analysis

Thesis

Abstract

Acknowledgments

About the Author

List of Collaborators and Publications

Table of Contents

List of Figures

List of Tables

List of Algorithms

1 Introduction

2 Preliminaries

3 Efficient and private routing on PCNs

4 Efficient and private rebalancing on PCNs

5 Algorithms for optimising decisions for existing users in PCNs

6 Algorithms for optimising decisions for new users in PCNs

7 Conclusion

Bibliography

A Supplementary material for Chapter 5

B Technical proofs for Chapter 6

Payment channel networks are a promising approach to improve the scalability bottleneck of cryptocurrencies. Two design principles behind payment channel networks are efficiency and privacy. Payment channel networks improve efficiency by allowing users to transact in a peer-to-peer fashion along multi-hop routes in the network, avoiding the lengthy process of consensus on the blockchain. Transacting over payment channel networks also improves privacy as these transactions are not broadcast to the blockchain. Despite the influx of recent protocols built on top of payment channel networks and their analysis, a common shortcoming of many of these protocols is that they typically focus only on either improving efficiency or privacy, but not both. Another limitation on the efficiency front is that the models used to model actions, costs and utilities of users are limited or come with unrealistic assumptions. This thesis aims to address some of the shortcomings of recent protocols and algorithms on payment channel networks, particularly in their privacy and efficiency aspects. We first present a payment route discovery protocol based on hub labelling and private information retrieval that hides the route query and is also efficient. We then present a rebalancing protocol that formulates the rebalancing problem as a linear program and solves the linear program using multiparty computation so as to hide the channel balances. The rebalancing solution as output by our protocol is also globally optimal. We go on to develop more realistic models of the action space, costs, and utilities of both existing and new users that want to join the network. In each of these settings, we also develop algorithms to optimise the utility of these users with good guarantees on the approximation and competitive ratios.