Secret Equality Determination via Ring-Share Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secure computation protocols face inefficiencies in communication traffic during secret equality determination, particularly in narrow communication band environments, where the number of communication rounds and traffic are high, affecting processing speed.
Innovation Solution
A secret equality determination system comprising a random number generation server, a masked value restoration server, and multiple secure computation servers, which generate and share ring-shares and bit-shares to perform secret equality determination with reduced communication rounds to O(Log(L)), improving communication traffic efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional secure computation protocols are used for secret equality determination, then security is maintained, but communication traffic and number of communication rounds increase, reducing processing speed
Solution Approach 1:
The patent segments the secret equality determination process into multiple phases: setup phase for distributing sharing keys, computation phase for calculating difference and determining equality, and result phase for notifying outcomes. This segmentation allows optimized communication patterns where critical data is transmitted only when necessary, reducing overall communication time while maintaining security
Solution Approach 2:
The patent implements preliminary actions by pre-distributing sharing keys to participants before the actual equality determination computation. This preliminary key distribution enables the computation phase to proceed with reduced communication overhead, as participants already possess the necessary cryptographic materials to perform local computations
2Reliability
If secure computation protocols with high communication security are implemented, then data protection is improved, but communication traffic increases, affecting bandwidth efficiency
Solution Approach 1:
The patent applies local quality by enabling each participant to perform local computations using their private sharing keys without requiring constant communication with other participants. Each participant independently calculates their portion of the difference computation, reducing the volume of data that must be transmitted across the network while maintaining cryptographic security
Solution Approach 2:
The patent extracts essential computational operations from the communication process and performs them locally at each participant's device. By taking out the computation step from the communication-heavy protocol and executing it locally using pre-distributed keys, the system reduces communication traffic while preserving data protection
Data Source
AI summary
A random number generation server device includes a random number generation unit generating random numbers, a share addition unit generating secret shared data masked using random numbers and the secret shared data of operands in secret equality determination, a secret shared data generation unit generating secret shared data of inputted values, a secret shared data restoration unit obtaining the original values by restoring the secret shared data, and a determination bit-conjunction unit using the secret shared data to perform secret equality determination. A mask value restoration server device includes a secret shared data generation unit, a secret shared data restoration unit, and a determination bit-conjunction unit. A secure computation server device includes a secret shared data generation unit, a secret shared data restoration unit, and a determination bit-conjunction unit.