Mobile Proactive Secure Multi-Party Computation Protocol
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing multiparty computation protocols are inefficient and non-mobile, unable to adapt to changes in the set of servers during computation, and lack explicit details on steps and computations.
Innovation Solution
A mobile proactive secure multiparty computation protocol that generates secret sharings for input gates, uses multiplication triples for multiplication gates, and implements a Secret-Redistribute protocol to re-randomize secret sharings, allowing the set of servers to change dynamically while maintaining security.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If traditional MPC protocols are used, then security is maintained, but the protocol cannot adapt to changes in the set of servers during computation
Solution Approach 1:
The protocol transforms the static server set into a dynamic structure where servers can be added or removed during computation. This is achieved through proactive secret sharing where secrets are periodically redistributed among changing server sets, allowing the system to adapt to server failures, additions, or compromises while maintaining security guarantees.
Solution Approach 2:
The protocol performs preliminary secret sharing and redistribution actions before servers are actually compromised or changed. By proactively refreshing secret shares among servers before any compromise occurs, the system prepares for potential server changes in advance, ensuring security is maintained even as the server set evolves during computation.
2Ease of operation
If explicit detailed protocols are provided, then implementation clarity is improved, but protocol complexity increases
Solution Approach 1:
The complex MPC protocol is segmented into distinct, manageable phases: initial secret sharing, circuit evaluation with multiplication triples, and periodic secret redistribution. Each phase has well-defined inputs, operations, and outputs, making the overall complex protocol implementable through clear, modular steps while maintaining security properties.
3Productivity
If efficient computation is achieved, then productivity is improved, but communication complexity increases
Solution Approach 1:
Multiplication triples are pre-computed and distributed to servers before the actual circuit evaluation begins. This preliminary action allows multiplication operations during computation to be performed efficiently using these pre-prepared triples, reducing the communication overhead during the actual computation phase while maintaining overall efficiency.
Data Source
AI summary
Described is a system for mobile proactive secure multiparty computation using commitments. The system generates, at each server, secret sharings for each of its input gates using a Secret-Share protocol. Thereafter, sharings of inputs are generated for random gates using a GenPoly protocol. Sharings of multiplication triples are then generated for multiplication gates using a Multiplication-Triple protocol. Affine gates are then evaluated. Multiplication gates can then be evaluated using the multiplication triples and implementing a Secret-Open protocol. A Secret-Redistribute protocol is used to re-randomize the secret sharing. The Secret-Open protocol is implemented after a sharing for an output gate has been computed to reveal the secret.