Back to results
US 12,665,055 B2Granted
Data security for data sequences
AssigneeBedrock Labs, Inc.
InventorsGanesha Shanmuganathan, Pranava Adduri, Sohil Nizarali Habib, Arun Soni
Life of this patent
Estimating the term…
Abstract
Data security for data sequences is disclosed, including: receiving, over a network, a first sketch corresponding to a first file, wherein the first sketch was determined from hash values generated from a data sequence associated with the first file; determining that the first sketch and a second sketch corresponding to a second file at least partially overlap; and determining whether a data security policy is violated based at least in part on the determination that the first sketch and the second sketch at least partially overlap.
Claims16
A system, comprising:
- first one or more processors configured to:
- apply a k-length sliding window to a linguistic unit associated with a document data sequence to generate a corresponding hash value for each sliding window, wherein the document data sequence is associated with a first file;
- select a respective subset of hash values associated with the linguistic unit;
- determine a first sketch associated with the document data sequence based at least in part on the respective subset of hash values associated with the linguistic unit;
- and
- send the first sketch associated with the document data sequence over a network;
- a sketch interface configured to receive, over the network, the first sketch corresponding to the first file;
- and
- second one or more processors configured to:
- determine that the first sketch and a second sketch corresponding to a second file at least partially overlap, wherein to determine that the first sketch and the second sketch corresponding to the second file at least partially overlap comprises to:
- determine keys comprising subsequences of hash values;
- group the first sketch and the second sketch based on the first sketch and the second sketch both matching a key:
- determine whether a count of matching sketches to the key meets or is greater than a threshold count;
- and
- in response to a determination that the count of the matching sketches to the key does not meet or exceed the threshold count, determine that the first sketch and the second sketch are related;
- and
- in response to a determination that a data security policy is violated based at least in part on the determination that the first sketch and the second sketch at least partially overlap, modify a security setting associated with the first file.
14 more elements
A method, comprising:
- applying, using first one or more processors, a k-length sliding window to a linguistic unit associated with a document data sequence to generate a corresponding hash value for each sliding window, wherein the document data sequence is associated with a first file;
- selecting, using the first one or more processors, a respective subset of hash values associated with the linguistic unit;
- determining, using the first one or more processors, a first sketch associated with the document data sequence based at least in part on the respective subset of hash values associated with the linguistic unit;
- sending, using the first one or more processors, the first sketch associated with the document data sequence over a network;
- receiving, over the network, the first sketch corresponding to the first file, wherein the first sketch was determined from hash values generated from a data sequence associated with the first file;
- determining, using second one or more processors, that the first sketch and a second sketch corresponding to a second file at least partially overlap, wherein to determine that the first sketch and the second sketch corresponding to the second file at least partially overlap comprises:
- determining keys comprising subsequences of hash values;
- grouping the first sketch and the second sketch based on the first sketch and the second sketch both matching a key;
- determining whether a count of matching sketches to the key meets or is greater than a threshold count;
- and
- in response to a determination that the count of the matching sketches to the key does not meet or exceed the threshold count, determining that the first sketch and the second sketch are related;
- and
- in response to a determination that a data security policy is violated based at least in part on the determination that the first sketch and the second sketch at least partially overlap, modifying a security setting associated with the first file.
10 more elements
A computer program product embodied in a non-transitory computer readable medium and comprising computer instructions for:
- applying, using first one or more processors, a k-length sliding window to a linguistic unit associated with a document data sequence to generate a corresponding hash value for each sliding window, wherein the document data sequence is associated with a first file;
- selecting, using the first one or more processors, a respective subset of hash values associated with the linguistic unit;
- determining, using the first one or more processors, a first sketch associated with the document data sequence based at least in part on the respective subset of hash values associated with the linguistic unit;
- and
- sending, using the first one or more processors, the first sketch associated with the document data sequence over a network;
- receiving, over the network, the first sketch corresponding to the first file, wherein the first sketch was determined from hash values generated from a data sequence associated with the first file;
- determining, using second one or more processors, that the first sketch and a second sketch corresponding to a second file at least partially overlap, wherein to determine that the first sketch and the second sketch corresponding to the second file at least partially overlap comprises:
- determining keys comprising subsequences of hash values;
- grouping the first sketch and the second sketch based on the first sketch and the second sketch both matching a key;
- determining whether a count of matching sketches to the key meets or is greater than a threshold count;
- and
- in response to a determination that the count of the matching sketches to the key does not meet or exceed the threshold count, determining that the first sketch and the second sketch are related;
- and
- in response to a determination that a data security policy is violated based at least in part on the determination that the first sketch and the second sketch at least partially overlap, modifying a security setting associated with the first file.
11 more elements
Dependencies are inferred from the claim text.