Updatable Private Set Intersection for Arbitrary Inserts and Deletes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing protocols for private set intersection (PSI) do not efficiently support arbitrary deletions and updates in a dynamic setting, leading to inefficiencies in privacy-preserving applications like online advertisement statistics, where user data needs to be updated frequently to comply with privacy laws.
Innovation Solution
A framework for updatable PSI is developed using structured encryption, allowing for constant round protocols with communication and computation complexity that grows linearly with the size of updates and only poly-logarithmically with the size of accumulated sets, supporting arbitrary inserts and deletes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional PSI protocols are used for dynamic settings, then basic intersection computation is achieved, but communication and computation complexity grows linearly with the size of the entire input sets rather than just the updates
Solution Approach 1:
The patent segments the PSI computation into two distinct parts: (1) processing updates to the sets, and (2) computing the intersection. By separating the update processing from the intersection computation, the protocol achieves complexity that depends only on the size of updates rather than the entire accumulated sets, significantly improving efficiency for repeated computations.
Solution Approach 2:
The patent performs preliminary actions by maintaining encrypted representations of sets and pre-processing update operations before intersection computation is needed. This allows the system to prepare the data structures in advance so that when intersection is required, only the minimal update processing and intersection step needs to be executed, rather than reprocessing the entire history.
2Adaptability or versatility
If arbitrary deletions are supported in PSI protocols, then dynamic data management capability is improved, but protocol complexity increases
Solution Approach 1:
The patent introduces an intermediary mechanism using encrypted set representations and structured encryption schemes that mediate between the need for arbitrary deletions and protocol complexity. The encryption structure allows deletions to be performed on the encrypted representations without requiring complex decryption and re-encryption operations, thus supporting arbitrary deletions while keeping the protocol manageable.
3Loss of time
If constant round protocols are implemented, then communication efficiency is improved, but achieving sublinear complexity with arbitrary updates becomes difficult
Solution Approach 1:
The patent applies dynamics by making the protocol adaptive to the actual update operations performed. The protocol structure allows it to remain constant-round while dynamically adjusting its internal processing based on the type and size of updates (insertions vs. deletions). This dynamic adaptation enables the protocol to achieve sublinear complexity in the size of accumulated sets while maintaining the efficiency of constant-round communication.
Data Source
AI summary
Provided are systems and methods for implementing an updatable private set intersection (UPSI) that supports arbitrary deletions, where one is not known to date. Various embodiments leverage this new UPSI to enable and improve a variety of privacy-preserving applications where PSI is currently employed. For example, various embodiments provide a constant round protocol with worst-case communication and computation complexity that grows linearly in the size of the updates and only poly-logarithmically with the size of the accumulated sets, and provides the first implementation to support arbitrary inserts and deletes for updatable PSI. Any one of these functionalities improve over current solutions.