Private Set Intersection via Homomorphic Encryption and Delegate Modules
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for private set intersection, such as keyed hashing and homomorphic encryption, are computationally inefficient and require multiple interactions between parties, leading to increased costs and burdens due to the need for dedicated servers and vulnerability to brute force attacks.
Innovation Solution
A method using delegate modules to securely and efficiently determine the intersection of two private data sets through homomorphic encryption and keyed hash values, allowing for calculations on encrypted data without revealing underlying information, with a single round of interaction and no continuous server requirement.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If keyed hashing is used for private set intersection, then data confidentiality is maintained, but the system becomes vulnerable to brute force attacks
Solution Approach 1:
The patent introduces a cryptographic intermediary mechanism where a first party generates encrypted search tokens using a secret key, and a second party uses these tokens to search their encrypted dataset. The intermediary cryptographic protocol ensures that neither party learns the other's data while maintaining security against brute force attacks through proper key management and encryption schemes.
2Reliability
If homomorphic encryption is used to perform calculations on encrypted data, then data security is improved, but computational efficiency deteriorates
Solution Approach 1:
The patent extracts the computational burden from the encrypted domain by performing set intersection operations on encrypted tokens and identifiers first, then only applying homomorphic encryption to the final result calculation. This selective approach maintains data security for sensitive operations while improving efficiency by avoiding unnecessary homomorphic computations on all data elements.
3Reliability
If multiple interactions are required between parties for private set intersection, then security is improved, but device complexity and operational burden increase
Solution Approach 1:
The patent implements preliminary actions by having parties pre-process their data into encrypted forms and pre-generate cryptographic tokens before the actual intersection operation. The first party pre-computes encrypted search tokens, and the second party pre-prepares their encrypted dataset, allowing the actual intersection to be performed with minimal interactions and without requiring continuous server availability.
4Ease of operation
If third parties are used to view and disclose common data, then data intersection can be determined, but costs increase and confidentiality is compromised
Solution Approach 1:
The patent replaces untrusted third-party intermediaries with a cryptographic intermediary protocol where encrypted tokens and homomorphic encryption serve as the mediation mechanism. This allows data intersection to be determined without any party viewing the other's raw data, maintaining both confidentiality and operational capability through mathematical rather than organizational intermediation.
Data Source
AI summary
Embodiments disclosed herein describe computing calculations based on two overlapping private sets between various parties. To conduct the calculation, an intersection of the overlapping private sets data lists is conducted without revealing the underlying data. A homomorphic encryption is conducted on the intersecting data elements to allow them to be compared.