Dynamic Dispersed Data Storage for Security
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data storage solutions in distributed networks lack sufficient security measures to prevent unauthorized access and retrieval of sensitive data, particularly as access recursions and sophisticated spying devices can foil encryption over time.
Innovation Solution
A method and system that divide data into blocks and dynamically assign storage servers based on a current time instant, using binary private keys and dispersion tables to securely distribute and reconstitute data blocks, making it difficult for malicious actors to locate and retrieve the data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data is stored using static dispersion on fixed servers, then storage simplicity is maintained, but security against sophisticated spying and recursive access is insufficient
Solution Approach 1:
The patent applies dynamics by making the dispersion law time-dependent. The determination of storage servers for each data block changes according to the current time instant, transforming a static storage system into a dynamic one. This temporal variation ensures that even if attackers compromise certain servers at specific times, they cannot consistently access the same data blocks, thereby enhancing security while maintaining manageable system complexity through algorithmic time-based assignment.
2Reliability
If data blocks are assigned to fixed storage servers, then retrieval simplicity is maintained, but the system becomes vulnerable to recursive access and encryption foiling over time
Solution Approach 1:
The system uses a time-dependent dispersion law where the current time instant determines which storage servers hold which data blocks. This dynamic assignment prevents recursive access patterns while maintaining ease of operation through algorithmic determination - the same time-based algorithm used for storage also guides retrieval, ensuring consistency without requiring complex manual reassignment.
Solution Approach 2:
The patent implements periodic action by having data block assignments change at specified time intervals or time instants. This periodic reassignment disrupts any continuous access patterns that sophisticated spying devices might establish, forcing attackers to continuously adapt their methods while legitimate users experience seamless periodic changes through the automated system.
3Reliability
If encryption is used for data storage, then initial security is provided, but sophisticated spying devices can foil encryption over time through recursive access
Solution Approach 1:
The patent combines encryption with dynamic time-based dispersion to create layered security. Even if encryption is compromised over time through recursive access, the time-varying server assignment ensures that data blocks move between servers, preventing sustained access patterns. This dynamic layer extends security durability by adding temporal complexity that attackers must overcome in addition to cryptographic challenges.
Solution Approach 2:
The system performs preliminary action by pre-establishing time-based dispersion rules and server assignment algorithms before any potential security breach occurs. This preliminary configuration ensures that security measures are already in place and actively varying before attackers can establish recursive access patterns, making it significantly harder for sophisticated spying devices to foil encryption over time.
Data Source
AI summary
In the field of IT, and in particular to distributed data storage across a plurality of storage servers, the disclosed distributed backup method includes the following steps: dividing the data so as to obtain data blocks; determining, for each block, a particular server from the plurality of storage servers; and memorising each block in the determined server. The determination of the particular server is a function of a current time instant. It can also be a function of a private key of the user. The key is used to form a mask. The latter is offset as a function of the current time instant. Then, the offset mask and the complementary mask thereof are applied, respectively, to two server distribution tables in order to identify the servers to be used for each of the data blocks. The blocks can change servers at each new time instant.