# US 2025/0062896 A1 · Integrity and Privacy-Preserving Federated Learning in a Smart Factory Using Smart Contracts and Merkle Tree-Based Key Management

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

- Number: US 2025/0062896 A1
- Document ID: US20250062896A1
- Status: Published application
- Kind: A1
- Application number: 18/809,169
- Filed: 2024-08-19
- Published: 2025-02-20
- Earliest claimed: 2023-08-17
- Assignees: University of South Florida
- Applicants: University of South Florida
- Inventors: Zixiang Nie; Kwang-Cheng Chen
- Web page: https://patentgrep.com/patent/US20250062896A1

## CPC

- H04L 9/0858: {Details about key distillation or coding, e.g. reconciliation, error correction, privacy amplification, polarisation coding or phase coding}
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

An example system and method that can provide integrity and privacy-preserving communication and integrated operation in smart factory and other IOT applications using smart contracts in blockchain and Merkle Tree-based key management operations. The exemplary Merkle tree-based key management can ensure all communication, control operations, and shared models (e.g., Federated Learning models) are encrypted prior to transmission and sharing with other nodes in the network, with keys being split into parts to each of multiple recipients and later assembled to allow blocking consensus/validation to be performed.

## Claims

### Claim 1

A non-transitory computer readable medium having instructions stored thereon, wherein execution of the instructions by a processor of an equipment of a decentralized, autonomous multi-robot system comprising a plurality of robots and edge nodes causes the processor to:
execute control software for a decentralized, autonomous multi-robot system for on-demand production, the system having adaptive and resilience productivity and resource efficiency, each system comprising:
a blockchain module comprising smart contracts as a unified automation framework; and
a Merkle tree-based key management module for privacy preservation, wherein the key management ensures information exchange in the system is encrypted prior to data exchange and decryption requiring the joint effort of recipients.

### Claim 2 (depends on 1)

The non-transitory computer readable medium of claim 1, wherein the on-demand production employ a machine learning model trained using Federated Learning (FL) for adaptive production.

### Claim 3 (depends on 1)

The non-transitory computer readable medium of claim 1, wherein execution of the instructions by the processor of the equipment causes the processor to:
execute the Merkle tree-based key management module and the blockchain module;
encrypt control or communication data to be shared with a plurality of robots and associated edge nodes as an encrypted message using a key;
generate, via a hashing operation, (i) a complete key hash as a hash of the key and (ii) a Merkle tree having nodes comprising a plurality of partial key hashes split from the complete key hash;
add and transmit, via the blockchain module, as new block of a blockchain, the encrypted message and the complete key hash, wherein the blockchain is distributed to the plurality of robots or associated edge nodes; and
transmit (i) the Merkle tree, (ii) a partial key hash of the plurality of partial key hashes, and (iii) a partial key of the plurality of partial keys to each respective node of the plurality of robots or associated edge nodes,
wherein each respective node of the plurality of robots or associated edge nodes is configured to (i) receive the transmitted partial key hash as a first local partial key hash and received the partial key, (ii) transmit the first local partial key hash and received partial key to a paired node among the plurality of robots or associated edge nodes, (ii) receive, at least, a second local partial key hash corresponding to the paired node from the paired node and a corresponding partial key of the second local partial key hash, (iii) construct a local complete key hash from the first local partial key hash and, at least, the second local partial key hash, (iv) validate the new block in the blockchain via a smart contract operation of the blockchain if the constructed key hash matches the complete key hash in the new block, and (v) decrypt the control or communication data from the encrypted message using a key generated from (i) the Merkle tree, (ii) the received partial key of the first local partial key hash and, at least, (iii) the received partial key of the second local partial key hash.

### Claim 4 (depends on 1)

The non-transitory computer readable medium of claim 1, wherein execution of the instructions by the processor of the equipment causes the processor to:
execute the Merkle tree-based key management module and the blockchain module;
receive, via the blockchain module, a blockchain having a new block comprising an encrypted message and a complete key hash for a message having control or the communication data, wherein the blockchain was distributed to a plurality of robots and associated edge nodes;
receive, from a delegated device corresponding to one of the plurality of robots and associated edge nodes, (i) a Merkle tree having nodes comprising a plurality of partial key hashes split from the complete key hash, (ii) a partial key hash of the plurality of partial key hashes, and (iii) a partial key of the plurality of partial keys,
receive, at least, from paired node, (i) a second local partial key hash corresponding to the paired node and (ii) a corresponding partial key of the second local partial key hash;
construct a local complete key hash from the first local partial key hash and, at least, the second local partial key hash;
validate the new block in the blockchain via a smart contract operation of the blockchain if the constructed key hash matches the complete key hash in the new block; and
decrypt the control or communication data from the encrypted message using a key generated from (i) the Merkle tree, (ii) the received partial key of the first local partial key hash and, at least, (iii) the received partial key of the second local partial key hash.

