Granted Patent B2

US 12,040,820 · App. 18/522,178 · Granted Jul 16, 2024

Inventors: Joshua Cooper (Columbia, SC); Charles Yeomans (Orinda, CA)

Assignee: ATOMBEAM TECHNOLOGIES INC.

H03M7/3059G06N20/00H03M7/6005

Abstract

Claims (67)

1. A system for searching compressed and encrypted data, comprising:

a computing device comprising a processor and a memory;

a data deconstruction engine comprising a first plurality of programming instructions stored in the memory which, when operating on the processor, causes the computing device to:

receive a conditioned data stream comprising a plurality of data blocks;

compress the conditioned data stream using a codebook; and

send the compressed data to an encrypted search engine; and

an encrypted search engine comprising a second plurality of programming instructions stored in the memory which, when operating on the processor, causes the computing device to:

receive the compressed data;

encrypt the compressed data using homomorphic encryption;

store the encrypted compressed data in database;

receive a data query, the data query comprising one or more selected data blocks;

produce an encrypted query by encrypting the one or more selected data blocks;

determine if the encrypted compressed data in the database comprises matching encrypted data with the encrypted query by:

retrieve an encrypted, compressed data block from the database;

determine an encryption value between the encrypted query and the retrieved encrypted, compressed data block by performing an intersection computation on the encrypted query and the retrieved encrypted, compressed data block;

compare the encryption value against a predetermined threshold value, wherein if the encryption value surpasses the predetermined threshold value, then the retrieved encrypted, compressed data block and the encrypted query comprise matching data;

record each encrypted, compressed data block which is determined to be a match in a list.

2. The system of claim 1 , wherein the homomorphic encryption is fully homomorphic encryption.

3. The system of claim 1 , wherein the homomorphic encryption is partially homomorphic encryption.

4. The system of claim 1 , wherein the homomorphic encryption is the Brakerski-Gentry-Vaikuntanathan (BGV) scheme.

5. The system of claim 1 , wherein the intersection computation comprises one or more addition steps, one or more multiplication steps, or some combination thereof.

6. The system of claim 1 , further comprising a stream analyzer comprising a third plurality of programming instructions stored in the memory which, when operating on the processor, causes the computing device to:

receive an input data stream;

analyze the frequency distribution of a plurality of data blocks within the input data stream to determine whether the input data stream meets a configured threshold for data conditioning; and

if the input data stream fails to meet the configured threshold, send the input data stream to a stream conditioner.

7. The system of claim 6 , further comprising the stream conditioner comprising a fourth plurality of programming instructions stored in the memory which, when operating on the processor, causes the computing device to:

receive the input data stream from the stream analyzer;

produce the conditioned data stream and an error stream by, for each of a plurality of data blocks within the data stream:

analyzing the data block within the data stream to compare the data block's real frequency within the data stream against an ideal frequency;

if the difference between the data block's real frequency and ideal frequency exceeds a configured conditioning threshold, applying a conditioning rule to the data block;

applying a logical XOR operation to the data block;

appending the output of the logical XOR operation to the error stream;

send the conditioned data stream and the error stream as output.

8. The system of claim 1 , wherein the list of matched encrypted, compressed blocks is decrypted and sent to a data reconstruction engine wherein the decrypted compressed blocks may be decompressed.

9. The system of claim 8 , wherein the decompressed blocks are returned to the entity which generated the data query.

10. A method for searching compressed and encrypted data, comprising the steps of:

receiving a conditioned data stream comprising a plurality of data blocks;

compressing the conditioned data stream using a codebook;

sending the compressed data to an encrypted search engine;

receiving the compressed data;

encrypting the compressed data using homomorphic encryption;

storing the encrypted compressed data in database;

receiving a data query, the data query comprising one or more selected data blocks;

producing an encrypted query by encrypting the one or more selected data blocks;

determining if the encrypted compressed data in the database comprises matching encrypted data with the encrypted query by:

retrieving an encrypted, compressed data block from the database;

determining an encryption value between the encrypted query and the retrieved encrypted, compressed data block by performing an intersection computation on the encrypted query and the retrieved encrypted, compressed data block;

comparing the encryption value against a predetermined threshold value, wherein if the encryption value surpasses the predetermined threshold value, then the retrieved encrypted, compressed data block and the encrypted query comprise matching data;

recording each encrypted, compressed data block which is determined to be a match in a list.

11. The method of claim 1 , wherein the homomorphic encryption is fully homomorphic encryption.

12. The method of claim 1 , wherein the homomorphic encryption is partially homomorphic encryption.

13. The method of claim 1 , wherein the homomorphic encryption is the Brakerski-Gentry-Vaikuntanathan (BGV) scheme.

14. The method of claim 1 , wherein the intersection computation comprises one or more addition steps, one or more multiplication steps, or some combination thereof.

15. The method of claim 1 , further comprising the steps of:

receiving an input data stream;

analyzing the frequency distribution of a plurality of data blocks within the input data stream to determine whether the input data stream meets a configured threshold for data conditioning; and

if the input data stream fails to meet the configured threshold, sending the input data stream to a stream conditioner.

16. The method of claim 6 , further comprising the steps of:

receiving the input data stream from the stream analyzer;

producing the conditioned data stream and an error stream by, for each of a plurality of data blocks within the data stream:

analyzing the data block within the data stream to compare the data block's real frequency within the data stream against an ideal frequency;

if the difference between the data block's real frequency and ideal frequency exceeds a configured conditioning threshold, applying a conditioning rule to the data block;

applying a logical XOR operation to the data block;

appending the output of the logical XOR operation to the error stream;

sending the conditioned data stream and the error stream as output.

17. The method of claim 1 , wherein the list of matched encrypted, compressed blocks is decrypted and sent to a data reconstruction engine wherein the decrypted compressed blocks may be decompressed.

18. The method of claim 8 , wherein the decompressed blocks are returned to the entity which generated the data query.

Assignments (1)

Continuity (18)

Cited By (3)

US 12,200,102 US 12,574,207 US 12,712,706