Secure Computation Verification Using Shuffled Share Multiplication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secure computation technologies are limited by their security levels, particularly in the random oracle model, and lack flexibility in the number of participants, restricting their applicability.
Innovation Solution
A secure computation system and method that employs a plurality of secure computation server apparatuses connected via a network, utilizing a table storage part, table shuffle part, and comparative verification part to perform secure computation of secret shares, ensuring correct results even with adversaries present, through a (N−3t)-out-of-N replicated secret sharing scheme and pseudorandom functions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If secure computation is performed using a limited number of participants (e.g., four), then the computation process can be completed, but the flexibility and applicability are restricted
Solution Approach 1:
The secure computation system is designed to handle an arbitrary number of participants through universal protocols that work regardless of participant count. The multiplication protocol and verification mechanisms are formulated in a general manner that accommodates any number of servers, making the system versatile and adaptable to different scenarios without requiring redesign for specific participant numbers.
2Reliability
If the secure computation system detects an adversary and interrupts the process, then security is maintained, but computation continuity is lost
Solution Approach 1:
The system implements continuous feedback mechanisms through verification protocols where participants exchange proof data and verify each other's computations. This feedback loop allows the system to detect adversarial behavior while maintaining computation flow, as the verification process occurs incrementally throughout the computation rather than requiring complete interruption upon suspicion.
Solution Approach 2:
The system performs preliminary verification actions by having participants submit proof data and undergo verification before completing critical computation steps. This preliminary action ensures security checks are in place beforehand, allowing the computation to proceed continuously without interruption when adversaries are detected, as the verification framework is already established.
3Reliability
If secure computation relies on the random oracle model premise, then security can be achieved, but the security level is limited compared to standard model
Solution Approach 1:
The system changes the security parameter framework by implementing verification protocols that do not depend on the random oracle model assumption. Instead, it uses concrete verification mechanisms based on cryptographic proofs that can operate under standard model assumptions, thereby elevating the security level while managing complexity through practical verification procedures rather than theoretical assumptions.
Data Source
AI summary
A secure computation server apparatus in a secure computation system includes: a table storage part that stores a table of secret shares of the product of a first value and a second value for combinations of shares of possible values of the first value and shares of possible values of the second value; a table shuffle part that shuffles indices of possible values of the first value and indices of possible values of the second value in the table; a multiplication part that selects an element in the table whose indices in the shuffled table match the first and the second values; and a comparative verification part that accepts data that a majority of other secure computation server apparatuses agrees on as a correct value out of a plurality of data received from the other secure computation server apparatuses.