US 2022/0070211 A1 · DISTRIBUTED SECURE EDGE HETEROGENEOUS STORAGE NETWORK WITH REDUNDANT STORAGE AND BYZANTINE ATTACK RESILIENCE

Abstract

Distributed storage of a file in edge storage devices that is resilient to eavesdropping adversaries and Byzantine adversaries. Approaches include a cost-efficient approach in which an authorized user has access to the content of all edge storage nodes. In this approach, key blocks and file blocks that are masked with key blocks are saved in the edge storage nodes. Additionally, redundant data for purposes of error correction are also stored. In turn, upon retrieval of all blocks, errors introduced by a Byzantine adversary may be corrected. In a loss resilient approach, redundant data is stored along with masked file partitions. Upon retrieval of blocks from the edge storage nodes, a unique approach to solving for the unknown file partition values is applied with identification of corrupt nodes based on an average residual error value for each storage node.

Claims25

Dependent claims

-21. (canceled)

A method for secure distributed storage of information regarding a file in a plurality of distributed edge storage nodes, comprising:

selecting N storage nodes that are coupled via a network to store a file of size |F| and redundancy data of size |Fred|, wherein at least two of the N storage nodes allocate different sizes of memory for storing the file, the N storage nodes being ordered from a largest storage capacity |s1| at the first storage node to a smallest capacity |sN| at the Nth storage node, and the N storage nodes being at least in part based on an average error calculation for a number of t random nodes selected from N for a maximum number of Zb corrupted nodes;
selecting a value Ze<N, wherein an attacker having access to Ze storage nodes is unable to decode the file;
dividing the file into file partitions;
generating keys that are stored in the first Ze of the N storage nodes;
creating storage blocks comprising independent linear combinations of the keys and the file partitions;
and
storing the storage packets comprising independent linear combinations of the keys and the file partitions in the Ze+1 to Nth storage nodes.

4 more elements

A distributed secure edge storage system, comprising:

at least N storage nodes that are coupled via a network to store a file of size |F| and redundancy data of size |Fred|, wherein at least two of the N storage nodes allocate different sizes of memory for storing the file, the N storage nodes being ordered from a largest storage capacity |s1| at the first storage node to a smallest capacity |sN| at the Nth storage node, and the N storage nodes being at least in part based on an average error calculation for a number of t random nodes selected from N for a maximum number of Zb corrupted nodes;
a storage processing apparatus coupled to the network and operable to:
select a value Ze<N, wherein an attacker having access to Ze storage nodes is unable to decode the file;
divide the file into file partitions;
generate keys that are stored in the first Ze of the N storage nodes;
create storage blocks comprising independent linear combinations of the keys and the file partitions;
and
store the storage packets comprising independent linear combinations of the keys and the file partitions in the Ze+1 to Nth storage nodes.

5 more elements

One or more tangible processor-readable storage media embodied with instructions for executing on one or more processors and circuits of a device a process for secure distributed storage of information regarding a file in a plurality of distributed edge storage nodes comprising:

selecting N storage nodes that are coupled via a network to store a file of size |F| and redundancy data of size |Fred|, wherein at least two of the N storage nodes allocate different sizes of memory for storing the file, the N storage nodes being ordered from a largest storage capacity |s1| at the first storage node to a smallest capacity |sN| at the Nth storage node, and the N storage nodes being at least in part based on an average error calculation for a number of t random nodes selected from N for a maximum number of Zb corrupted nodes;
selecting a value Ze<N, wherein an attacker having access to Ze storage nodes is unable to decode the file;
dividing the file into file partitions;
generating keys that are stored in the first Ze of the N storage nodes;
creating storage blocks comprising independent linear combinations of the keys and the file partitions;
and
storing the storage packets comprising independent linear combinations of the keys and the file partitions in the Ze+1 to Nth storage nodes.

4 more elements

Dependencies are inferred from the claim text.

Distributed secure edge heterogeneous storage network with redundant storage and byzantine attack resilience

Life of this patent

Distributed secure edge heterogeneous storage network with redundant storage and byzantine attack resilience

Life of this patent

Abstract

Claims25