Homomorphic database operations apparatuses, methods and systems

Patent metadata

Field	Value
Publication number	US-10536263-B2
Application number	US-201816155539-A
Country	US
Kind code	B2
Filing date	Oct 9, 2018
Priority date	Aug 1, 2013
Publication date	Jan 14, 2020
Grant date	Jan 14, 2020

Abstract

An encrypted table value homomorphically joining method and apparatus comprising receiving a query input. Based on the query input, the method may include determining at least one field on which to join the plurality of tables, and determining that the at least one field contains deterministically homomorphically encrypted data. The method may include determining a homomorphic join strategy directly comparing values in two homomorphically encrypted fields, performing a homomorphic join on the fields in the plurality of tables, and providing resultant homomorphically joined tables.

First claim

What is claimed is:

1. An encrypted table value homomorphically joining apparatus, comprising:
a memory; and
a processor disposed in communication with said memory, and configured to issue a plurality of processing instructions stored in the memory, wherein the processor issues instructions to:
receive a query input, wherein the query input requires data values from a plurality of tables;
based on the query input, determine at least one field on which to join the plurality of tables;
determine that the determined at least one field contains deterministically homomorphically encrypted data;
based on the determination that the at least one field contains deterministically homomorphically encrypted data, determine a homomorphic join strategy that includes directly comparing values in two homomorphically encrypted fields;
perform a homomorphic join on the at least one field in the plurality of tables using the determined homomorphic join strategy; and
provide resultant homomorphically joined tables.

2. The apparatus of claim 1 , wherein the processor further issues instructions to:
analyze the resultant homomorphically joined tables to determine that at least one record in the resultant homomorphically joined tables requires further processing; and
determine that the at least one record in the resultant homomorphically joined tables contains homomorphically encrypted data.

3. The apparatus of claim 2 , wherein the processor further issues instructions to perform a homomorphically optimized addition function to add the homomorphically encrypted data values contained in the at least one record.

4. The apparatus of claim 1 , wherein the homomorphic join strategy includes using a key common to all values in at least one of the at least one field to decrypt the homomorphically encrypted values in a field.

5. The apparatus of claim 1 , wherein when the homomorphic join strategy includes utilizing grouping keys, additionally comprising instructions to:
receive a plurality of grouping keys;
determine a plurality of ranges of field values that each grouping key may be used to decrypt; and
decrypt each of the field values in each of the ranges using the grouping keys.

6. The apparatus of claim 1 , additionally comprising instructions to aggregate results from the resultant homomorphically joined tables.

7. The apparatus of claim 6 , wherein aggregating involves leaving encrypted space and re-entering the encrypted space.

8. The apparatus of claim 6 , wherein the aggregation is performed completely in encrypted space.

9. A processor implemented method of homomorphically joining repository tables using encrypted table values, comprising:
receiving, using one or more data processors, a query input, wherein the query input requires data values from a plurality of tables;
based on the query input, determining, using the one or more data processors, at least one field on which to join the plurality of tables;
determining, using the one or more data processors, that the determined at least one field contains deterministically homomorphically encrypted data;
based on the determination that the at least one field contains deterministically homomorphically encrypted data, determining a homomorphic join strategy that includes directly comparing values in two homomorphically encrypted fields;
performing, using the one or more data processors, a homomorphic join on the at least one field in the plurality of tables using the determined homomorphic join strategy; and
providing, using the one or more data processors, resultant homomorphically joined tables.

10. The method of claim 9 , further comprising:
analyzing the resultant homomorphically joined tables to determine that at least one record in the resultant homomorphically joined tables requires further processing; and
determining that the at least one record in the resultant homomorphically joined tables contains homomorphically encrypted data.

11. The method of claim 10 , wherein the processor further issues instructions to perform a homomorphically optimized addition function to add the homomorphically encrypted data values contained in the at least one record.

12. The method of claim 9 , wherein the homomorphic join strategy includes using a key common to all values in at least one of the plurality of fields to decrypt the plurality of homomorphically encrypted values in a field.

13. The method of claim 9 , wherein when the homomorphic join strategy includes utilizing grouping keys, additionally comprising:
receiving a plurality of grouping keys;
determining a plurality of ranges of field values that each grouping key may be used to decrypt; and
decrypting each of the field values in each of the ranges using the grouping keys.

14. The method of claim 9 , additionally comprising aggregating results from the resultant homomorphically joined tables.

15. The method of claim 14 , wherein aggregating involves leaving encrypted space and re-entering the encrypted space.

16. The method of claim 14 , wherein the aggregation is performed completely in encrypted space.

17. A non-transitory computer readable medium storing processor-executable instructions issuable by a processor to:
receiving a query input, wherein the query input requires data values from a plurality of tables;
based on the query input, determining at least one field on which to join the plurality of tables;
determining that the determined at least one field contains deterministically homomorphically encrypted data;
based on the determination that the at least one field contains deterministically homomorphically encrypted data, determining a homomorphic join strategy that includes directly comparing values in two homomorphically encrypted fields;
performing a homomorphic join on the at least one field in the plurality of tables using the determined homomorphic join strategy; and
providing resultant homomorphically joined tables.

18. The non-transitory computer readable medium of claim 17 further comprising instructions causing the apparatus to perform:
analyzing the resultant homomorphically joined tables to determine that at least one record in the resultant homomorphically joined tables requires further processing; and
determining that the at least one record in the resultant homomorphically joined tables contains homomorphically encrypted data.

19. The non-transitory computer readable medium of claim 18 further comprising instructions causing the apparatus to perform a homomorphically optimized addition function to add the homomorphically encrypted data values contained in the at least one record.

20. The non-transitory computer readable medium of claim 17 further comprising instructions causing the apparatus to perform aggregating results from the resultant homomorphically joined tables.

Assignees

• Visa Int Service Ass

Inventors

• Payton Paul
• Edington Scott
• Van Tilburg Johan

Classifications

• H04L9/14

  using a plurality of keys or algorithms · CPC title

• H04L9/008 Primary

  involving homomorphic encryption · CPC title