NABET, NABET 2020 CONFERENCE

Font Size: 
Analysis of Efficiency in Partial Data Verification: Blockchain Hash Functions & Merkle Trees
Loreen M. Powell, Daniel Powell

Last modified: 2020-08-14

Abstract


The COVID-19 pandemic has propelled many organizations into telework/e-work. As the electronic delivery of information and work continues to alter our existing financial, legal, health, and educational worlds, the need for secure online data verification increases.  Blockchain’s hash functions for data verification makes it very desirable for organizations to use to secure and verify online data.  However, the complexity, newness, and lack of experienced blockchain professionals often impedes it’s use. As a result, many researchers and organizations seek innovative ways to reduce data verification without reducing the security. This paper focuses on partial online data verification via blockchain Merkle trees.  An in-depth analysis of Merkle trees and a novel approach for using Merkel trees for partial blockchain online data verification is presented.