# US 2021/0342458 A1 · Distributed data security

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

- Number: US 2021/0342458 A1
- Document ID: US20210342458A1
- Status: Published application
- Kind: A1
- Application number: 17/378,240
- Filed: 2021-07-16
- Published: 2021-11-04
- Earliest claimed: 2019-06-26
- Assignees: Seagate Technology LLC
- Applicants: Seagate Technology LLC
- Inventors: Mehmet Fatih Erden
- Web page: https://patentgrep.com/patent/US20210342458A1

## CPC

- G06F 21/602: {Providing cryptographic facilities or services}
- H04L 9/0894: {Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage}
- G06F 21/78: to assure secure storage of data (address-based protection against unauthorised use of memory G06F12/14; record carriers for use with machines and with at least a part designed to carry digital markings G06K19/00)
- H04L 9/0819: {Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s) (network architectures or network communication protocols for key distribution in a packet data network H04L63/062)}
- H04L 9/0822: {using key encryption key}
- H04L 9/0869: {involving random numbers or seeds}
- H04L 9/14: using a plurality of keys or algorithms
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method includes partitioning a received data chunk into first and second data sectors to be stored in respective first and second store units. The method also includes generating first and second random keys. The method further includes encrypting the first data sector with the second random key, and encrypting the second data sector with the first random key. The first and second random keys are encoded with channel codes. Thereafter, the first encoded random key is appended to the first encrypted data sector to obtain first appended data, and the second encoded random key is appended to the second encrypted data sector to obtain second appended data.

## Claims

### Claim 1

A method comprising:
partitioning a received data chunk into first and second data sectors to be stored in respective first and second store units;
generating first and second random keys;
encrypting the first data sector with the second random key, and not encrypting the first data sector with the first random key;
encrypting the second data sector with the first random key, and not encrypting the second data sector with the second random key;
encoding the first and second random keys with channel codes; and
appending the first encoded random key to the first encrypted data sector to obtain first appended data, and appending the second encoded random key to the second encrypted data sector to obtain second appended data.

### Claim 2 (depends on 1)

The method of claim 1 and further comprising, prior to the partitioning, selecting the first and second store suits from a plurality of available store units.

### Claim 3 (depends on 1)

The method of claim 1 and wherein partitioning the received data chunk into first and second data sectors comprises applying at least one of a plurality of partitioning criteria to separate the received data chunk into the first and second data sectors.

### Claim 4 (depends on 1)

The method of claim 1 and further comprising separately encrypting each of the first and the second appended data using a same third random key to obtain a first encrypted appended data file and a second encrypted appended data file.

### Claim 5 (depends on 4)

The method of claim 4 and further comprising:
storing the first encrypted appended data file in the first store unit; and
storing the second encrypted appended data file in the second store unit.

### Claim 6 (depends on 5)

The method of claim 5 and further comprising:
obtaining the first encrypted appended data file form the first store unit;
obtaining the second encrypted appended data file in a second store unit;
decrypting the first encrypted appended data file to obtain the first encoded random key and the first encrypted data sector; and
decrypting the second encrypted appended data file to obtain the second encoded random key and the second encrypted data sector.

### Claim 7 (depends on 6)

The method of claim 6 and further comprising:
receiving, in a distributed data security module, the first encoded random key, the first encrypted data sector, the second encoded random key, and the second encrypted data sector;
decoding the first encoded random key and the second encoded random key.

### Claim 8 (depends on 7)

The method of claim 7 and further comprising:
extracting the first data sector with the second random key; and
extracting the second data sector with the first random key.

### Claim 9

An apparatus comprising:
an interface; and
a control circuit configured to receive a data chunk via the interface and further configured to:
partition the received data chunk into first and second data sectors to be stored in respective first and second store units;
generate first and second random keys;
encrypt the first data sector with the second random key, and not encrypt the first data sector with the first random key;
encrypt the second data sector with the first random key, and not encrypt the second data sector with the second random key;
encode the first and second random keys with channel codes; and
append the first encoded random key to the first encrypted data sector to obtain first appended data, and append the second encoded random key to the second encrypted data sector to obtain second appended data.

### Claim 10 (depends on 9)

The apparatus of claim 9 and wherein the control circuit is further configured to separately encrypt each of the first and the second appended data using a same third random key to obtain a first encrypted appended data file and a second encrypted appended data file.

### Claim 11 (depends on 10)

The apparatus of claim 10 and wherein the control circuit is further configured to:
store the first encrypted appended data file in the first store unit; and
store the second encrypted appended data file in the second store unit.

### Claim 12 (depends on 11)

The apparatus of claim 11 and wherein the control circuit is further configured to:
obtain the first encrypted appended data file form the first store unit;
obtain the second encrypted appended data file in a second store unit;
decrypt the first encrypted appended data file to obtain the first encoded random key and the first encrypted data sector; and
decrypt the second encrypted appended data file to obtain the second encoded random key and the second encrypted data sector.

### Claim 13 (depends on 12)

The apparatus of claim 12 and wherein the control circuit is further configured to decode the first encoded random key and the second encoded random key.

### Claim 14 (depends on 13)

The apparatus of claim 13 and wherein the control circuit is further configured to:
extract the first data sector with the second random key; and
extract the second data sector with the first random key.

### Claim 15

A method comprising:
(a) partitioning a received data chunk F into a plurality of X data sectors, with an ith data sector being represented by Fi, the plurality of X data sectors are to be stored in different ones of X distributed store units;
(b) generating X different random keys P1, P2, . . . Px, with an ith random key of the X different random keys being represented by Pi;
(c) encrypting Fi with X-1 different ones of the random keys other than the ith random key to obtain an ith encrypted data sector F′i;
(d) encoding Pi with channel codes to obtain an ith encoded random key P′i; and
(e) appending P′i and F′i to obtain ith appended data P′iF′i;

### Claim 16 (depends on 15)

The method of claim 15 and further comprising iteratively performing (c) through (e) for i=1 through i=X, with each different iteration using a different value of i, to obtain X different appended data groups P′iF′i through P′xF′x.

### Claim 17 (depends on 16)

The method of claim 16 and further comprising separately encrypting each different one of P′1F′1 through P′xF′x with a same random key to obtain X different appended data files.

### Claim 18 (depends on 17)

The method of claim 17 and further comprising storing each different one of the X different appended data files in a respective different one of the X distributed store units.

### Claim 19 (depends on 18)

The method of claim 18 and further comprising:
obtaining the X different appended data files from the respective different ones of the X distributed store units;
decrypting the X different appended data files to obtain P′1F′1 through P′xF′x; and
decoding P′1 through P′x;.

### Claim 20 (depends on 19)

The method of claim 19 and further comprising iteratively extracting Fi from F′1 with X-1 different ones of the random keys other than the ith random key, for i=1 through and with each different iteration using a different value of i, to obtain the plurality of X data sectors.
