Secure Bit Shift System Using Segmented Protocol
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The bit shift operation in secure computation is costly due to the need to conceal shift directions and amounts, leading to inefficiencies.
Innovation Solution
A secure shift system utilizing a protocol for left shifts with input numerical values and shift amounts, involving multiple secure shift apparatuses and specific computational steps to manage shares and flags, ensuring secure and high-speed operation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the bit shift operation is executed by the secure computation while concealing the right and left shift directions and the shift amount, then the security of numerical values and shift amounts is maintained, but the computation cost becomes large
Solution Approach 1:
The patent segments the bit shift operation into distinct phases: determining shift direction, determining shift amount, and executing the shift. By dividing the operation into separate steps with different security requirements, the system can apply appropriate security measures only where needed, reducing overall computational overhead while maintaining security for the critical components.
Solution Approach 2:
The patent changes the parameter representation by introducing separate variables for shift direction (left or right) and shift amount. This parameter transformation allows the system to handle the shift operation more efficiently by treating direction and magnitude as independent parameters that can be processed differently, rather than as a single concealed value.
2Reliability
If the bit shift operation is executed by the secure computation with full concealment of operation details, then the security is maintained, but the computational complexity increases
Solution Approach 1:
The patent divides the complex bit shift operation into manageable segments: direction determination, amount determination, and execution. Each segment has reduced computational complexity compared to the original unified operation, while together they achieve the same secure result. This segmentation reduces the overall computational complexity by allowing each part to be optimized independently.
Solution Approach 2:
The patent extracts and handles the shift direction and shift amount as separate entities from the main shift operation. By taking out these parameters and processing them independently with appropriate security measures, the main execution phase can proceed more efficiently without the overhead of fully concealing all operation details throughout the entire process.
3Reliability
If conventional secure computation protocols are used for bit shift operations, then security is maintained, but the operation speed is slow
Solution Approach 1:
The patent performs preliminary actions by determining the shift direction and shift amount before executing the actual bit shift operation. By pre-calculating and establishing these parameters with appropriate security measures in advance, the main execution phase can proceed at higher speed without the overhead of dynamic decision-making during the constrained execution phase, thus improving overall operation speed while maintaining security.
Data Source
Figure 1~2
Figure 3
Figure 4~5
AI summary
Provided is a secure computation technique for performing a bit shift operation at high speed using a protocol for performing left shift with a numerical value and a shift amount to be shifted as inputs. A secure shift system for computing a share [[s]]P of a numerical value s obtained by shifting a numerical value a by p bits from a share [[a]]P of the numerical value a and a share <<ρ>>Q of the shift amount p includes a modulus conversion means for computing a share <<ρ>>p, a first flag computation means for computing shares [[f0]]2, ..., [[fL]]2, a second flag computation means for computing shares <<f1>>p, ..., <<fL>>p, a shift amount computation means for computing shares <<ρ'>>p, a left shift means for computing a share [[b]]P, a right shift means for computing shares [[c0]]P, ..., [[cd-1]]P, a third flag computation means for computing [[f0]]P, ..., [[fL]]P, and a shift value computation means for computing the share [[s]]P.