Secure Computation Null Value Check via Bit Extraction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional secure computation techniques face inefficiencies in communication and the number of communication stages, particularly in performing null value checks, and lack methods for efficient handling of null value checks.
Innovation Solution
The method involves obtaining a secret sharing value of a check bit string by setting the most significant bit of a target bit string to a check bit, using rotation or multiplication in a factor ring, and then obtaining secret sharing values of bit values from the least significant bit to the check bit, reducing communication and computation requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional secure computation techniques are used for null value check, then the computation can be performed securely, but the amount of communication and number of communication stages are large
Solution Approach 1:
The patent extracts only the necessary check bit (most significant bit) from the full bit string representation of the secret sharing value. By setting the most significant bit to a check bit that is lower than the most significant bit position, and obtaining secret sharing values only for bit values from the least significant bit to the check bit, the method removes unnecessary communication overhead while maintaining secure computation functionality for null value detection.
2Reliability
If conventional secure computation techniques are used for null value check, then the computation can be performed securely, but the amount of communication is large
Solution Approach 1:
The patent extracts only the necessary check bit (most significant bit) from the full bit string representation of the secret sharing value. By setting the most significant bit to a check bit that is lower than the most significant bit position, and obtaining secret sharing values only for bit values from the least significant bit to the check bit, the method removes unnecessary communication overhead while maintaining secure computation functionality for null value detection.
3Measurement precision
If all bit values are processed in secure computation, then complete information is obtained, but computation efficiency decreases
Solution Approach 1:
The patent extracts only the necessary check bit (most significant bit) from the full bit string representation of the secret sharing value. By setting the most significant bit to a check bit that is lower than the most significant bit position, and obtaining secret sharing values only for bit values from the least significant bit to the check bit, the method removes unnecessary communication overhead while maintaining secure computation functionality for null value detection.
Solution Approach 2:
Instead of processing all bit values from the full bit string, the patent applies partial action by obtaining secret sharing values only for bit values from the least significant bit to the check bit. This partial processing is sufficient for null value detection purposes, achieving the required measurement precision without the computational cost of processing all bits.
Data Source
AI summary
A secret sharing value of a value represented by a “first target bit string” is used to obtain a secret sharing value of a value represented by a “first check bit string” obtained by setting a value of the most significant bit of the “first target bit string” to a value of a “first check bit” that is lower than the most significant bit. Here, the “first target bit string” corresponds to a null value when the most significant bit is 1 and corresponds to a real number when the most significant bit is 0. Next, the secret sharing value of the value represented by the “first check bit string” is used to obtain secret sharing values of bit values of the least significant bit to “first check bit” of the “first check bit string”.