Secure Computation Server Verification for Guaranteed Output Delivery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secure computation systems face challenges in maintaining security levels, particularly in the standard model, where the presence of an adversary can compromise the integrity of the computation process and results.
Innovation Solution
A secure computation system involving at least five secure computation server apparatuses connected via a network, each equipped with a comparative verification part that compares values received from at least three other servers to ensure identical values are accepted as correct, enabling secure computation without interruption, even in the presence of an adversary.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If secure computation is performed in the random oracle model using hash functions, then the computation process can be executed, but the security level is limited because input inference from hash outputs may not pose a vulnerability
Solution Approach 1:
The patent extracts and removes the dependency on hash functions from the secure computation system. By eliminating the random oracle model requirement, the system achieves security in the standard model without needing hash function outputs, thereby resolving the contradiction between security level and dependency complexity
Solution Approach 2:
The patent changes the security model parameter from random oracle model to standard model. This parameter change allows the system to achieve higher security guarantees without relying on hash function properties, thus improving reliability while reducing functional complexity
2Reliability
If an adversary is present among the participants, then the secure computation process may be compromised, but interrupting the process to detect the adversary reduces productivity
Solution Approach 1:
The patent implements feedback mechanisms where each server verifies received data against its own secret-shared values and cross-checks with other servers. This continuous feedback loop enables detection of adversarial behavior while allowing the computation process to continue, resolving the contradiction between reliability and productivity
Solution Approach 2:
The patent performs preliminary verification actions where servers check the consistency of received data before proceeding with computation. By checking data integrity in advance using secret-sharing properties, the system can detect adversaries early without interrupting the overall computation flow, thus maintaining both reliability and productivity
3Reliability
If values are received from multiple servers for verification, then the security against adversaries is improved, but the communication overhead and time increase
Solution Approach 1:
The patent applies partial verification by having each server check only the necessary portion of received data against its secret-shared values. Instead of full verification of all data from all servers, the system performs targeted checks on critical values, achieving sufficient verification accuracy while reducing time loss
Solution Approach 2:
The patent segments the verification process into independent checks that can be performed in parallel. Each server independently verifies specific values from other servers using its local secret-shared data, allowing simultaneous verification of multiple values and reducing total verification time while maintaining reliability
Data Source
AI summary
A secure computation system comprises at least five secure computation server apparatuses connected to each other via a network and performs secure computation on a value stored while being secret-shared, and each of the secure computation server apparatuses has a comparative verification part that compares values, which should be the same, received from at least three secure computation server apparatuses and that accepts a received value identical to at least another received value as a correct value.