A Privacy Protection Method of Lightweight Nodes in Blockchain

Abstract

Aiming at the privacy protection of lightweight nodes based on Bloom filters in blockchain, this paper proposes a new privacy protection method. Considering the superimposition effect of query information, node and Bloom filter are regarded as the two parties of the game. A privacy protection mechanism based on the mixed strategy Nash equilibrium is proposed to judge the information query. On this basis, a Bloom filter privacy protection algorithm is proposed when the probability of information query and privacy, not being leaked, is less than the node privacy protection. It is based on variable factor disturbance, adjusting the number of bits’ set to 1 in the Bloom filter to improve the privacy protection performance in different scenarios. The experiment uses Bitcoin transaction data from 2009 to 2019 as the test data to verify the effectiveness, reliability, and superiority of the method.

Evaluation Performance of Bloom Filter in Blockchain Network

“…In 2021, Lin et al [5] proposed a mechanism to distinguish which address information should be entered into the Bloom filter for querying based on the mixed Nash equilibrium strategy, along with the historical query records and privacy protection level for lightweight nodes. They analyzed on small database.…”

“…B. Privacy Degree 1) Single Bloom filter: Amidst the many positive qualities that the adversary properly possesses, the likelihood of (e), P a (e), is the true positive value that match the BF, which is calculated based on the equations [5]:…”

“…Blockchain has proven to be particularly effective in a variety of application areas, including smart contracts, insurance, finance, banking, and a number of other fields, according to researchers [5] [6] [7]. âBlockchainâ is responsible for Bitcoin's enormous success [8] [9].…”