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

【Author】 Patgiri, Ripon; Borah, Malaya Dutta

【Source】2022 IEEE INTERNATIONAL PERFORMANCE, COMPUTING, AND COMMUNICATIONS CONFERENCE, IPCCC

【影响因子】

【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. Moreover, the verification process creates unnecessary network traffic because it requires partial hash values to verify a particular block. Furthermore, 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 HEXB-LOOM, and it is implemented using hash, Exclusive-OR, and Bloom Filter. Our proposed model's performance 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 paper, we show that our proposed model is better than the state-of-the-art Merkle tree in every aspect.

【Keywords】Merkle tree; Blockchain; Bitcoin; verification; authentication; integrity; privacy; Hash; Security

【发表时间】2022

【收录时间】2023-06-07

【文献类型】

【主题类别】

--