Securing light clients in blockchain with DLCP

Leonardo da Costa, André Neto, Billy Pinheiro, Weverton Cordeiro, Roberto Araújo and Antônio Abelém

International Journal of Network Management, 2019, vol. 29, issue 3

Abstract: In blockchain, full nodes (FNs) are peers that store and verify entire chains of transactions. In contrast, light clients (LCs) are those with limited resources, and for this reason, they request only block headers from FNs for transaction verification—using protocols like Simple Payment Verification (SPV). In an approach to prevent FN tampering on transaction verification (byzantine fault), LCs request block headers from multiple FNs and compare received responses. One problem with this approach is that an LC must connect to each FN and perform the same cryptographic operations with each one repeatedly, which leads to client‐side complexity and slower response. We propose an alternate approach to tackle this issue, in which LCs can encrypt a request for block headers only once, and send that request to a predetermined set of FNs to access, process, and reply back in a single response. Our approach, called Distributed Lightweight Client Protocol (DLCP), enables LCs to verify with little effort if FNs have agreed on a response. From an experimental evaluation, we observed that DLCP provided lower latency and reduced computing and communication overhead in comparison with the existing conventional approach.

Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nem.2055

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:intnem:v:29:y:2019:i:3:n:e2055

Access Statistics for this article

More articles in International Journal of Network Management from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().