Trust-Based Neighbor Selection Protocol to Elect Leader in Blockchain using zk-SNARKs Algorithms

Preview this chapter:

Trust-Based Neighbor Selection Protocol to Elect Leader in Blockchain using zk-SNARKs Algorithms, Page 1 of 1

< Previous page | Next page > /docserver/preview/fulltext/9789815324099/chapter-1-1.gif

Blockchain stores and writes all the transactions because of the unlimited storage capacity. Leader election is the process of electing a node as an overall incharge of the distributed network. Leader election is a complicated task as we have to choose a leader by giving equal opportunity to all the nodes. We implement all the algorithms of the DONS protocol in order to elect a leader but in our TBNS (Trust Based Neighbor Selection) protocol, we add zk-SNARKs proof to enhance the security of Blockchain. zk-SNARKs (Zero-Knowledge Succinct Non-Interactive Argument of Knowledge) is a type of proof used in cryptography to prove the authenticity of information without revealing any additional information. It allows one party to prove to another that they know a certain piece of information without actually revealing the information itself. In the end, the results of our proposed model are compared with RTT-NS and DONS.