Batch-wise Multiparty Computation Verification
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current multi-party computation (MPC) protocols are not secure against active adversaries, particularly those based on Shamir secret sharing, which are passively secure and do not protect against active attacks, leading to potential data leakage and tampering.
Innovation Solution
Incorporating an additional random computation into the verification process allows for uniform random interpolations that can be verified in plain, reducing overhead and enhancing security by making the protocol actively secure without significant performance loss.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of energy
If Shamir secret sharing is used for MPC, then bandwidth efficiency is improved, but security against active adversaries deteriorates
Solution Approach 1:
The patent applies preliminary action by performing offline preprocessing to generate verified multiplication triples before the actual MPC execution. These pre-computed triples are stored and later used during the online phase to efficiently verify computations without compromising security. This resolves the contradiction by preparing security mechanisms in advance, allowing the system to maintain both bandwidth efficiency and active security.
Solution Approach 2:
The patent introduces an intermediary verification mechanism using multiplication triples that act as mediators between the computation parties. These triples serve as intermediate proofs that allow parties to verify each other's computations without directly sharing private data. This intermediary layer enables active security while preserving the bandwidth efficiency of Shamir secret sharing.
2Reliability
If verification is added to MPC protocols, then security against active attackers is improved, but computational overhead increases
Solution Approach 1:
The patent significantly reduces online verification overhead by performing the computationally intensive work offline. Multiplication triples are generated and verified in an offline preprocessing phase, so that during the actual MPC execution, verification requires only simple local computations. This resolves the contradiction by moving the heavy computational burden to when it doesn't impact the productivity of the main computation.
Solution Approach 2:
The patent segments the MPC protocol into distinct offline preprocessing phases and online execution phases. The verification mechanism is separated into these segments, with complex verification operations performed offline and only lightweight checks required online. This segmentation allows security verification to be implemented without significantly impacting the productivity of the main computation workflow.
3Ease of manufacture
If passively secure protocols are used, then implementation simplicity is improved, but protection against active attacks deteriorates
Solution Approach 1:
The patent introduces multiplication triples as intermediary objects that enable active security without fundamentally changing the passively secure protocol structure. These triples act as additional mediators that parties exchange and verify, providing protection against active attacks while maintaining the relative simplicity of the underlying Shamir secret sharing protocol. The core protocol remains unchanged, with the intermediary triples adding the necessary security layer.
Data Source
AI summary
Some embodiments are directed to a computation device configured for batch-wise multiparty verification of a computation which has been performed multiple times. The computations being multiparty computations that are cryptographically shared between the computation device and multiple other computation devices. The computation device is configured to perform the computation a further time to obtain a randomizing computation on a randomizing set of values.