Verifiable Secret Shuffle Protocol for Encrypted Data
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secret shuffle protocols in multi-party computation scenarios fail to ensure complete anonymity of encrypted Key Performance Indicators (KPIs) during benchmarking, as sorting these indicators can reveal confidential information about the relative performance of companies, risking data breaches and leakage of sensitive data.
Innovation Solution
Implementing secret shuffle protocols using homomorphic encryption, which randomize the order of encrypted inputs to prevent observers from mapping original sequences to their corresponding shuffled sequences, ensuring anonymity by blinding and rerandomizing encrypted values without affecting the underlying plaintexts.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If encrypted KPIs are sorted to enable benchmarking comparisons, then performance measurement capability is improved, but anonymity and confidentiality of the data are worsened
Solution Approach 1:
The patent applies secret sharing by dividing each encrypted KPI into multiple shares distributed among different parties. This segmentation allows the KPIs to be processed and compared without any single party having complete knowledge, thus maintaining anonymity while enabling benchmarking comparisons.
Solution Approach 2:
The patent introduces a trusted third party (service provider) that acts as an intermediary to perform the shuffling and comparison operations. This mediator can process the encrypted data and maintain anonymity by not being able to link specific KPIs to specific companies, while still enabling valid performance comparisons.
2Loss of information
If secret sharing is used to maintain anonymity, then confidentiality is improved, but computational complexity and protocol steps are worsened
Solution Approach 1:
The patent combines multiple operations (shuffling, blinding, rerandomization) into a unified secret shuffle protocol that executes in a single coordinated round. This merging reduces the overall protocol complexity compared to performing each operation separately, while still maintaining anonymity through secret sharing.
Solution Approach 2:
The patent performs preliminary blinding and randomization operations before the actual comparison. By preparing the data in advance with random masks and shuffled positions, the system reduces computational complexity during the main benchmarking phase while maintaining anonymity throughout the process.
3Loss of information
If multiple rounds of shuffling and blinding are performed, then anonymity is improved, but processing time and computational resources are worsened
Solution Approach 1:
The patent performs shuffling, blinding, and rerandomization operations in a continuous single-round process rather than multiple sequential rounds. This continuous execution maintains anonymity through the combined effect of these operations while significantly reducing processing time compared to iterative approaches.
Solution Approach 2:
The patent changes the parameters of the encryption and randomization operations to achieve sufficient anonymity in fewer steps. By adjusting the degree of blinding and the number of randomization layers, the system achieves the required anonymity level with reduced computational overhead and processing time.
Data Source
AI summary
The present disclosure involves systems, software, and computer implemented methods for a verifiable communication-efficient secret shuffle protocol for encrypted data based on homomorphic encryption. A service provider and multiple clients participate in a secret shuffle protocol of randomly shuffling encrypted client-specific secret input values. The protocol includes generation and exchange of random numbers, random permutations, different blinding values, and use of random secret-shares. A protocol step includes homomorphic operations to shuffle encrypted secret input values so that resulting encrypted secret input values are rerandomized and in a shuffled sequence that is unmapped to an order of receipt by the service provider of the encrypted secret input values.