Payment channels allow transactions between participants of the blockchain to be executed securely off-chain, and thus provide a promising solution for the scalability problem of popular blockchains. We study the online network design problem for payment channels, assuming a central coordinator. We focus on a single channel, where the coordinator desires to maximize the number of accepted transactions under given capital constraints. Despite the simplicity of the problem, we present a flurry of impossibility results, both for deterministic and randomized algorithms against adaptive as well as oblivious adversaries.
CITATION STYLE
Avarikioti, G., Besic, K., Wang, Y., & Wattenhofer, R. (2019). Online Payment Network Design. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11737 LNCS, pp. 307–320). Springer. https://doi.org/10.1007/978-3-030-31500-9_20
Mendeley helps you to discover research relevant for your work.