Secure Computation Sequence Reference With Verified Cyclic Permutations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secure computation systems face challenges in reducing communication cost and ensuring security, particularly in environments with large communication delays, such as WANs, while maintaining fraud detection capabilities.
Innovation Solution
A secure computation system utilizing a sequence reference protocol with a cyclic permutation mechanism that includes local cyclic permutation, comparison and verification, permutation synthesis, sequence shuffle, and index computation to achieve fraud detection and reduce communication rounds.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If a sequence reference protocol with constant communication rounds is used, then communication cost is reduced, but security against dishonest participants (fraud detection) cannot be ensured
Solution Approach 1:
The protocol is divided into two distinct phases: an offline preparation phase where cyclic permutations are pre-computed and verified, and an online execution phase where the actual sequence reference occurs. This segmentation allows fraud detection mechanisms to be implemented in advance without adding communication overhead during the critical online phase, thus maintaining constant communication rounds while ensuring security.
Solution Approach 2:
Cyclic permutations and their verification data are prepared in advance during the offline phase. This preliminary action enables the system to detect potential fraud before the actual computation, allowing the online phase to proceed with constant communication rounds without compromising security.
2Reliability
If cyclic permutation with verification is implemented, then security is improved, but device complexity increases
Solution Approach 1:
Cyclic permutations act as intermediary mathematical structures that enable verification without requiring complex trust mechanisms. The permutations serve as a mediator that allows participants to verify correctness through mathematical properties rather than requiring complex cryptographic protocols or trusted third parties, thus improving security while limiting complexity growth.
Solution Approach 2:
The protocol transforms the security verification problem from checking individual computation steps to verifying mathematical properties of cyclic permutations. By changing the verification parameter from step-by-step execution validation to permutation property validation, the system achieves stronger security with comparable complexity.
Data Source
AI summary
An individual secure computation server apparatus in a secure computation system computes, by using a cyclic permutation shared by secure computation server apparatuses except one of the secure computation server apparatuses, a value of a cyclic permutation for the one secure computation server apparatus, performs a fraud detection by performing an equality check on values of cyclic permutations computed by the other secure computation server apparatuses, constitutes a random cyclic permutation by synthesizing the cyclic permutations, applies the random cyclic permutation to a share in a sequence, computes a share which indicates an index and to which the random cyclic permutation has been applied by adding a share having a shift amount of the cyclic permutation to the share which indicates the index, reconstructs the share which indicates the index and to which the random cyclic permutation has been applied, and selects the share corresponding to the index.