### Claim 5 (depends on 1)

The non-transitory computer readable medium of claim 1, wherein execution of the instructions by the processor of the equipment causes the processor to:
execute the Merkle tree-based key management module and the blockchain module;
encrypt control or communication data to be shared with a plurality of robots and associated edge nodes as an encrypted message using a key;
generate, via a hashing operation, (i) a complete key hash as a hash of the key and (ii) a Merkle tree having nodes comprising a plurality of partial key hashes split from the complete key hash;
add and transmit, via the blockchain module, as new block of a blockchain, the encrypted message and the complete key hash, wherein the blockchain is distributed to the plurality of robots or associated edge nodes;
transmit (i) the Merkle tree, (ii) a partial key hash of the plurality of partial key hashes, and (iii) a partial key of the plurality of partial keys to each respective node of the plurality of robots or associated edge nodes, and
transmit a randomized key part-leaf node association;
wherein each respective node of the plurality of robots or associated edge nodes is configured to (i) receive the transmitted partial key hash as a first local partial key hash and received the partial key, (ii) receive the randomized key part-leaf node association; (iii) transmit the first local partial key hash and received partial key to a paired node among the plurality of robots or associated edge nodes, (iv) receive, at least, a second local partial key hash corresponding to the paired node from the paired node and a corresponding partial key of the second local partial key hash, (v) construct a local complete key hash from the first local partial key hash and, at least, the second local partial key hash, (vi) validate the new block in the blockchain via a smart contract operation of the blockchain if the constructed key hash matches the complete key hash in the new block, and (v) decrypt the control or communication data from the encrypted message using a key generated from (i) the Merkle tree, (ii) the received partial key of the first local partial key hash, (iii) the receive the randomized key part-leaf node association and, at least, (iv) the received partial key of the second local partial key hash.

### Claim 6 (depends on 1)

The non-transitory computer readable medium of claim 1, wherein execution of the instructions by the processor of the equipment causes the processor to:
execute the Merkle tree-based key management module and the blockchain module;
receive, via the blockchain module, a blockchain having a new block comprising an encrypted message and a complete key hash for a message having control or the communication data, wherein the blockchain was distributed to a plurality of robots and associated edge nodes;
receive, from a delegated device corresponding to one of the plurality of robots and associated edge nodes, (i) a Merkle tree having nodes comprising a plurality of partial key hashes split from the complete key hash, (ii) a partial key hash of the plurality of partial key hashes, (iii) a randomized key part-leaf node association; and (iv) a partial key of the plurality of partial keys,
receive, at least, from paired node, (i) a second local partial key hash corresponding to the paired node and (ii) a corresponding partial key of the second local partial key hash;
construct a local complete key hash from the first local partial key hash and, at least, the second local partial key hash;
validate the new block in the blockchain via a smart contract operation of the blockchain if the constructed key hash matches the complete key hash in the new block;
decrypt the control or communication data from the encrypted message using a key generated from (i) the Merkle tree, (ii) the received partial key of the first local partial key hash, (iii) the received randomized key part-leaf node association, and, at least, (iv) the received partial key of the second local partial key hash.

### Claim 7 (depends on 3)

The non-transitory computer readable medium of claim 3, wherein the decentralized, autonomous multi-robot system include an edge device configured to control or direct control the equipment and other equipment in a local network, and wherein the edge device is configured to (i) generate a Merkle tree, where the number of leaf nodes aligns with the number of recipients, (ii) encrypt the updated model, splits the key into parts, (iii) create a randomized key-part-to-leaf-node association, and (iv) transmits unique set of hashes per recipient along with the key parts and a hash-free Merkle tree topology.

### Claim 8 (depends on 3)

