Enhancing Scalability in Blockchain Networks: An Improved Sharding Protocol Using Verifiable Random Function (VRF) for Shard Assignment
Rajesh Sharma R, Akey Sungheetha, Mohit Tiwari, Rajiv Gandhi K, GS Pradeep Ghantasala, Ellappan Venugopal · 2024
The use of blockchain is, however, faced with scalability issues which is a major hindrance to adoption. Sharding has proven to be an effective solution among the proposed ones though the existing ones are hindered with the problems of security and efficiency. In this paper, to enhance the proposed sharding protocol, we incorporate Verifiable Random Functions (VRF) for the distribution of shards. The given protocol includes the usage of VRF algorithm with dynamic reshuffle method which is comparatively newer and proven to enhance both security as well as load balance. It showed that simulations had improved the process of transaction throughput by 40% in relation to current shard protocols. The proposed method achieved 99.7%. permissions of the true values while the misclassification rate was compared with other relevant works which was lower than the proposed method. the shard takeover attacks and have cut down the cross-shard communication to 35%. Thus, it has been observed that load balancing efficiency of these shards have improved by 28 % in general. The sharding protocol proposed in this paper based on VRF provides blockchain with high scalability and strong security. The approach is suitable for scaling of Blockchains for Big Applications which includes BFSI and Supply chain solutions.