Secure Computation Array Reference via Discriminant Share Shuffling
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secure computation systems face challenges in reducing communication costs while maintaining flexibility, especially when combining different types of secure computation processes.
Innovation Solution
A secure computation system comprising at least three secure computation server apparatuses connected via a network, which generates discriminant shares, configures and shuffles combinations of shares, reconstructs discriminant shares, and selects shares of an array element based on a specific value, thereby reducing communication costs without compromising flexibility.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If secure computation systems use traditional array reference methods to maintain flexibility for combining different types of secure computation, then adaptability is improved, but communication cost increases
Solution Approach 1:
The patent segments the array reference operation into multiple independent phases: discriminant share generation, combination configuration, shuffling, reconstruction, and selection. Each phase processes only necessary data portions, reducing overall communication volume while maintaining the ability to handle different secure computation types through the modular phase structure.
Solution Approach 2:
The patent performs preliminary actions by pre-configuring combinations of array element shares with discriminant shares for all possible index combinations before the actual array reference operation. This preliminary configuration enables efficient processing during execution and reduces communication overhead during the critical array access phase.
2Quantity of substance
If secure computation systems reduce communication volume through optimization techniques, then communication cost decreases, but difficulty of applying to different secure computation systems increases
Solution Approach 1:
The patent creates a universal array reference protocol that can be applied across different secure computation systems (three-party, four-party, multiparty; based on rings or fields). The five-phase methodology works generically with any secret sharing scheme and algebraic structure, making it multi-functional and broadly applicable while consistently reducing communication volume.
Solution Approach 2:
The patent changes key parameters of the array reference operation: instead of communicating full index values or complete array elements, it uses discriminant shares that encode only necessary comparison information, and processes data in phased stages. This parameter transformation reduces communication volume from O(n) to O(log n) or constant factors while maintaining universality.
3Measurement precision
If secure computation systems perform complete reconstruction of discriminant shares for all index combinations, then accuracy of array element selection is improved, but computation time increases
Solution Approach 1:
The patent extracts only the necessary information from complete discriminant share reconstruction by using the shuffling technique. Instead of reconstructing all discriminant shares for all possible index combinations, it shuffles the combinations and reconstructs only enough to identify the correct index through the selection phase, significantly reducing computation time while maintaining accurate array element selection.
Solution Approach 2:
The patent applies partial action by performing reconstruction on a shuffled subset of discriminant share combinations rather than all possible combinations. The shuffling ensures that the partial reconstruction still enables accurate identification of the target array element through the selection logic, achieving the necessary precision with less computational effort.
Data Source
AI summary
A secure computation system comprising secure computation server apparatuses, each of which comprises: a discriminant share generation part that computes discriminant shares configured so that an index relating to an input corresponds to a specific value from shares representing the index relating to the input and possible combinations of index shares of an array; a combination configuration part that configures a combination of shares of an element in the array and the discriminant shares for all possible combinations of indices of the array; a shuffle part that shuffles the combinations; a reconstruction part that reconstructs the discriminant shares in the shuffled combinations; and a selection part that selects shares of an element in the array in the combinations where the reconstructed value is the specific value.