# US 2022/0012228 A1 · Secure information retrieval and update

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

- Number: US 2022/0012228 A1
- Document ID: US20220012228A1
- Status: Published application
- Kind: A1
- Application number: 17/381,916
- Filed: 2021-07-21
- Published: 2022-01-13
- Earliest claimed: 2017-03-10
- Assignees: Symphony Communication Services Holdings LLC
- Applicants: Symphony Communication Services Holdings LLC
- Inventors: Christian Tschudin; David M'Raihi
- Web page: https://patentgrep.com/patent/US20220012228A1

## CPC

- G06F 16/2358: {Change logging, detection, and notification (replication G06F16/27)}
- G06F 16/244: {Grouping and aggregation}
- G06F 21/6227: {where protection concerns the structure of data, e.g. records, types, queries}
- G06F 21/6254: {by anonymising data, e.g. decorrelating personal data from the owner's identification}
- G06F 21/6263: {during internet communication, e.g. revealing personal data from cookies}
- H04L 9/0891: {Revocation or update of secret information, e.g. encryption key update or rekeying}
- H04L 9/0894: {Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage}
- 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 16/278: {Data partitioning, e.g. horizontal or vertical partitioning}
- H04L 67/1095: Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
- 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 secure storage module of a client device interacts with a set of secure storage servers to securely store data items of the client on the servers, such that no individual server has the data in readable (non-obfuscated) form. Additionally, the client secure storage module and the servers interact to allow the client device to read a given portion of the original data items from the servers, such that none of the servers can determine which portion of the original data is being requested. Similarly, the interactions of the client secure storage module and the servers allows the client device to update a given portion of the original data on the servers to a new value, such that none of the servers can determine which portion is being updated and that none of the servers can determine either the prior value or new value or the difference between the new value and the prior value.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A computer-implemented method comprising:
initializing a plurality of obfuscated portions to random bit values such that a sum of two of the plurality of obfuscated portions is zero;
distributing bits of a data item among the plurality of obfuscated portions,
wherein each of the plurality of obfuscated portions includes a subset of content of the data item,
wherein the data item and the plurality of obfuscated portions comprise bit matrices in which each matrix element is a bit; and
distributing the obfuscated portions from a source computer to a plurality of servers,
wherein each of the servers stores a respective obfuscated portion from the plurality of obfuscated portions.

### Claim 22 (depends on 21)

The method of claim 21, wherein the data item and the plurality of obfuscated portions comprise bit matrices of equal size.

### Claim 23 (depends on 21)

The method of claim 21, further comprising:
distributing to the servers a plurality of query vectors in which each vector element is a bit, the query vectors collectively identifying a sub-portion of the data item,
wherein the sub-portion is not derivable from any given one of the query vectors, and
wherein distributing the plurality of query vectors comprises sending to each server from the plurality of servers a respective query vector from the plurality of query vectors; and
determining a value of the sub-portion using a plurality of query result vectors received from the plurality of servers in response to the plurality of query vectors,
wherein determining the new value comprises combining the plurality of query result vectors.

### Claim 24 (depends on 23)

The method of claim 23, wherein the sub-portion is a row of the data item.

### Claim 25 (depends on 23)

The method of claim 23, wherein each query vector comprises one element for each row of the data item.

### Claim 26 (depends on 23)

The method of claim 23, wherein each query result vector in the plurality of query result vectors comprises a matrix-vector product of (i) a query vector from the plurality of query vectors and (ii) an obfuscated portion from the plurality of obfuscated portions.

### Claim 27 (depends on 23)

The method of claim 23, wherein determining the value of the sub-portion comprises computing a bitwise sum of the query result vectors.

### Claim 28 (depends on 21)

The method of claim 21, further comprising:
identifying a row of the data item to update from a current value to a new value;
computing an update delta value for the row of the data item based on the current value and the new value; and
distributing update messages based on the update delta value to the plurality of servers, the update messages causing the plurality of servers to update the corresponding plurality of obfuscated portions stored by the servers using the update delta value so as to update the current value of the row from the current value to the new value, the update messages collectively indicating the row to update such that the row is not derivable from any given one of the update messages.

### Claim 29 (depends on 28)

The method of claim 28, wherein distributing update messages based on the update delta value comprises:
for each server from the plurality of servers:
generating a randomized component;
generating an update message comprising the randomized component and the update delta value; and
sending the generated update message to the server.

### Claim 30 (depends on 29)

The method of claim 29, wherein the randomized component is either a vector of random bits, or a combination of a vector of random bits with a vector representing a row index of the row.

### Claim 31

A system comprising:
one or more computer processors programmed to perform operations comprising:
initializing a plurality of obfuscated portions to random bit values such that a sum of two of the plurality of obfuscated portions is zero;
distributing bits of a data item among the plurality of obfuscated portions,
wherein each of the plurality of obfuscated portions includes a subset of content of the data item,
wherein the data item and the plurality of obfuscated portions comprise bit matrices in which each matrix element is a bit; and
distributing the obfuscated portions from a source computer to a plurality of servers,
wherein each of the servers stores a respective obfuscated portion from the plurality of obfuscated portions.

### Claim 32 (depends on 31)

The system of claim 31, wherein the data item and the plurality of obfuscated portions comprise bit matrices of equal size.

### Claim 33 (depends on 31)

The system of claim 31, the operations further comprising:
distributing to the servers a plurality of query vectors in which each vector element is a bit, the query vectors collectively identifying a sub-portion of the data item,
wherein the sub-portion is not derivable from any given one of the query vectors, and
wherein distributing the plurality of query vectors comprises sending to each server from the plurality of servers a respective query vector from the plurality of query vectors; and
determining a value of the sub-portion using a plurality of query result vectors received from the plurality of servers in response to the plurality of query vectors,
wherein determining the new value comprises combining the plurality of query result vectors.

### Claim 34 (depends on 33)

The system of claim 33, wherein the sub-portion is a row of the data item.

### Claim 35 (depends on 33)

The system of claim 33, wherein each query vector comprises one element for each row of the data item.

### Claim 36 (depends on 33)

The system of claim 33, wherein each query result vector in the plurality of query result vectors comprises a matrix-vector product of (i) a query vector from the plurality of query vectors and (ii) an obfuscated portion from the plurality of obfuscated portions.

### Claim 37 (depends on 33)

The system of claim 33, wherein determining the value of the sub-portion comprises computing a bitwise sum of the query result vectors.

### Claim 38 (depends on 31)

The system of claim 31, the operations further comprising:
identifying a row of the data item to update from a current value to a new value;
computing an update delta value for the row of the data item based on the current value and the new value; and
distributing update messages based on the update delta value to the plurality of servers, the update messages causing the plurality of servers to update the corresponding plurality of obfuscated portions stored by the servers using the update delta value so as to update the current value of the row from the current value to the new value, the update messages collectively indicating the row to update such that the row is not derivable from any given one of the update messages.

### Claim 39 (depends on 38)

The system of claim 38, wherein distributing update messages based on the update delta value comprises:
for each server from the plurality of servers:
generating a randomized component;
generating an update message comprising the randomized component and the update delta value; and
sending the generated update message to the server.

### Claim 40

A storage device comprising:
a non-transitory, computer-readable storage medium storing instructions that when executed by one or more computer processors perform actions comprising:
initializing a plurality of obfuscated portions to random bit values such that a sum of two of the plurality of obfuscated portions is zero;
distributing bits of a data item among the plurality of obfuscated portions,
wherein each of the plurality of obfuscated portions includes a subset of content of the data item,
wherein the data item and the plurality of obfuscated portions comprise bit matrices in which each matrix element is a bit; and
distributing the obfuscated portions from a source computer to a plurality of servers,
wherein each of the servers stores a respective obfuscated portion from the plurality of obfuscated portions.
