# US 2019/0356416 A1 · Distributed storage system data management and security

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0356416 A1
- Document ID: US20190356416A1
- Status: Published application
- Kind: A1
- Application number: 16/362,209
- Filed: 2019-03-22
- Published: 2019-11-21
- Earliest claimed: 2016-03-15
- Assignees: Datomia Research Labs OU
- Applicants: Datomia Research Labs OU
- Inventors: David Yanovsky; Teimuraz Namoradze; Vera Dmitriyevna Miloslavskaya
- Web page: https://patentgrep.com/patent/US20190356416A1

## CPC

- H03M 13/373: {with erasure correction and erasure determination, e.g. for packet loss recovery or setting of erasures for the decoding of Reed-Solomon codes}
- H04L 1/0057: {Block codes (H04L1/0061, H04L1/0064 take precedence)}
- G06F 3/0619: {in relation to data integrity, e.g. data losses, bit errors}
- G06F 3/0623: {in relation to content}
- G06F 3/0635: {by changing the path, e.g. traffic rerouting, path reconfiguration}
- G06F 3/064: {Management of blocks}
- G06F 3/065: {Replication mechanisms}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 11/1076: {Parity data used in redundant arrays of independent storages, e.g. in RAID systems}
- G06F 11/1088: {Reconstruction on already foreseen single or plurality of spare disks}
- G06F 12/0253: {Garbage collection, i.e. reclamation of unreferenced memory}
- G06F 12/0848: {Partitioned cache, e.g. separate instruction and operand caches}
- G06F 12/1408: {by using cryptography (for digital transmission H04L9/00)}
- G06F 12/1466: {Key-lock mechanism}
- G06F 16/1752: {based on file chunks}
- G06F 16/1824: {implemented using Network-attached Storage [NAS] architecture (distributed or networked storage systems G06F3/067; protocols for distributed storage of data in a network H04L67/1097)}
- G06F 21/00: Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F 21/6218: {to a system of files or objects, e.g. local or distributed file system or database}
- H03M 13/13: Linear codes
- H03M 13/1515: {Reed-Solomon codes}
- H03M 13/2921: {wherein error correction coding involves a diagonal direction}
- H03M 13/616: {Matrix operations, especially for generator matrices or check matrices, e.g. column or row permutations}
- H04L 1/0041: {Arrangements at the transmitter end}
- H04L 1/0075: {Transmission of coding parameters to receiver (H04L1/0023 takes precedence)}
- H04L 9/0863: {involving passwords or one-time passwords (network architectures or network communication protocols for using one-time keys in a packet data network H04L63/067)}
- H04L 9/0894: {Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage}
- H04L 9/3226: {using a predetermined code, e.g. password, passphrase or PIN (network architectures or network communication protocols for supporting authentication of entities using passwords in a packet data network H04L63/083)}
- H04L 63/0428: {wherein the data content is protected, e.g. by encrypting or encapsulating the payload}
- H04L 67/1097: for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
- G06F 2212/1052: Security improvement
- G06F 2212/282: Partitioned cache
- G06F 2212/702: Conservative garbage collection
- G06F 2221/2107: File encryption
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Secure distributed storage and transmission of electronic content is provided over at least one communication network. At least one data file is received and parsed into a plurality of segments, wherein each one of the segments has a respective size. Thereafter, each of the plurality of segments is divided into a plurality of slices, wherein each one of the slices has a respective size. A plurality of data chunks are encoded, each data chunk comprising a portion of at least two of the slices, wherein no portion comprises an entire slice. The data chunks are packaged with at least metadata, and each of the packages is assigned to respective remote storage nodes. Each of the packages is transmitted to the respectively assigned remote storage node.

## Claims

### Claim 1

A method for providing secure distributed storage and transmission of electronic content over at least one communication network, the method comprising:
receiving, by at least one processor configured by executing instructions stored on processor-readable media, at least one data file;
parsing, by the at least one processor, the at least one data file into a plurality of segments, wherein each one of the segments has a respective size;
dividing, by the at least one processor, each of the plurality of segments into a plurality of slices, wherein each one of the slices has a respective size;
encoding, by the at least one processor, a plurality of data chunks, each data chunk comprising a portion of at least two of the slices, wherein no portion comprises an entire slice;
packaging, by the at least one processor, each of the data chunks with at least metadata;
assigning, by the at least one processor, each of the packages to respective remote storage nodes; and
transmitting, by the at least one processor, each of the packages to the respectively assigned remote storage node.

