US 12,457,095 B2
Adaptive asymmetric-key compression for idempotent data stores in computer messaging
Andrea Cosentino, Rome (IT); and Paolo Antinori, Novara (IT)
Assigned to Red Hat, Inc., Raleigh, NC (US)
Filed by Red Hat, Inc., Raleigh, NC (US)
Filed on Feb. 8, 2023, as Appl. No. 18/166,355.
Prior Publication US 2024/0267204 A1, Aug. 8, 2024
Int. Cl. H04L 9/08 (2006.01); H03M 7/30 (2006.01)
CPC H04L 9/0822 (2013.01) [H03M 7/6064 (2013.01); H04L 9/0825 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method, comprising:
receiving, by a server node, a first notification indicating that a first message received by a first node of a cluster of nodes is not a redundant message and cannot be stored by a data store of the nodes, wherein the nodes are managed by the server node;
determining to invoke a compression process used to compress message identifiers stored in the first node;
receiving a first public key associated with the first node;
generating a compression key;
generating, responsive to determining to invoke the compression process used to compress the message identifiers stored in the first node, a first encrypted compression key by encrypting the compression key with the first public key;
sending, to the first node, the first encrypted compression key; and
receiving, from the first node, a second notification of storing, in a compressed form using a key decrypted from the first encrypted compression key, at least one message identifier in a data store of the first node.