Distributed Edge Storage Network with Linear Key Encoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Distributed edge storage systems face security challenges due to the risk of eavesdropping attacks, especially in heterogeneous environments where edge devices have varying memory and computational capabilities, making it difficult to implement robust security measures without compromising performance.
Innovation Solution
A distributed edge secure storage network utilizing redundant heterogeneous storage, where a file is divided into partitions and stored across multiple nodes with varying capacities, using independent linear combinations and random keys to ensure that no partial information can be decoded by an attacker accessing a subset of nodes, while maintaining data availability and resilience.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If distributed edge storage systems store data across multiple heterogeneous nodes, then data availability and reliability are improved, but security vulnerability to eavesdropping attacks increases
Solution Approach 1:
The data is divided into multiple partitions and distributed across different storage nodes. Each node stores only a portion of the encoded data, making it impossible for an attacker to reconstruct the original data by compromising a single node or a small subset of nodes. This segmentation approach maintains data availability while enhancing security.
Solution Approach 2:
Random keys are introduced as intermediaries between the original data and the stored partitions. These keys are used to encode the data partitions such that without all the keys, the stored data appears as random noise. This intermediary layer provides information-theoretic security while maintaining the distributed storage structure.
2Object-affected harmful factors
If robust security measures are implemented in heterogeneous edge storage environments, then security is improved, but system performance and operational simplicity deteriorate
Solution Approach 1:
The system changes the parameter of data representation by transforming the original data into linear combinations of partitions encoded with random keys. This parameter transformation provides strong security guarantees while maintaining simple storage and retrieval operations, as the encoding and decoding processes follow straightforward linear algebra operations.
Solution Approach 2:
Instead of storing complex security credentials or encryption keys at each heterogeneous node, the system creates simplified copies in the form of encoded partitions that inherently contain the security properties. Each node stores a simple encoded portion that contributes to the overall security without requiring the node to independently manage complex security state.
Data Source
AI summary
N storage nodes that are coupled via a network are selected to store a file of size |F| and redundancy of size |Fred|. A value Z<N is selected such that an attacker having access to Z storage nodes is unable to decode any partial information of the file. The file is divided into d partitions of size |Ps<sub2>N</sub2>|, wherein |Ps<sub2>N</sub2>| is a maximum factor of |F| subject to |Ps<sub2>N</sub2>|≤|sN|. Independent linear combinations hi's of the d partitions are created and random keys are generated and stored in the first Z of the N storage nodes. Independent linear combinations gi's of the random keys are created and combinations of the hi's and gi's are stored in the Z+1 to Nth storage nodes.