Share Generating Device for Secure Computation Data Overhead
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Secure computation devices face significant communication data overhead when using Shamir's secret sharing scheme, as the total amount of data for shares is N orders of magnitude larger than the plaintext, leading to inefficient data transmission.
Innovation Solution
A share generating device and share converting devices are implemented to generate and convert shares, reducing the total communication data by dividing function values into smaller components and using Shamir's secret sharing scheme to minimize data size, with each share being O(m/N) the size of the plaintext, and enabling secure computation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If shares are distributed among N secure computation devices in accordance with Shamir's secret sharing scheme, then secure computation can be performed, but the total amount of communication data becomes N orders of magnitude larger than the plaintext
Solution Approach 1:
The patent segments the secret sharing process into two distinct phases: a share generation phase that creates compressed share representations, and a share conversion phase that transforms these compressed shares into standard Shamir shares. This segmentation allows the system to maintain security while reducing communication overhead by only transmitting the compressed representations.
Solution Approach 2:
The patent introduces an intermediary compressed share representation format that acts as a mediator between the plaintext and the full Shamir shares. This intermediate form contains sufficient information to reconstruct the secret while occupying significantly less space than traditional Shamir shares, thereby reducing communication data by a factor of N.
2Productivity
If the total amount of communication data is reduced by using compressed share representations, then data transmission efficiency is improved, but compatibility with standard Shamir's secret sharing scheme is compromised
Solution Approach 1:
The patent performs preliminary share conversion at the generation stage, creating compressed share representations that are designed to be convertible to standard Shamir shares later. This preliminary action ensures that compatibility is built into the system from the outset, allowing seamless conversion when needed without compromising the original security properties.
Solution Approach 2:
The patent changes the parameter representation of shares from full-size Shamir shares to compressed representations that store only essential information. This parameter change reduces communication overhead while maintaining the ability to convert back to standard format when compatibility is required, thus resolving the contradiction between efficiency and adaptability.
Data Source
AI summary
A share generating device obtains N seeds s0, . . . , sN−1, obtains a function value y=g(x, e)∈Fm of plaintext x∈Fm and a function value e, and obtains information containing a member yi and N−1 seeds sd, where d∈{0, . . . , N−1} and d≠i, as a share SSi of the plaintext x in secret sharing and outputs the share SSi. It is to be noted that the function value y is expressed by members y0∈Fm(0), . . . , yN−1∈Fm(N−1) which satisfy m=m(0)+ . . . +m(N−1).