Print Email Facebook Twitter LRFP : Extending local routing protocols in layer 2 networks with a secure fee model Title LRFP : Extending local routing protocols in layer 2 networks with a secure fee model Author Neut, Oliver (TU Delft Electrical Engineering, Mathematics and Computer Science; TU Delft Software Technology) Contributor Ersoy, O. (mentor) Roos, S. (graduation committee) Houben, G.J.P.M. (graduation committee) Degree granting institution Delft University of Technology Programme Computer Science and Engineering Project CSE3000 Research Project Date 2021-07-01 Abstract Blockchains like Bitcoin are known to be victim of scalability issues. The lack in high throughput and low latency form a great bottleneck to its network. A promis- ing solution are layer 2 protocols, more precisely payment channel networks (PCN). Payment success rates are a common metric in these networks. These rates can be in- creased by tweaking the routing of payments in the network. Local routing is a form of routing that allows payments in such networks to be split over multiple paths to reach its receiver. This significantly increases the rate of payment successes, however there is no trivial way to integrate fees in such protocol. This paper focuses on the integration of fees in local routing protocols by proposing a viable solution. Local Routing Fee Protocol (LRFP) is a protocol designed to extend an existing local routing protocol and is proven to be secure. It is a light addition but works as intended. Proofs on se- curity guarantees and a formal description on the protocol form the main contribution of this paper. Subject blockchainpayment channel networklocal routingfeessecurityprotocollayer 2 To reference this document use: http://resolver.tudelft.nl/uuid:8fb6aada-76af-4cc0-824e-2a532bcecd5f Part of collection Student theses Document type bachelor thesis Rights © 2021 Oliver Neut Files PDF Research_Paper_2.pdf 706.24 KB Close viewer /islandora/object/uuid:8fb6aada-76af-4cc0-824e-2a532bcecd5f/datastream/OBJ/view