Secure Regenerating Codes for Reducing Storage and Bootstrap Costs in Sharded Blockchains
Divija Swetha Gadiraju, V. Lalitha, Vaneet Aggarwal

TL;DR
This paper introduces Secure-Repair-Blockchain (SRB), a protocol that employs coding-theoretic techniques to reduce storage and bootstrap costs in sharded blockchains, enhancing scalability and security.
Contribution
The paper proposes a novel protocol, SRB, that integrates secure regenerating codes to lower storage and bootstrap costs in sharded blockchains, improving scalability and security guarantees.
Findings
Lower storage requirements compared to non-coding approaches.
Reduced bootstrapping cost for new miners.
Enhanced security through coding-theoretic techniques.
Abstract
Blockchain is a distributed ledger with wide applications. Due to the increasing storage requirement for blockchains, the computation can be afforded by only a few miners. Sharding has been proposed to scale blockchains so that storage and transaction efficiency of the blockchain improves at the cost of security guarantee. This paper aims to consider a new protocol, Secure-Repair-Blockchain (SRB), which aims to decrease the storage cost at the miners. In addition, SRB also decreases the bootstrapping cost, which allows for new miners to easily join a sharded blockchain. In order to reduce storage, coding-theoretic techniques are used in SRB. In order to decrease the amount of data that is transferred to the new node joining a shard, the concept of exact repair secure regenerating codes is used. The proposed blockchain protocol achieves lower storage than those that do not use coding,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
