Solitary Multi-Party Computation Round Efficiency via Preliminary Broadcasting
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Secure multi-party computations, particularly solitary MPC, are often slower due to the need for multiple rounds of communication involving computationally intensive cryptographic operations, leading to latency issues over networks, making them unsuitable for many real-world applications.
Innovation Solution
The development of protocols that optimize the round efficiency for solitary secure multi-party computations by utilizing broadcasting communication infrastructure and public key infrastructure (PKI) to reduce the number of communication rounds, ensuring guaranteed output delivery in the honest majority setting, including methods like encrypting inputs, signing, and partially decrypting outputs to facilitate faster computation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple rounds of communication with cryptographic operations are used to ensure security, then security is improved, but computation time and latency increase
Solution Approach 1:
The protocol performs preliminary actions by having all parties broadcast their encrypted inputs and signatures in advance (Round 1), allowing the output party to collect all necessary data before decryption. This preliminary exchange of authenticated data enables the output party to independently verify inputs and compute the function without requiring iterative verification rounds, thus reducing total computation time while maintaining security through pre-established cryptographic proofs.
Solution Approach 2:
The computation process is segmented into distinct cryptographic phases: input encryption phase, signature generation phase, and output decryption phase. Each party independently performs encryption and signing on their input shares, then the output party combines these segmented cryptographic operations to compute the final result. This segmentation allows parallel execution of independent cryptographic tasks, improving efficiency while preserving security guarantees.
2Reliability
If multiple rounds of communication are used to verify data consistency, then reliability is improved, but network latency increases
Solution Approach 1:
Digital signatures act as cryptographic intermediaries that provide implicit verification of data consistency. Instead of requiring multiple explicit verification rounds where parties exchange and check data consistency, each party signs their encrypted input, creating a cryptographic intermediary that proves authenticity and consistency. The output party verifies these signatures once, achieving reliable verification without iterative communication rounds, thus reducing network latency while maintaining data consistency guarantees.
3Reliability
If computationally intensive cryptographic operations are performed, then security is improved, but processing speed decreases
Solution Approach 1:
The protocol merges the verification function into the computation process itself. The output party combines all encrypted inputs and signatures into a single decryption operation, performing one comprehensive cryptographic computation rather than multiple separate verification and computation rounds. This merging of verification and computation tasks reduces the total number of intensive cryptographic operations required, improving processing speed while maintaining security through the combined cryptographic proof.
Data Source
AI summary
Several round-efficient solitary multi-party computation protocols with guaranteed output delivery are disclosed. A plurality of input devices and an output device can collectively perform a computation using methods such as fully homomorphic encryption. The output of the computation is only known to the output device. Some number of these devices may be corrupt. However, even in the presence of corrupt devices, the output device can still either generate a correct output or identify that the computation was compromised. These protocols operate under different assumptions regarding the communication infrastructure (e.g., broadcast vs point-to-point), the number of participating devices, and the number of corrupt devices. These protocols are round-efficient in that they require a minimal number of communication rounds to calculate the result of the multi-party computation.