Secure Multiparty Computation Integrity Verification via Segmented Random Term Assignment
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secure multiparty computation protocols face challenges in detecting malicious parties and ensuring the integrity of computations, particularly in semi-honest and malicious scenarios, with existing solutions being either insecure against malicious deviations or requiring significant computational complexity.
Innovation Solution
The method involves assigning partial records to computational processes for semi-honest multiparty computations, iteratively generating random terms using secure multiparty arithmetic computations, and verifying integrity by comparing assignments to predetermined equations and constants, ensuring the detection of deviations and maintaining secure computation outcomes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If existing secure multiparty computation protocols are used to detect malicious parties and ensure computation integrity, then security is improved, but computational complexity increases significantly
Solution Approach 1:
The patent segments the computation verification process into multiple independent rounds, where each round verifies a specific aspect of computation integrity. Instead of using a single complex verification protocol, the method divides the verification into iterative rounds that each handle a portion of the computational integrity check, thereby reducing the complexity burden on any single computational step while maintaining overall security.
Solution Approach 2:
The patent applies preliminary actions by pre-establishing verification equations and constants before the actual computation occurs. The verification equations are set up in advance with predetermined constants that will be used to check computation integrity. This preliminary setup allows for simpler real-time verification during computation, as the complex mathematical framework is already in place rather than being constructed during the computation process.
2Measurement precision
If verification equations are applied iteratively to ensure computation integrity, then detection accuracy is improved, but computation time increases
Solution Approach 1:
The patent implements periodic action by applying verification equations in iterative rounds rather than continuously or all at once. Each round performs a specific verification check using the predetermined equations and constants, then proceeds to the next round. This periodic application of verification allows the system to maintain high detection accuracy through multiple checks while managing computation time by spacing out the verification operations across discrete rounds rather than requiring continuous heavy computation.
Data Source
AI summary
A method for performing secure computations on records, comprising: receiving a request to apply a computation on a record; assigning a respective partial record of a plurality of partial records of the record to each of a plurality of computational processes; instructing each of the plurality of computational processes to perform a computation scheme comprising: applying a semi honest multiparty computation on the partial record; iteratively repeating a predetermined number of times: using a secure multiparty arithmetic computation to generate random terms; using the secure multiparty arithmetic computation to assign the random terms and an outcome of the application to at least one predetermined equation; verifying an integrity of the semi honest multiparty computation by comparison of the assignments to the at least one predetermined equation to at least one constant; and when the integrity is valid, combining the applications of the semi honest multiparty computations on the partial records.