Secret Shuffle Protocol for Encrypted KPIs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secret shuffle protocols in cloud-based multi-party computation scenarios fail to ensure anonymity of encrypted Key Performance Indicators (KPIs) during cross-company benchmarking, as sorting these indicators can reveal relative performance information, posing a risk of data leakage and compromising confidentiality.
Innovation Solution
Implementing secret shuffle protocols using homomorphic encryption, which randomize the order of encrypted inputs without revealing the original order, ensuring that no observer can map elements in the original sequence to their corresponding elements in the shuffled sequence, thereby maintaining anonymity and confidentiality.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If encrypted KPIs are sorted for benchmarking purposes, then performance measurement capability is improved, but anonymity and confidentiality of the data are compromised
Solution Approach 1:
The patent introduces a secret shuffle protocol as an intermediary mechanism between the encrypted KPIs and the benchmarking analysis. This protocol uses homomorphic encryption and oblivious transfer to permute the encrypted data values without revealing their original positions or associations, allowing performance measurement while preserving anonymity through cryptographic intermediaries
2Loss of information
If traditional secret shuffle protocols are used, then data anonymity is maintained, but communication efficiency and computational overhead are excessive
Solution Approach 1:
The patent changes the cryptographic parameters and protocols used in secret shuffle by combining homomorphic encryption with oblivious transfer in a optimized manner. This parameter change reduces the communication rounds and computational complexity compared to traditional approaches, improving productivity while maintaining the anonymity property
Solution Approach 2:
The patent segments the secret shuffle protocol into distinct cryptographic operations (homomorphic encryption phase, oblivious transfer phase, permutation phase) that can be executed more efficiently. This segmentation allows for optimized resource allocation and reduced overall communication overhead
Data Source
AI summary
The present disclosure involves systems, software, and computer implemented methods for a communication-efficient secret shuffle protocol for encrypted data based on homomorphic encryption and oblivious transfer. 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 and different blinding values, including use of an oblivious transfer mechanism. A last protocol step includes using homomorphism, for each client, to perform computations on intermediate encrypted data to homomorphically remove a first blinding value and a second blinding value, to generate a client-specific rerandomized encrypted secret input value. As a result, the client-specific rerandomized encrypted secret input values are generated in an order that is unmapped to an order of receipt, at the service provider, of the encrypted secret input values.