US 12,495,055 B2
Non-anonymized privacy preserving global and local anomaly detection in distributed systems
Adriana Bechara Prado, Niterói (BR); Alexander Eulalio Robles Robles, Valinhos (BR); Eduarda Tatiane Chagas, Belo Horizonte (BR); Karen Stéfany Martins, Belo Horizonte (BR); and Isabella Costa Maia, São Paulo (BR)
Assigned to Dell Products L.P., Round Rock, TX (US)
Filed by Dell Products L.P., Round Rock, TX (US)
Filed on Feb. 27, 2023, as Appl. No. 18/175,343.
Prior Publication US 2024/0291838 A1, Aug. 29, 2024
Int. Cl. H04L 9/40 (2022.01); H04L 9/08 (2006.01); H04L 9/14 (2006.01); H04L 9/30 (2006.01)
CPC H04L 63/1425 (2013.01) [H04L 9/0838 (2013.01); H04L 9/085 (2013.01); H04L 9/0861 (2013.01); H04L 9/14 (2013.01); H04L 9/3073 (2013.01)] 18 Claims
OG exemplary drawing
 
1. A method, comprising:
in a distributed environment that includes a group of nodes configured to communicate with each other, and to communicate with a central node of the distributed environment, performing, by two or more of the nodes, operations comprising:
generating a public/private key pair;
generating a secret shared key using the respective public keys of the other nodes, and the secret shared key is unknown to the central node;
using the secret shared key as a seed of a random generator to generate transformation matrices that correspond to respective isometric transformations of node data;
wherein the transformation matrices are multiplied together to create a complete transformation matrix common to all the nodes, but unknown to the central node;
using the complete transformation matrix to transform the node data into transformed data; and
transmitting the transformed data, but not the node data, to the central node, and the transformed data is usable by the central node to identify an anomaly in the node data when the central node applies a time series discord finding algorithm to the transformed data.