Multiparty Computation via Shuffled Multiplication Triples
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing multiparty computation methods are either secure only against semi-honest adversaries or require heavy pre-computation, failing to provide security against malicious adversaries without significant computational overhead.
Innovation Solution
A method for multiparty computation that involves preparing and shuffling verified multiplication triples, allowing parties to validate computations without revealing inputs, using a buffer system to refill and manage triples, ensuring security against malicious adversaries without extensive pre-computation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If heavy pre-computation is performed to achieve security against malicious adversaries, then security is improved, but computational overhead increases
Solution Approach 1:
The patent performs preliminary actions by generating and validating multiplication triples offline before the actual computation. These pre-generated triples are stored and can be quickly retrieved during computation, avoiding the need for heavy pre-computation during the actual MPC execution. This resolves the contradiction by preparing security infrastructure in advance without compromising runtime efficiency
Solution Approach 2:
The patent segments the computation into independent multiplication triples that can be validated separately. Each triple is a self-contained unit with verified multiplication relationship, allowing parallel validation and selective use during computation. This segmentation enables efficient verification without requiring comprehensive pre-computation of all possible operations
2Reliability
If all parties follow the protocol honestly to achieve semi-honest security, then security is improved, but detection capability against malicious parties deteriorates
Solution Approach 1:
The patent implements feedback mechanisms where parties receive verification information about the computation results. The validation step provides feedback to detect whether computation was performed correctly, enabling the system to identify and respond to malicious behavior. This feedback loop resolves the contradiction by maintaining security guarantees while enabling detection of protocol violations
Solution Approach 2:
The patent introduces verification information as an intermediary element that mediates between the computation results and the parties. This intermediary contains verification data that allows parties to check correctness without revealing their inputs, enabling detection capability while preserving the security guarantees of the protocol
3Reliability
If multiplication triples are generated and validated to ensure computation correctness, then reliability is improved, but time consumption increases
Solution Approach 1:
The patent performs the time-consuming generation and validation of multiplication triples in advance during an initialization phase. Once validated, these triples are stored and can be quickly retrieved and used during the actual computation without re-validation. This preliminary action resolves the contradiction by investing time upfront to save time during execution
Solution Approach 2:
The patent creates copies of validated multiplication triples that can be reused multiple times during computation. Instead of regenerating or re-validating triples for each operation, the system uses pre-validated copies, significantly reducing the time required for each individual computation while maintaining reliability
Data Source
AI summary
A method for multiparty computation wherein a plurality of parties each compute a preset function without revealing inputs thereof to others, comprises: each of the parties performing a validation step to validate that computation of the function is carried out correctly, wherein the validation step includes: a first step that prepares a plurality of verified multiplication triples and feeds a multiplication triple to a second step when required; and the second step that consumes a randomly selected multiplication triple generated by the first step, wherein the first step performs shuffling of the generated multiplication triples, in at least one of shuffle in a sequence and shuffle of sequences.