# US 2019/0377892 A1 · Encryption for a distributed filesystem

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

- Number: US 2019/0377892 A1
- Document ID: US20190377892A1
- Status: Published application
- Kind: A1
- Application number: 16/274,541
- Filed: 2019-02-13
- Published: 2019-12-12
- Earliest claimed: 2018-06-08
- Assignees: Weka.IO Ltd.
- Applicants: Weka.IO Ltd
- Inventors: Maor Ben Dayan; Omri Palmon; Liran Zvibel; Kanael Arditti; Ori Peleg
- Web page: https://patentgrep.com/patent/US20190377892A1

## CPC

- G06F 21/6218: {to a system of files or objects, e.g. local or distributed file system or database}
- H04L 9/0894: {Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage}
- G06F 11/1076: {Parity data used in redundant arrays of independent storages, e.g. in RAID systems}
- G06F 16/182: Distributed file systems
- G06F 21/602: {Providing cryptographic facilities or services}
- H04L 9/0662: {with particular pseudorandom sequence generator}
- H04L 9/0838: {Key agreement, i.e. key establishment technique in which a shared key is derived by parties as a function of information contributed by, or associated with, each of these (network architectures or network communication protocols for key exchange in a packet data network H04L63/061)}
- H04L 9/0841: {involving Diffie-Hellman or related key agreement protocols}
- H04L 9/088: {Usage controlling of secret information, e.g. techniques for restricting cryptographic keys to pre-authorized uses, different access levels, validity of crypto-period, different key- or password length, or different strong and weak cryptographic algorithms (network architectures or network communication protocols for using time-dependent keys in a packet data network H04L63/068)}
- H04L 9/0891: {Revocation or update of secret information, e.g. encryption key update or rekeying}
- H04L 9/14: using a plurality of keys or algorithms
- H04L 9/3213: {using tickets or tokens, e.g. Kerberos (network architectures or network communication protocols for entities authentication using tickets in a packet data network H04L63/0807)}
- H04L 63/0428: {wherein the data content is protected, e.g. by encrypting or encapsulating the payload}
- G06F 11/1448: {Management of the data involved in backup or backup restore}
- G06F 11/2041: {with more than one idle spare processing component}
- G06F 11/2048: {where the redundant components share neither address space nor persistent storage}
- G06F 11/2097: {maintaining the standby controller/processing unit updated (initialisation or re-synchronisation thereof G06F11/1658 and subgroups)}
- G06F 2201/815: Virtual
- G06F 2201/84: Using snapshots, i.e. a logical point-in-time copy of the data
- 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 computing device comprising a frontend and a backend is operably coupled to a plurality of storage devices. The backend comprises a plurality of buckets. Each bucket is operable to build a failure-protected stripe that spans two or more of the plurality of the storage devices. The frontend is operable to encrypt data as it enters the plurality of storage devices and decrypt data as it leaves the plurality of storage devices.

## Claims

### Claim 1

A system comprising:
a computing device comprising a frontend and a backend, wherein the frontend is operable to encrypt data as it enters the system, and wherein the backend comprises a plurality of buckets; and
a plurality of storage devices, wherein:
each bucket of the plurality of buckets is operable to build a failure-protected stripe that comprises a plurality of storage blocks,
each storage block of a failure-protected stripe is located in a different storage device of the plurality of storage devices, and
the encrypted data is stored in a file in one or more failure-protected stripes.

### Claim 2 (depends on 1)

The system of claim 1, wherein frontend is operable to decrypt data as it leaves the system.

### Claim 3 (depends on 1)

The system of claim 1, wherein the frontend encrypts the data according to a file key.

### Claim 4 (depends on 3)

The system of claim 3, wherein the file key is rotated when the file is copied.

### Claim 5 (depends on 3)

The system of claim 3, wherein all failure-protected stripes built by the plurality of buckets in the backend are associated with a filesystem key.

### Claim 6 (depends on 5)

The system of claim 5, wherein the file key is encrypted by the filesystem key.

### Claim 7 (depends on 5)

The system of claim 5, wherein the file key is re-encrypted when the filesystem key is rotated.

### Claim 8 (depends on 1)

The system of claim 1, wherein the computing device is in a cluster of computing devices, and wherein the cluster of computing devices is associated with a cluster key.

### Claim 9 (depends on 8)

The system of claim 8, wherein the computing device registers a long-term key with a leader of the cluster when the computing device joins the cluster of computing devices.

### Claim 10 (depends on 9)

The system of claim 9, wherein prior to a transfer of the data, a session key is negotiated using an ephemeral key pair signed with the long-term key.

### Claim 11

A method comprising:
opening a data file for a write access to a filesystem on a computing device, wherein:
the computing device comprises a frontend, a backend and a plurality of storage devices,
the backend comprises a plurality of buckets,
each bucket of the plurality of buckets is operable build a failure-protected stripe that comprises a plurality of storage blocks, and
each storage block of the plurality of storage blocks in a failure-protected stripe is located in a different storage device of the plurality of storage devices;
encrypting data in the frontend;
writing the encrypted data to the data file in one or more failure-protected stripes built by one or more buckets of the plurality of buckets; and
closing the data file.

### Claim 12 (depends on 11)

The method of claim 11, wherein frontend is operable to decrypt data as it is read.

### Claim 13 (depends on 11)

The method of claim 11, wherein the frontend encrypts the data according to a file key; and the method comprises purging the file key from memory after the data file is closed.

### Claim 14 (depends on 13)

The method of claim 13, wherein the method comprises rotating the file key by copying the data file.

### Claim 15 (depends on 13)

The method of claim 13, wherein all failure-protected stripes built by the plurality of buckets in the backend are associated with a filesystem key.

### Claim 16 (depends on 15)

The method of claim 15, wherein the file key is encrypted by the filesystem key.

### Claim 17 (depends on 15)

The method of claim 15, wherein the method comprises re-encrypting the file key when the filesystem key is rotated.

### Claim 18 (depends on 11)

The method of claim 11, wherein the computing device is in a cluster of computing devices, and wherein the cluster of computing devices is associated with a cluster key.

### Claim 19 (depends on 18)

The method of claim 18, wherein the method comprises registering a long-term key, of the computing device, with a leader of the cluster when the computing device joins the cluster of computing devices.

### Claim 20 (depends on 19)

The method of claim 19, wherein the method comprises:
negotiating a session key using an ephemeral key pair signed with the long-term key;
encrypting the data using the session key; and
transferring the data encrypted by the session key to the computing device.
