Secret Sharing Using Repeatable Random Sequence Generator
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional data security methods, such as Shamir secret sharing, are not space-efficient and lack cryptographic security, making them inadequate for protecting data by splitting it into multiple pieces that require a minimum number of shares for reconstruction, while also being vulnerable to information leaks and computational inefficiencies.
Innovation Solution
The proposed solution employs a Repeatable Random Sequence Generator (RRSG) scheme to split data into n pieces, where only m pieces are required for reconstruction, using a hardened Shamir secret sharing method with additional security measures like obfuscation, random shuffling, and polynomial interpolation, ensuring cryptographic security and efficient storage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional Shamir secret sharing is used to split data into multiple pieces, then data can be reconstructed from minimum number of shares, but the method is not space-efficient and lacks cryptographic security
Solution Approach 1:
The patent changes the parameters of the secret sharing scheme by using Reed-Solomon codes with specific field sizes and code rates to achieve both cryptographic security and space efficiency. The system uses finite fields GF(2^8) and adjusts the (k,n) parameters to optimize the balance between security and storage overhead.
Solution Approach 2:
The patent combines multiple cryptographic primitives including Reed-Solomon error correction codes, cryptographic hashing, and random number generation to create a composite secret sharing system that achieves both security and efficiency goals that cannot be attained by any single primitive alone.
2Reliability
If data is split into multiple pieces using conventional methods, then reconstruction is possible with minimum shares, but the system is vulnerable to information leaks and computational inefficiencies
Solution Approach 1:
The patent extracts and removes unnecessary information from the secret sharing process by using information-theoretic secrets sharing that ensures no information leak occurs even when fewer than k shares are compromised. The system removes redundant computational steps by using efficient polynomial evaluation and interpolation algorithms.
Solution Approach 2:
The patent replaces conventional mechanical secret sharing implementations with cryptographic algorithms based on finite field arithmetic and error correction codes, substituting inefficient ad-hoc mechanisms with mathematically proven secure and efficient systems.
3Reliability
If repeatable random sequence generator is used to initialize polynomial coefficients, then cryptographic security is achieved, but the system complexity increases
Solution Approach 1:
The patent implements self-service by using the data itself as the seed for the repeatable random sequence generator, allowing the system to generate its own random coefficients without requiring external cryptographic keys or complex initialization procedures. The data acts as both the secret and the source of randomness for securing the sharing process.
Data Source
AI summary
Systems and methods are provided for obtaining data to be secured based on a secret sharing technique, the data being associated with a file identifier and a split specification that includes at least a number of splits n and a minimum number of splits m required for reconstructing the data, and a Repeatable Random Sequence Generator (RRSG) RRSG scheme. An RRSG state can be initialized based at least in part on a given data transformation key to provide repeatable sequence of random bytes. For every m bytes of data: a polynomial whose coefficients are determined based at least in part on m bytes of the data and a portion of the repeatable sequence of random bytes can be determined; the polynomial can be evaluated at n unique values determined by a portion of repeatable sequence of random bytes to generate n bytes. Each byte can be stored into one of the n split stores.