Provided is a system and method for confidential repository searching. The method executed on a first computing device and includes: receiving an encrypted query term from the second computing device; searching the encrypted data repository by determining one or more matches of the encrypted query term to data in the encrypted data repository; communicating the one or more matches to the second computing device; receiving associative data from the second computing device, the associative data associated with data in the encrypted data repository that is to be retrieved and associated with one of the one or more matches; retrieving the encrypted data in the encrypted data repository associated with the received associative data; and communicating the retrieved encrypted data to the second computing device.
Legal claims defining the scope of protection, as filed with the USPTO.
2. The method of claim 1, wherein retrieving the encrypted data in the encrypted data repository associated with the received associative data comprises using private information retrieval (PIR).
3. The method of claim 1, wherein the second computing device hashes and partitions the query term to generate hash partition polynomials, wherein each one of the polynomials is encrypted to form a homomorphically encrypted ciphertext, and wherein the homomorphically encrypted ciphertext comprises the encrypted query term.
4. The method of claim 3, wherein searching the encrypted data repository comprises subtracting each partitioned query ciphertext from polynomials in a corresponding column of the encrypted data repository, and wherein a subtraction result of 0 indicates a match.
5. The method of claim 4, wherein, for each row of the encrypted data repository, the subtraction results of each hash partition ciphertexts for the same row are added together.
6. The method of 1, wherein each polynomial in the encrypted data repository encodes only one partition of rows that such polynomial includes.
7. The method of 1, wherein searching the encrypted data repository comprises searching only in a column of polynomials of the search database associated with the encrypted query term.
8. The method of claim 1, wherein the associative data comprises an index that is encoded using an encrypted polynomial where the index, i, is encoded by making an i-th coefficient 1, and all other coefficients 0.
9. The method of claim 1, wherein the associative data comprises an index that is encoded using multiple encrypted polynomials, the number of encrypted polynomials equal to a number of terms in the encrypted data repository, and wherein the i-th polynomial encodes a 1 and other polynomials encode a 0.
11. The system of claim 10, wherein retrieving the encrypted data in the encrypted data repository associated with the received associative data comprises using private information retrieval (PIR).
12. The system of claim 10, wherein the second computing device hashes and partitions the query term to generate hash partition polynomials, wherein each one of the polynomials is encrypted to form a homomorphically encrypted ciphertext, and wherein the homomorphically encrypted ciphertext comprises the encrypted query term.
13. The system of claim 12, wherein searching the encrypted data repository comprises subtracting each partitioned query ciphertext from polynomials in a corresponding column of the encrypted data repository, and wherein a subtraction result of 0 indicates a match.
14. The system of claim 13, wherein, for each row of the encrypted data repository, the subtraction results of each hash partition ciphertexts for the same row are added together.
15. The system of 10, wherein each polynomial in the encrypted data repository encodes only one partition of rows that such polynomial includes.
16. The system of 10, wherein searching the encrypted data repository comprises searching only in a column of polynomials of the search database associated with the encrypted query term.
17. The system of claim 10, wherein the associative data comprises an index that is encoded using an encrypted polynomial where the index, i, is encoded by making an i-th coefficient 1, and all other coefficients 0.
18. The system of claim 10, wherein the associative data comprises an index that is encoded using multiple encrypted polynomials, the number of encrypted polynomials equal to a number of terms in the encrypted data repository, and wherein the i-th polynomial encodes a 1 and other polynomials encode a 0.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
February 22, 2023
May 7, 2024
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.