Secure Computation Apparatus for Multi-Divisor Division Efficiency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secure computation methods incur high calculation costs when performing divisions by multiple divisors or right-shifting with various shift amounts.
Innovation Solution
Obtain a secret share value [q] of the quotient q through secure computation using a secret share value [a] and modulus p, then use this [q] to efficiently calculate values obtained by dividing or right-shifting with multiple divisors or shift amounts, reducing communication and calculation overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If one secret share value is divided by multiple divisors using conventional secure computation methods, then the calculation results are obtained, but the calculation cost becomes high
Solution Approach 1:
The patent performs preliminary computation of the quotient [q] = [a]/p once, and then reuses this pre-computed value for multiple subsequent divisions by different divisors d0, d1, ..., dn-1. This preliminary action eliminates the need to recompute the quotient for each divisor, significantly reducing the overall calculation cost while maintaining security.
Solution Approach 2:
The pre-computed secret share value [q] serves multiple functions: it is used in the calculation of multiple different divisions [a/d0], [a/d1], ..., [a/dn-1]. This multi-functionality allows a single computation result to be leveraged across multiple operations, improving productivity and reducing redundant calculations.
2Measurement precision
If secure computation is performed for each division operation separately, then accurate results are obtained, but communication overhead increases
Solution Approach 1:
The patent merges multiple separate division operations into a unified computation framework where the quotient [q] is computed once and shared across all divisions. This combining approach reduces the number of independent secure computation protocols needed, thereby reducing communication overhead while preserving the accuracy of each individual division result.
3Measurement precision
If multiple secret share values are computed independently for each divisor, then calculation accuracy is maintained, but calculation time increases
Solution Approach 1:
The quotient [q] is computed as a preliminary step before the actual divisions by d0, d1, ..., dn-1. This pre-computation allows subsequent divisions to proceed more quickly using the pre-existing [q] value, significantly reducing total calculation time while maintaining the accuracy required for secure computation.
Solution Approach 2:
The patent establishes a continuous computation flow where the output of the preliminary quotient computation is immediately and continuously utilized in multiple subsequent division operations. This continuous utilization eliminates idle time and ensures that the computational resources are efficiently used across all division operations.
Data Source
AI summary
A secret share value [q] of a quotient q of a/p is obtained through secure computation using a secret share value [a] and a modulus p and [a/d0]=[(a+qp)/d0]−[q]p/d0, . . . , [a/dn−1]=[(a+qp)/dn−1]−[q]p/dn−1 are obtained and output through secure computation using secret share values [a] and [q], divisors d0, . . . , dn−1, and a modulus p. Here, [μ] is a secret share value of μ, a is a real number, n is an integer equal to or greater than 2, d0, . . . , dn−1 are divisors of real numbers, p is a modulus of a positive integer, and q is a quotient of a positive integer.