### Claim 2 (depends on 1)

The method of claim 1, wherein the step of packaging includes erasure coding, wherein the metadata is encoded and not visible to unauthorized users.

### Claim 3 (depends on 2)

The method of claim 2, further comprising abstracting, by the at least one processor, the metadata with two or more of: additional metadata associated with a respective remote storage node; a configuration of a data vault; a hyperlink to an active data vault; and information representing a current state of data blocks.

### Claim 4 (depends on 1)

The method of claim 1, wherein the metadata includes information for reconstructing related segments from corresponding packages and/or information for reconstructing the at least one data file from the plurality of segments.

### Claim 5 (depends on 1)

The method of claim 1, wherein each of the packages include at least some redundant information from at least one other package.

### Claim 6 (depends on 1)

The method of claim 1, further comprising determining by the at least one processor at least one parameter representing at least one of available network bandwidth, geographic proximity, and node availability, wherein selection of respective remote storage nodes is made as a function of the at least one parameter.

### Claim 7 (depends on 1)

The method of claim 1, further comprising applying, by the at least one processor, categories of data, wherein the step of encoding is based at least in part on a respective category.

### Claim 8 (depends on 1)

The method of claim 1, wherein the respective storage nodes are provided as network addressable storage.

### Claim 9 (depends on 1)

The method of claim 1, further comprising providing, by the at least one processor, a graphical user interface that is configured to display at least one map showing locations of the respective storage nodes and a respective operational status of the respective storage nodes.

### Claim 10 (depends on 9)

The method of claim 9, wherein the graphical user interface includes an interactive dashboard that identifies information associated with available storage space, used space, and a number of stored data objects.

### Claim 11

A system for providing secure distributed storage and transmission of electronic content over at least one communication network, the system comprising:
at least one processor, wherein the at least one processor is configured by executing instructions stored on processor-readable media to perform the steps of:
receiving at least one data file;
parsing the at least one data file into a plurality of segments, wherein each one of the segments has a respective size;
dividing each of the plurality of segments into a plurality of slices, wherein each one of the slices has a respective size;
encoding a plurality of data chunks, each data chunk comprising a portion of at least two of the slices, wherein no portion comprises an entire slice;
packaging each of the data chunks with at least metadata;
assigning each of the packages to respective remote storage nodes; and
transmitting each of the packages to the respectively assigned remote storage node.

### Claim 12 (depends on 11)

The system of claim 11, wherein the step of packaging includes erasure coding, wherein the metadata is encoded and not visible to unauthorized users.

### Claim 13 (depends on 12)

The system of claim 12, wherein the processor-readable media further have instructions that, when executed by the at least one processor, cause the at least one processor to abstract the metadata with two or more of: additional metadata associated with a respective remote storage node; a configuration of a data vault; a hyperlink to an active data vault; and information representing a current state of data blocks.

### Claim 14 (depends on 11)

The system of claim 11, wherein the metadata includes information for reconstructing related segments from corresponding packages and/or information for reconstructing the at least one data file from the plurality of segments.

### Claim 15 (depends on 11)

The system of claim 11, wherein each of the packages include at least some redundant information from at least one other package.

### Claim 16 (depends on 11)

The system of claim 11, wherein the processor-readable media further have instructions that, when executed by the at least one processor, cause the at least one processor to determine at least one parameter representing at least one of available network bandwidth, geographic proximity, and node availability, wherein selection of respective remote storage nodes is made as a function of the at least one parameter.

### Claim 17 (depends on 11)

The system of claim 11, wherein the processor-readable media further have instructions that, when executed by the at least one processor, cause the at least one processor to apply categories of data, wherein the step of encoding is based at least in part on a respective category.

### Claim 18 (depends on 11)

The system of claim 11, wherein the respective storage nodes are provided as network addressable storage.

### Claim 19 (depends on 11)

The system of claim 11, wherein the processor-readable media further have instructions that, when executed by the at least one processor, cause the at least one processor to provide a graphical user interface that is configured to display at least one map showing locations of the respective storage nodes and a respective operational status of the respective storage nodes.

### Claim 20 (depends on 19)

The system of claim 19, wherein the graphical user interface includes an interactive dashboard that identifies information associated with available storage space, used space, and a number of stored data objects.
