Server Device Secret Equality Determination Communication Rounds
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secure computation protocols face inefficiencies in communication rounds for secret equality determination, particularly when operating on rings of order greater than 2, leading to performance deterioration in environments with large network delays, and incur high communication traffic when using secret sharing methods.
Innovation Solution
A server device and method that generate and mask secret shared data using random number shares, allowing parallel computation of AND operations and secret equality determination without relying on secret sharing methods, thereby reducing communication rounds and traffic.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If secret equality determination is performed using existing secure computation protocols on rings of order greater than 2, then the computation can be executed, but the number of communication rounds increases leading to performance deterioration
Solution Approach 1:
The patent changes the parameter of ring order from greater than 2 to exactly 2, which fundamentally alters the communication protocol requirements. By operating in a ring of order 2 instead of higher-order rings, the system achieves constant communication rounds independent of the secret data length, thereby resolving the performance deterioration issue while maintaining computational capability
2Reliability
If secret sharing methods are used for secure search, then data can be kept secret during searching, but communication traffic becomes high
Solution Approach 1:
The patent extracts and eliminates the secret sharing mechanism from the secure search protocol. By removing the requirement for secret sharing methods, the system achieves constant communication traffic that does not scale with secret data length, while still maintaining data secrecy through alternative cryptographic approaches in the ring of order 2
3Adaptability or versatility
If general secure computation protocols are used for any computation, then versatility is achieved, but communication cost increases with computation complexity
Solution Approach 1:
The patent segments the computation space by identifying that secret equality determination can be independently and efficiently handled in a ring of order 2, separate from other computations. This segmentation allows the equality determination portion to use optimized constant-traffic protocols while other computations can proceed independently, reducing overall communication costs for composite protocols
Data Source
AI summary
A server device, a secret equality determination system, a secret equality determination method and a secret equality determination program recording medium are provided which, regardless of the server sharing scheme, can run with no difference in the number of communication rounds, whether carried out with a ring of order 2 or with a ring of an order greater than 2. This server device is provided with a secret shared data generation unit, a data storage unit, a mask unit, a random number share bit-conjunction unit, a random number share generation unit, a determination bit-conjunction unit and a secret shared data restoration unit. The secret shared data generation unit generates secret shared data. The data storage unit stores the secret shared data. The mask unit uses random number secret shared data to mask certain shared data. The random number share generation unit generates random number shares in which random numbers are secretly shared. In parallel with other calculations, the random number share bit-conjunction unit calculates the logical product of the values in which the random numbers are secretly shared. The determination bit-conjunction unit performs a secret equality determination using the value outputted by the random number share bit-conjunction unit.