Encrypted Set Intersection Vectors for Large PSI Computation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing private set intersection (PSI) techniques face challenges in performing operations for large data sets due to increased data transmission and computation amounts, leading to inefficiencies and slow computation speeds.
Innovation Solution
An apparatus and method that generate and manipulate ciphertext vectors corresponding to subsets of a universal set, allowing for set intersection operations to be performed in an encrypted state, using techniques like RSA and homomorphic encryption to determine intersections without exposing the underlying data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional PSI techniques (hash-based, public key cryptography-based, circuit-based, or oblivious transfer based) are used, then data privacy is protected, but data transmission amount and computation amount increase as comparison objects increase, making large data set operations impossible or too slow
Solution Approach 1:
The patent segments large data sets into multiple subsets and processes them in parallel using multiple processing circuits. Each circuit handles a portion of the data independently, reducing the computational burden on individual circuits and enabling scalable processing of large data sets while maintaining encryption-based privacy protection
Solution Approach 2:
The patent replaces conventional cryptographic mechanisms (hash-based PSI, public key cryptography-based PSI, circuit-based PSI, or oblivious transfer based PSI) with a homomorphic encryption-based system using polynomial representations and secret sharing. This substitution enables efficient computation on encrypted data without requiring complex cryptographic protocols, significantly improving computation speed while maintaining security
2Reliability
If conventional PSI techniques are used, then data privacy is protected, but data transmission amount increases as comparison objects increase
Solution Approach 1:
The patent segments data into subsets processed in parallel, reducing the amount of data that needs to be transmitted between parties for any single processing operation. Each processing circuit receives only the subset of data it needs to process, thereby reducing overall transmission requirements
Solution Approach 2:
The patent transforms data into polynomial representations and uses homomorphic encryption to perform operations on encrypted polynomials. This parameter transformation enables computation on encrypted data without requiring transmission of plaintext data, significantly reducing data transmission amounts while maintaining privacy
3Quantity of substance
If data sets are increased in size for PSI operations, then more comprehensive intersection analysis is achieved, but computation time increases making operations too slow
Solution Approach 1:
The patent divides large data sets into multiple subsets and processes them simultaneously using multiple processing circuits operating in parallel. This segmentation enables linear scalability where computation time increases proportionally with the number of processing circuits rather than quadratically with data set size, making large data set operations feasible
Solution Approach 2:
The patent performs preliminary transformations of data into polynomial representations and establishes secret sharing schemes before the actual intersection computation. These preliminary actions organize data in a manner that enables efficient parallel processing and reduces the computational complexity of the main intersection operation
Data Source
Figure 1~2
Figure 3
Figure 4
AI summary
An apparatus and method for set inspection operation are disclosed. The apparatus for set intersection operation according to an embodiment includes a ciphertext acquisition unit configured to acquire a ciphertext for a first vector corresponding to a first subset of a universal set including a plurality of elements from an encryption apparatus, a transform unit configured to generate a second vector corresponding to a second subset of the universal set, a computation unit configured to generate a ciphertext for a third vector corresponding to an intersection of the first subset and the second subset, based on the ciphertext for the first vector and the second vector, and a ciphertext providing unit configured to provides the ciphertext for the third vector to the encryption apparatus.