Min-Increment Bloom Filters for Private Reach and Frequency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Computing the union, intersection, or frequency of large sets of data distributed across multiple sources involves sharing private or protected information, which negatively impacts privacy and security.
Innovation Solution
Utilizing encrypted probabilistic data structures and a homomorphic encryption scheme to generate and transmit probabilistic data structures, allowing for secure and computationally efficient estimation of device identifiers and attributes without exposing private information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If private information is shared between multiple sources to compute union, intersection, or frequency of large data sets, then computation accuracy is improved, but privacy and security are compromised
Solution Approach 1:
The patent introduces encrypted probabilistic data structures as intermediaries between multiple data sources. These structures (such as encrypted Bloom filters, encrypted histograms, or encrypted moment-based representations) allow computations to be performed on encrypted data without exposing the underlying private information. The intermediary encrypted structure enables accurate computation of union, intersection, and frequency while maintaining privacy through cryptographic protection.
Solution Approach 2:
The patent transforms the data representation by changing parameters from raw private information to encrypted statistical moments or encrypted probabilistic structure parameters. By working with encrypted sums, encrypted means, or encrypted histogram bins instead of raw data, the system achieves computation accuracy while the cryptographic encoding protects privacy. The parameter transformation allows mathematical operations to be performed on encrypted values.
2Measurement precision
If large sets of data are transmitted to worker computing devices for processing, then computation accuracy is improved, but data transmission and processing requirements increase
Solution Approach 1:
The patent extracts only the essential statistical features (such as sums, means, variances, or histogram bin counts) from large data sets and transmits these extracted features instead of the complete raw data. By taking out only the necessary computational elements and discarding redundant information, the system reduces data transmission volume significantly while maintaining sufficient accuracy for computing union, intersection, and frequency metrics.
Solution Approach 2:
The patent segments large data sets into smaller probabilistic data structures or statistical moment representations that can be processed independently. By dividing the data into manageable encrypted segments (such as multiple encrypted histogram bins or segmented Bloom filters), the system reduces the quantity of data that needs to be transmitted and processed as a single unit, while still achieving accurate aggregate computations.
Data Source
AI summary
Systems and methods for generating min-increment counting bloom filters to determine count and frequency of device identifiers and attributes in a networking environment are disclosed. The system can maintain a set of data records including device identifiers and attributes associated with device in a network. The system can generate a vector comprising coordinates corresponding to counter registers. The system can identify hash functions to update a counting bloom filter. The system can hash the data records to extract index values pointing to a set of counter registers. The system can increment the positions in the min-increment counting bloom filter corresponding to the minimum values of the counter registers. The system can obtain an aggregated public key comprising a public key. The system can encrypt the counter registers using the aggregated shared key to generate an encrypted vector. The system can transmit the encrypted vector to a networked worker computing device.


