Cryptology ePrint Archive: Report 2021/773

HEX-BLOOM: An Efficient Method for Authenticity and Integrity Verification in Privacy-preserving Computing

Ripon Patgiri and Malaya Dutta Borah

Abstract: Merkle tree is applied in diverse applications, namely, Blockchain, smart grid, IoT, Biomedical, financial transactions, etc., to verify authenticity and integrity. Also, the Merkle tree is used in privacy-preserving computing. However, the Merkle tree is a computationally costly data structure. It uses cryptographic string hash functions to partially verify the data integrity and authenticity of a data block. However, the verification process creates unnecessary network traffic because it requires partial hash values to verify a particular block. Moreover, the performance of the Merkle tree also depends on the network latency. Therefore, it is not feasible for most of the applications. To address the above issue, we proposed an alternative model to replace the Merkle tree, called HEX-BLOOM, and it is implemented using hash, Exclusive-OR and Bloom Filter. Our proposed model does not depends on network latency for verification of data block's authenticity and integrity. HEX-BLOOM uses an approximation model, Bloom Filter. Moreover, it employs a deterministic model for final verification of the correctness. In this article, we show that our proposed model outperforms the state-of-the-art Merkle tree in every aspect.

Category / Keywords: foundations / authentication, verification, hash, Blockchain, privacy, Merkle tree

Date: received 8 Jun 2021, last revised 6 Oct 2021

Contact author: ripon at cse nits ac in

Available format(s): PDF | BibTeX Citation

Note: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

Version: 20211006:014912 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]