A Searching Methodology for A Secure Identifying Block Location in Blockchain
Abdulrahman Mohammed Ahmed Alamer · 2024
Blockchain-based distributed storage allows the sharing of data between users without assistance from a central service provider. Decentralization removes any data loss that result from the provider being compromised, but can be time consuming and result in privacy leaks whereby the provider connects the retrieved data to its requested block. Although there are some keyword search schemes that can solve this issue, they remain unable to efficiently reduce time cost in the retrieval of the block associated with a searchable keyword. This work proposes a unique search method to securely identify, from a chain of blocks, a requested block in a blockchain system. A Bloom filter (BF) technique with bit value (BV) technique are used to design a (BF-BV) as a secure searchable keyword methodology in a blockchain system. The proposed BF-BV is designed to allow each node in a blockchain system to securely identify a specific block in very short time. Analysis reveals that the BF-BV scheme achieves all the indispensable aspects of security requirements and search efficiency. Additionally, the BF-BV method has been evaluated in terms of the speed of identifying a block's location and performance efficiency of the searching time cost.