Secret Sharing Storage Backup With Minimal Restoration Fragments
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secret sharing methods increase data capacity by 1.5 times with each generation backup due to the need for storing fragment and parity data across multiple servers, even with the highest capacity efficiency.
Innovation Solution
A processing system that encrypts and divides data into fragment and parity data, storing them across multiple servers, with only the minimum number of servers necessary for data restoration performing generation backup, thereby maintaining capacity efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If secret sharing is used to store data across multiple servers, then data security is improved, but data capacity increases by 1.5 times with each generation backup
Solution Approach 1:
The patent divides data into multiple fragment files and distributes them across different storage servers. Only the minimum number of fragment files (k) are required for data restoration, while the total number of stored fragments (n) is optimized to reduce redundancy. This segmentation approach maintains data security through distributed storage while reducing the 1.5x capacity increase to a more efficient ratio of k/n.
Solution Approach 2:
The patent implements a threshold-based restoration mechanism where only k out of n fragment files are needed to restore the original data. This partial action principle allows the system to store more fragments than strictly necessary (n > k) for enhanced security and fault tolerance, while still maintaining efficient backup capacity by not requiring all n fragments for restoration operations.
2Reliability
If fragment data is distributed across multiple storage servers, then data integrity is improved, but the number of servers required for backup increases
Solution Approach 1:
The patent segments data into k fragment files that are distributed across n storage servers. This segmentation allows data integrity to be maintained through geographic and architectural distribution, while the mathematical relationship between k and n optimizes the number of servers required. The system can tolerate failures of up to (n-k) servers while maintaining data integrity.
Solution Approach 2:
The patent allows flexible adjustment of the parameters k (minimum fragments for restoration) and n (total fragments stored). By changing these parameters, the system can optimize the balance between data integrity (higher n) and server complexity (lower n). The capacity efficiency ratio k/n serves as a key parameter for tuning the system to specific operational requirements.
Data Source
AI summary
A processing system includes: a client that uploads data to be stored; and a secret sharing storage that stores pieces of fragment data obtained by dividing the uploaded data in a distributed manner across a plurality of storage servers, in which the secret sharing storage includes: a distribution server that encrypts the uploaded data and then divides the uploaded data into a plurality of the pieces of fragment data, generates a plurality of pieces of parity data for ensuring redundancy, and stores the pieces of fragment data and the pieces of parity data in a distributed manner across the plurality of storage servers, and only storage servers as many as the number of pieces of fragment data and/or the number of pieces of parity data necessary for data restoration among all the storage servers perform generation backup of the stored fragment data or the stored parity data.