MPC Data Shuffling for Privacy Protection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In secure multi-party computation (MPC) data processing, existing methods allow one MPC computation party to infer data from another party based on computed data, potentially disclosing private information during data exchange.
Innovation Solution
A data processing method where MPC computation parties cyclically perform shuffling operations on split data components, generating and adjusting plaintext random sequences to create shuffled data components, ensuring that no single party can infer data from exchanged components, thereby reducing the risk of private data disclosure.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If MPC computation parties perform collaborative computing without shuffling operations, then data processing efficiency is improved, but private data disclosure risk increases
Solution Approach 1:
The patent applies preliminary action by performing shuffling operations on data components before they are used in MPC computations. Each computation party shuffles their data components in advance, so that when data is exchanged and processed, the original data locations are obscured. This preliminary shuffling prevents inference of private data while maintaining the efficiency of subsequent collaborative computation.
Solution Approach 2:
The patent uses shuffling operations as an intermediary mechanism between data exchange and computation. The shuffling process acts as a mediator that rearranges data components without revealing their original associations, allowing computation parties to process data collaboratively while preventing direct inference of private information from exchanged data.
2Object-affected harmful factors
If shuffling operations are performed on data components, then private data disclosure risk is reduced, but data processing complexity increases
Solution Approach 1:
The patent applies segmentation by dividing data into multiple data components that are distributed among different MPC computation parties. Each party performs shuffling operations on their respective data components independently. This segmentation allows the complex shuffling task to be distributed across multiple parties, reducing the computational burden on any single party while maintaining overall security.
Solution Approach 2:
The patent implements periodic shuffling operations where computation parties perform shuffling at specific stages of the MPC protocol. Rather than continuously shuffling, the operations are performed periodically at key points in the computation flow, which reduces unnecessary computational complexity while maintaining security at critical moments.
Data Source
AI summary
A computer-implemented method includes obtaining, by each secure multi-party computation (MPC) computation party of n secure MPC computation parties, a first data component sent by a data provider, obtained after the data provider splits to-be-processed data into n data components, and n is an integer not less than 3. M secure MPC computation parties are selected to respectively perform a shuffling operation on respectively held first data components, to obtain a second data component, so as to perform an MPC operation, wherein 1<m<n, and wherein m is a positive integer. Selecting m secure MPC computation parties is cyclically performed to perform a shuffling operation on first data components, until each secure MPC computation party is not selected for at least one time to perform the shuffling operation, where m secure MPC computation parties selected each time are not completely identical.