Sharded Key Encryption for Secure Multi-Party Data Computation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for secure multi-party data computation face inefficiencies and security vulnerabilities as the number of participants increases, particularly in encrypting and decrypting large datasets, leading to decreased encryption efficiency and compromised data security.
Innovation Solution
A data processing method involving generating private key information for participants, performing a shard operation on these keys using a shard operation protocol, and encrypting plaintext data to generate ciphertext data, which requires collaborative decryption among all participants, enhancing security and complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional encryption methods are used for multi-party data computation, then data security is maintained, but encryption efficiency decreases as the number of participants increases
Solution Approach 1:
The patent segments the encryption process by introducing a shard operation that divides the encryption task into multiple independent key shards. Each participant holds only a portion of the key information, and the complete key is reconstructed only when needed for decryption. This segmentation allows parallel processing and distributes the computational burden, thereby improving encryption efficiency while maintaining security through the distributed key structure.
Solution Approach 2:
The patent performs preliminary actions by pre-computing and distributing key shards to participants before the actual encryption operation. The shard operation protocol establishes the key distribution structure in advance, allowing participants to have their key portions ready. This preliminary key preparation eliminates the need for complex real-time key management during encryption, thus improving efficiency without compromising security.
2Ease of operation
If individual participants hold complete key information, then decryption is simple, but data security is compromised as participants can infer plaintext data
Solution Approach 1:
The patent applies segmentation by dividing the complete decryption key into multiple key shards distributed among different participants. No single participant possesses the complete key information needed for decryption. Instead, the system requires collaborative decryption where multiple key shards are combined. This maintains decryption simplicity through a standardized protocol while enhancing security by ensuring that no individual participant can independently decrypt or infer plaintext data.
Solution Approach 2:
The patent introduces an intermediary mechanism in the form of a shard operation protocol that mediates the key reconstruction process. This intermediary protocol securely combines multiple key shards from different participants to form the complete decryption key only when authorized. This intermediary layer prevents any single participant from accessing the complete key, thereby maintaining data security while enabling controlled decryption operations.
3Adaptability or versatility
If the number of participants increases, then data circulation capability improves, but key management complexity and security vulnerabilities increase
Solution Approach 1:
The patent uses segmentation to manage key complexity by distributing key shards across multiple participants rather than centralizing key management. As the number of participants increases, the system naturally scales by adding more key shards, and each participant's key management burden remains constant. This segmentation approach enables improved data circulation capability with multiple participants while keeping individual key management complexity manageable through the standardized shard operation protocol.
Data Source
AI summary
A data processing method includes: generating respective private key information of M participants; performing a shard operation on the respective private key information of the M participants according to a predetermined shard operation protocol to obtain key information; encrypting plaintext data of each of the M participants using the key information to obtain respective ciphertext data of the M participants; and performing computation on the respective ciphertext data of the M participants to obtain a data computation result for the M participants.