Research Area: Blockchain Technology
In this thesis, we solve it through dimensioning of BC using graph theory. With binomial distribution and preferential attachment models, we model the underlying BC P2P network to reduce topology control overhead while ensuring high flexibility, fast reconfigurability, connectivity, small diameter and clustering. Next, to reduce the no. of connections per peer,we establish ideal bounds on outbound and inbound connections that still guarantee P2P network feasibility and connectivity using rout digraphs. For an already developed BC framework, we evaluate its applicability through topology mapping. We demonstrate the efficiency of our approach using our BTCmap framework applied to Bitcoin and present its real captured snapshot.
However, using BC alone cannot holistically secure transaction as it only guarantees data immutability whereas in most scenarios, the data has also to be secured at point of generation and usage. Further, BC has high overhead and cannot penetrate to lower levels in a system.
Name of the Researcher: Varun Deshpande
Name of the Supervisor(s): Laurent George
Year of Completion: 2020
University: University Of Paris
Thesis Link: Home Page Url
