Homomorphic Encrypted Bloom Filters for Private Set Intersection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Bloom filters, used for private set intersection, lack confidentiality, allowing unauthorized access to set elements, which is a concern in applications like supply chain management and law enforcement systems.
Innovation Solution
Implementing homomorphic public-key encryption to encrypt Bloom filters, enabling operations like element addition and verification without decryption, and using zero-knowledge proofs to maintain privacy, specifically employing Goldwasser-Micali (GM) or Boneh, Goh, Nissim (BGN) encryption to secure bit operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If Bloom filters are used for private set intersection, then computation efficiency is improved, but confidentiality of set elements is lost
Solution Approach 1:
Homomorphic encryption serves as an intermediary layer between the Bloom filter data structure and the computational operations. It allows the server to perform set intersection computations on encrypted Bloom filters without decrypting them, thereby maintaining element confidentiality while enabling efficient computation. The encrypted Bloom filter acts as a mediator that preserves both privacy and computational utility.
2Loss of information
If homomorphic encryption is applied to Bloom filters, then confidentiality is improved, but computational complexity increases
Solution Approach 1:
The patent changes the cryptographic parameters and encryption scheme properties to optimize the balance between security and efficiency. By selecting specific homomorphic encryption schemes and tuning parameters such as ciphertext expansion factors and security levels, the system achieves adequate confidentiality protection while minimizing the increase in computational complexity. This allows practical deployment without excessive overhead.
Data Source
AI summary
Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for retrieving, from computer-readable memory, a set, the set including a plurality of elements, adding, using a computing device, elements of the set to a Bloom filter, the Bloom filter including a plurality of bits, and encrypting, using the computing device, each bit of the plurality of bits of the Bloom filter to provide an encrypted Bloom filter, encrypting being achieved using homomorphic, public key encryption. Implementations are further directed to performing operations on the encrypted Bloom filter, and performing private set intersection (PSI) using the encrypted Bloom filter.