An Analytical Analysis of Hashing Functions in Blockchain Networks for Data Integrity Verification

We mentioned, hashing functions are important for keeping data integrity on block chain networks. The main goal of this study is to provide an analytical analysis of the different types of hashing functions used in block chain networks (for data integrity verification). With the rise of block chain, there is a clamor for more secure and effective data storage. This study explains block chain essentials and its major modules. It then explores hashing functions and their importance in block chain networks. Cryptographic properties and use case performance are compared across several types of hashing functions (SHA-256, Keccak, and BLAKE2). The conclusion is that all hashing functions offer good data integrity but are not equally fit for different use cases: SHA-256 for Bitcoin and BLAKE2s when storing file-based data. Moreover, the computational efficiency of hashing functions is also important because block chain networks can sometimes be very busy. This study's results will help choose adequate hashing functions for various block chain scenarios, making data storage and validation more efficient and safe. This work will further add to the repository of information about block chain technology and shed light on developments in hashing functions related to data reliability.

Authors

Institutions

Publication Details

Published
2025-05-29
DOI
https://doi.org/10.1109/netcrypt65877.2025.11102394
Citations
1
Primary Topic
Cloud Data Security Solutions
Type
article
Field-Weighted Citation Impact
3.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Analytical Analysis of Hashing Functions in Blockchain Networks for Data Integrity Verification

Aneesh Wunnava, Pooja Sharma, D. Nancy Kirupanithi, SB Das et al.
1 citations
Cloud Data Security Solutions
3.25
article

An Analytical Analysis of Hashing Functions in Blockchain Networks for Data Integrity Verification

Aneesh Wunnava, Pooja Sharma, D. Nancy Kirupanithi, SB Das, K. R. Nanthagobal, Padmapriya
article en
1 citations

Abstract

We mentioned, hashing functions are important for keeping data integrity on block chain networks. The main goal of this study is to provide an analytical analysis of the different types of hashing functions used in block chain networks (for data integrity verification). With the rise of block chain, there is a clamor for more secure and effective data storage. This study explains block chain essentials and its major modules. It then explores hashing functions and their importance in block chain networks. Cryptographic properties and use case performance are compared across several types of hashing functions (SHA-256, Keccak, and BLAKE2). The conclusion is that all hashing functions offer good data integrity but are not equally fit for different use cases: SHA-256 for Bitcoin and BLAKE2s when storing file-based data. Moreover, the computational efficiency of hashing functions is also important because block chain networks can sometimes be very busy. This study's results will help choose adequate hashing functions for various block chain scenarios, making data storage and validation more efficient and safe. This work will further add to the repository of information about block chain technology and shed light on developments in hashing functions related to data reliability.

Jain University (IN), Siksha O Anusandhan University (IN), Sathyabama Institute of Science and Technology (IN), Chitkara University (IN), Jaipur National University (IN)
Openalex Percentile: Top 7%
Cloud Data Security Solutions
3.25
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.