The non-transitory computer readable medium of claim 3, wherein the equipment serves as an edge node in the decentralized, autonomous multi-robot system, wherein the equipment is configured to control or direct control the equipment and other equipment in a local network, and wherein the edge device is configured to (i) generate a Merkle tree, where the number of leaf nodes aligns with the number of recipients, (ii) encrypt the updated model, splits the key into parts, (iii) create a randomized key-part-to-leaf-node association, and (iv) transmits unique set of hashes per recipient along with the key parts and a hash-free Merkle tree topology.

### Claim 9 (depends on 3)

The non-transitory computer readable medium of claim 3, wherein the equipment is configured to (i) encrypt local data, (ii) split a key of the local data into M parts, (iii) generate a Merkle tree MT with leaf nodes corresponding to number of parts and a randomized key part-leaf node association, and (iv) transmits the key part-leaf node association to the remaining N−1 robot nodes and the Merkle tree topology to all M edge nodes,
wherein all robot nodes transmit the key parts following the received key part leaf node association to all M edge nodes.

### Claim 10 (depends on 3)

The non-transitory computer readable medium of claim 3, wherein the decentralized, autonomous multi-robot system is heterogenous, wherein the equipment is a first robot of a first type, peer equipment is a second robot of a second type, wherein the first type is the same as the second type.

### Claim 11 (depends on 3)

The non-transitory computer readable medium of claim 3, wherein the decentralized, autonomous multi-robot system is non-heterogenous, wherein the equipment is a first robot of a first type, peer equipment is a second robot of a second type, wherein the first type is different from the second type.

### Claim 12 (depends on 3)

The non-transitory computer readable medium of claim 3, wherein the control or communication data is associated with (i) a machine learning model employed in control or production of the equipment, (ii) a production schedule, (iii) demand forecast, or (iv) task assignment associated with operation of the equipment.

### Claim 13 (depends on 3)

The non-transitory computer readable medium of claim 3, wherein execution of the instructions by the processor cause the processor to:
train an AI model to be employed in the equipment in the execution of the task;
wherein the training is performed by federated learning, wherein the federated learning as a decentralized privacy-preserving operation robots in different spatial locations to simultaneously and collaboratively learn from local data without actually exchanging the local data.

### Claim 14 (depends on 13)

The non-transitory computer readable medium of claim 13, wherein execution of the instructions by the processor cause the processor to:
train an AI model to be employed in the equipment in the execution of the task, wherein the training is performed in a one-to-multiple manner for global model distribution, and wherein the key management follows a one-to-multiple key-sharing procedure.

### Claim 15 (depends on 14)

The non-transitory computer readable medium of claim 14, wherein execution of the instructions by the processor cause the processor to:
train an AI model to be employed in the equipment in the execution of the task, wherein the training is performed in a multiple-to-multiple manner for local model uploading, wherein N nodes upload its respective model to M edge nodes followed by initialization by a delegated robot node.

### Claim 16 (depends on 3)

The non-transitory computer readable medium of claim 3, wherein the consensus operation employed a Delegated Proof of Work operation.

### Claim 17 (depends on 3)

The non-transitory computer readable medium of claim 3, the instructions to adjust the parameter of the one or more task parameters provides for real-time adjustment of temporal collaboration, production flows, and/or task execution parameters for the decentralized, autonomous multi-robot system.

### Claim 18 (depends on 3)

The non-transitory computer readable medium of claim 3, wherein the decentralized, autonomous multi-robot system comprises a manufacturing robot, a warehouse sorting robot, or autonomous agent executing on a computing device.

### Claim 19

A system comprising:
a processor; and
a memory having instructions stored thereon, wherein execution of the instructions causes the processor to:
execute control software for a decentralized, autonomous multi-robot system for on-demand production, the system having adaptive and resilience productivity and resource efficiency, each system comprising:
a blockchain module comprising smart contracts as a unified automation framework; and
a Merkle tree-based key management module for privacy preservation, wherein the key management ensures information exchange in the system is encrypted prior to data exchange and decryption requiring the joint effort of recipients.

### Claim 20

A method comprising:
executing control software for a decentralized, autonomous multi-robot system for on-demand production, the system having adaptive and resilience productivity and resource efficiency, each system comprising:
a blockchain module comprising smart contracts as a unified automation framework; and
a Merkle tree-based key management module for privacy preservation, wherein the key management ensures information exchange in the system is encrypted prior to data exchange and decryption requiring the joint effort of recipients.
