HARE: A new Hash-based Authenticated Reliable and Efficient Modified Merkle Tree Data Structure to Ensure Integrity of Data in the Healthcare Systems

Chelladurai, Usharani; Pandian, Seethalakshmi

doi:10.1007/s12652-021-03085-0

Cited by 7 publications

(2 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To resolve the computational issues with the ordinary Merkle tree, Chelladurai and Pandian 19 presented the modified Merkle tree information structure. It has just three phases: root, branch, and leaves.…”

Section: Literature Surveymentioning

confidence: 99%

Design of efficient storage and retrieval of medical records in blockchain based on InterPlanetary File System and modified bloom tree

Devi

Bhuvaneswari

2023

Security and Privacy

View full text Add to dashboard Cite

In the healthcare sector, medical records contain sensitive information about patients, so guaranteeing the confidentiality and integrity of it is essential. To improve the security of it, blockchain technology is being utilized. The blockchain is a type of distributed ledger and it keeps data securely while also generating trust without the need of third party. It has data storage constraint and Merkle tree preserves data integrity but it is inefficient when searching transactions within it. Hence this paper describes InterPlanetary File System (IPFS) based storage and modified bloom tree data structure which is a hybridization of bloom filter and Merkle tree for efficient searching. To protect data privacy, initially it encrypts medical records using ciphertext policy‐attribute based encryption and then the data stored on IPFS returns a hash value. To diminish the false positive rate (FPR), the hash returned by IPFS is stored in two parts of the bloom filter. The first part stores the data by using “k” non‐cryptographic hash function and second part stores the transformed data with the same hash function. The bloom tree is created using Merkle proof for verification of medical record in blockchain. The experiments show that the proposed method reduces the FPR rate and searching complexity is O(log2).

show abstract

Section: Literature Surveymentioning

confidence: 99%

Design of efficient storage and retrieval of medical records in blockchain based on InterPlanetary File System and modified bloom tree

Devi

Bhuvaneswari

2023

Security and Privacy

View full text Add to dashboard Cite

show abstract

“…An authenticated data structure (ADS) [28]- [32] is a mechanism for computing a cryptographic commitment s to any number of discrete data items in a collection S . Useful ADSes, typically based on hash trees, possess efficient strategies to incrementally update the commitment ( ) s t , with incremental changes to ( )…”

Section: Authenticated Data Structuresmentioning

confidence: 99%

Blockchain Based Redistricting with Public Participation

Ramkumar,

Adhikari

2022

JIS

View full text Add to dashboard Cite

Redistricting is the process of grouping all census blocks within a region to form larger subdivisions, or districts. The process is typically subject to some hard rules and some (soft) preferences to improve fairness of the solution. Achieving public consensus on the fairness of proposed redistricting plans is highly desirable. Unfortunately, fair redistricting is an NP hard optimization problem. The complexity of the process makes it even more challenging to convince the public of the fairness of the proposed solution. This paper proposes a completely transparent blockchain based strategy to promote public participation in the redistricting process, to increase public confidence in the outcome of the process. The proposed approach is based on the fact that one does not have to worry about how the NP hard problem was solved, as long as it is possible for anyone to compute a "goodness" metric for the proposed plan. In the proposed approach, anyone can submit a plan along with the expected metric. Only the plan with the best claimed metric needs to be evaluated in a blockchain network.

show abstract

Blockchain-enabled solution for secure and scalable V2V video content dissemination

Shen

Liu

Shi³

et al. 2022

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

HARE: A new Hash-based Authenticated Reliable and Efficient Modified Merkle Tree Data Structure to Ensure Integrity of Data in the Healthcare Systems

Cited by 7 publications

References 24 publications

Design of efficient storage and retrieval of medical records in blockchain based on InterPlanetary File System and modified bloom tree

Design of efficient storage and retrieval of medical records in blockchain based on InterPlanetary File System and modified bloom tree

Blockchain Based Redistricting with Public Participation

Blockchain-enabled solution for secure and scalable V2V video content dissemination

Contact Info

Product

Resources

About