Open AccessA Supply Chain Framework for Identified Internet Services Based on Blockchain
Author(s) -
N Duraichi,
Naresh Sammeta,
Vuyyuru Lakshmi Lalitha,
P. Velmurugan
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1964/6/062043
Subject(s) - blockchain , computer science , single point of failure , router , computer security , key (lock) , certificate , public key cryptography , trust anchor , the internet , dependency (uml) , data integrity , computer network , world wide web , reputation , software engineering , theoretical computer science , encryption , social science , sociology , computational trust
The Named Data Networking is designed to ensure that each Data entity named allows its producer to digitally sign it. Therefore, the NDN project proposed to delivery of poisoned material an important management paradigm of Testing ground NDN for the actual data validation. This model, however, raises two problems in reality to search for false content: (1) a single point of failure is easily triggered by a centralised architecture, in particular where a root-key fails, because of its lack of dependency on keys across sites, and (2) an unnecessary certificate chain overhead for signing verification. This research suggests a key organization framework built on a blockchain in NDN, which addresses lack of mutual confidence among sites with no trust-based anchors. In particular both site nodes shape a licence blockchain to save public key hatches to guarantee validity, and the proxy gateway takes part to check that contacts among the router then the blockchain are overly regular. In accumulation, NDN is revamped to hold, validate and revoke a publicly important information object and scheme. The findings of our review and appraisal suggest that fewer verification numbers and greater verification reliability can be supported in the proposed arrangement.