# US 2025/0148103 A1 · Secure and efficient distributed processing

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

- Number: US 2025/0148103 A1
- Document ID: US20250148103A1
- Status: Published application
- Kind: A1
- Application number: 19/017,665
- Filed: 2025-01-12
- Published: 2025-05-08
- Earliest claimed: 2021-12-14
- Assignees: Mellanox Technologies, Ltd.
- Applicants: Mellanox Technologies, Ltd.
- Inventors: Miriam Menes; Liran Liss; Noam Bloch; Idan Borshteen; Boris Pismenny; Ariel Shahar
- Web page: https://patentgrep.com/patent/US20250148103A1

## CPC

- G06F 9/5005: {to service a request}
- G06F 21/606: {by securing the transmission between two devices or processes}
- G06F 9/5022: {Mechanisms to release resources}
- G06F 9/52: Program synchronisation; Mutual exclusion, e.g. by means of semaphores
- G06F 9/54: Interprogram communication
- G06F 21/71: to assure secure computing or processing of information
- 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/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/14: using a plurality of keys or algorithms
- G06F 2209/5014: Reservation
- G06F 2209/509: Offload
- 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

In one embodiment, a secure distributed processing system includes a plurality of nodes connected over a network, and configured to process a plurality of tasks, each one of the nodes including a processor to process task-specific data, and a network interface controller (NIC) to connect to other ones of the nodes over the network, compute task-and-node-specific communication keys for securing communication with ones of the nodes over the network based on task-specific master keys and node-specific data, and securely communicate the processed task-specific data with the ones of the nodes over the network based on the task-and-node-specific communication keys.

## Claims

### Claim 1

A secure distributed processing system, comprising a plurality of nodes connected over a network, and configured to process a plurality of tasks, each one of the nodes including:
a processor to process task-specific data; and
a network interface controller (NIC) to:
connect to other ones of the nodes over the network;
compute task-and-node-specific communication keys for securing communication with ones of the nodes over the network based on task- specific master keys and node-specific data; and
securely communicate the processed task-specific data with the ones of the nodes over the network based on the task-and-node-specific communication keys.

### Claim 2 (depends on 1)

The system according to claim 1, wherein the NIC is to:
compute task-and-node-pair-specific communication keys based on node-pair specific data; and
securely communicate the processed task-specific data with the ones of the nodes over the network based on the task-and-node-pair-specific communication keys.

### Claim 3 (depends on 2)

The system according to claim 2, wherein the node-pair specific data is based on address information of a pair of the nodes.

### Claim 4 (depends on 1)

The system according to claim 1, wherein the NIC is to secure communication of the task-specific data based on at least one of different initialization vectors (IVs) for different packets.

### Claim 5 (depends on 4)

The system according to claim 4, wherein the different IVs are based on values of a counter or a timer.

### Claim 6 (depends on 4)

The system according to claim 4, further comprising an orchestration node to trigger use of secondary task-specific master keys by the nodes upon one of the nodes recovering from failure.

### Claim 7 (depends on 6)

The system according to claim 6, wherein the orchestration node is to designate the secondary task-specific master keys as primary task-specific master keys and provide new secondary task-specific master keys to the nodes.

### Claim 8 (depends on 4)

The system according to claim 4, further comprising an orchestration node to trigger use of secondary task-specific master keys by the nodes upon one of the nodes depleting initialization vector space.

### Claim 9 (depends on 8)

The system according to claim 8, wherein the orchestration node is to designate the secondary task-specific master keys as primary task-specific master keys and provide new secondary task-specific master keys to the nodes.

### Claim 10 (depends on 4)

The system according to claim 4, wherein the NIC is to compute task-and-node-specific communication keys based on the task-specific master keys and a generation indicator.

### Claim 11 (depends on 10)

The system according to claim 10, further comprising an orchestration node to:
track the generation indicator of each of the nodes; and
advance a value of the generation indicator of a given node of the nodes that recovered from failure, wherein the given node is to inform respective ones of the nodes about the value of the generation indicator of the given node.

### Claim 12 (depends on 1)

The system according to claim 1, wherein:
the NIC of a sender node of the nodes is to compute the task-and-node-specific communication keys based on the task-specific master keys and based on data that identifies the sender node; and
the NIC of a receiver node of the nodes is to:
receive encrypted data from the NIC of the sender node;
compute a decryption key based on a given one of the task master keys and the data that identifies the sender node; and
decrypt the encrypted data based on the decryption key.

### Claim 13 (depends on 12)

The system according to claim 12, wherein the data that identifies the sender node includes sender address information.

### Claim 14 (depends on 12)

The system according to claim 12, wherein the NIC of the sender node is to secure communication of the task-specific data based on at least one of different initialization vectors (IVs) for different packets.

### Claim 15 (depends on 14)

The system according to claim 14, wherein the NIC of the receiver node is to:
receive an initialization vector from the sender node; and
decrypt the encrypted data based on the decryption key and the received initialization vector.

### Claim 16 (depends on 14)

The system according to claim 14, wherein the different IVs are based on values of a counter or a timer.

### Claim 17

A secure distributed processing method, comprising:
processing task-specific data;
connecting to other ones of a plurality of nodes over a network;
computing task-and-node-specific communication keys for securing communication with ones of the nodes over the network based on task-specific master keys and node-specific data; and
securely communicating the processed task-specific data with the ones of the nodes over the network based on the task-and-node-specific communication keys.

### Claim 18 (depends on 17)

The method according to claim 17, wherein the securely communicating is based on at least one of different initialization vectors (IVs) for different packets.

### Claim 19 (depends on 18)

The method according to claim 18, further comprising triggering use of secondary task-specific master keys by the nodes upon one of the nodes recovering from failure.

### Claim 20 (depends on 19)

The method according to claim 19, further comprising:
designating the secondary task-specific master keys as primary task-specific master keys; and
providing new secondary task-specific master keys to the nodes.

### Claim 21 (depends on 18)

The method according to claim 18, further comprising triggering use of secondary task-specific master keys by the nodes upon one of the nodes depleting initialization vector space.

### Claim 22 (depends on 21)

The method according to claim 21, further comprising:
designating the secondary task-specific master keys as primary task-specific master keys; and
providing new secondary task-specific master keys to the nodes.

### Claim 23 (depends on 18)

The method according to claim 18, wherein the computing includes computing task-and-node-specific communication keys based on the task-specific master keys and a generation indicator.

### Claim 24 (depends on 23)

The method according to claim 23, further comprising:
tracking the generation indicator of each of the nodes;
advancing a value of the generation indicator of a given node that recovered from failure; and
informing respective ones of the nodes about the value of the generation indicator of the given node.

### Claim 25 (depends on 17)

The method according to claim 17, wherein:
the computing includes computing the task-and-node-specific communication keys based on the task-specific master keys and based on data that identifies a sender node;
receiving encrypted data from the sender node;
computing a decryption key based on a given one of the task master keys and the data that identifies the sender node; and
decrypting the encrypted data based on the decryption key.
