Polynomial Secret Sharing for Oblivious Cloud Computation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing technologies for computing functions on stored data in a cloud storage system often require decryption of data, which is resource-intensive and may compromise the secrecy of the computational function.
Innovation Solution
The described technology employs polynomial function secret sharing, where a polynomial function is shared among multiple computing systems, allowing them to evaluate the function without knowing the complete function, thus maintaining secrecy. Each computing system receives a share of the polynomial function, computes a reconstruction share result, and combines these results to reconstruct the final result of the polynomial function.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If decryption is performed to compute functions on stored data, then the computational function can be evaluated, but the secrecy of the computational function is compromised and computational overhead increases
Solution Approach 1:
The patent segments the computational function into multiple function shares, distributing them across multiple computing systems. Each system holds only a portion of the function information, making it impossible to reconstruct the complete function without collaborating with other systems. This segmentation maintains secrecy while enabling computation through coordinated operations on the shared data.
2Reliability
If polynomial function secret sharing is implemented, then secrecy of the function is maintained, but the system complexity increases due to multiple computing systems and share distribution
Solution Approach 1:
The patent introduces an intermediary polynomial structure that mediates between the original function and its shares. The polynomial serves as a mathematical construct that distributes function information across multiple systems while maintaining the ability to reconstruct the original function. This intermediary approach systematically manages the complexity of secret sharing by providing a structured framework for distribution and reconstruction.
Data Source
AI summary
Polynomial function secret sharing provides for computation of reconstruction share results for a polynomial function on an input. An allocatable share of the polynomial function is received at a computing system of the share result computation systems. The allocatable share is generated from the polynomial function. Each of the allocatable shares is distributed to a unique share result computation system of the share result computation systems. Each allocatable share includes a share element for each coefficient in the polynomial function, wherein the share elements for a coefficient across the share result computation systems summing to the coefficient. A reconstruction share result is generated at the computing system by computing a dot product of the input and the allocatable share received by the computing system. A combination of the reconstruction share results generated by the share result computation systems yields a reconstructed result of the polynomial function on the input.