# US 2017/0288856 A1 · Homomorphic database operations apparatuses, methods and systems

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2017/0288856 A1
- Document ID: US20170288856A1
- Status: Published application
- Kind: A1
- Application number: 15/628,383
- Filed: 2017-06-20
- Published: 2017-10-05
- Earliest claimed: 2013-08-01
- Assignees: Visa International Service Association
- Inventors: Paul Payton; Scott Edington; Johan Van Tilburg
- Web page: https://patentgrep.com/patent/US20170288856A1

## CPC

- H04L 9/008: {involving homomorphic encryption}
- H04L 9/14: using a plurality of keys or algorithms
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

The HOMOMORPHIC DATABASE OPERATIONS APPARATUSES, METHODS AND SYSTEMS (“HEDO”) transform transaction storage requests and homomorphic model queries using HEDO components into homomorphic model query results. In some implementations, the disclosure provides a processor-implemented method of securely querying a shared homomorphically encrypted data repository and performing cross-table homomorphic joins.

## Claims

### Claim at position 1

1-16. (canceled)

### Claim 17

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 model query for processing, wherein the model query requires data values from more than one table in a data repository;
based on the model query, determine a join type to perform, a plurality of tables to be joined, and a plurality of fields on which to join the plurality of tables;
determine that the plurality of fields on which to join includes at least one field that contains homomorphically encrypted data;
determine a homomorphic join strategy;
perform a homomorphic join using the plurality of fields; and
provide the resultant homomorphically joined tables,
wherein the homomorphic join strategy is directly comparing values in two homomorphically encrypted fields when it is determined that the fields have both been encrypted using a common deterministic encryption scheme.

### Claim 18 (depends on 17)

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

### Claim 19 (depends on 18)

The apparatus of claim 18, 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.

### Claim 20 (depends on 17)

The apparatus of claim 17, wherein the homomorphic join strategy is 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.

### Claim 21 (depends on 17)

The apparatus of claim 17, wherein when the homomorphic join strategy is to utilize grouping keys, additionally comprising instructions to:
receive a plurality of grouping keys;
determine a range of fields values that each grouping key may be used to decrypt; and
decrypt each of the values in each of the ranges using the grouping keys.

### Claim 22 (depends on 17)

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

### Claim 23 (depends on 22)

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

### Claim 24 (depends on 22)

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

### Claim 25

A processor implemented method of homomorphically joining repository tables using encrypted table values, comprising:
receiving, using one or more data processors, a model query for processing, wherein the model query requires data values from more than one table in a data repository;
based on the model query, determining, using the one or more data processors, a join type to perform, a plurality of tables to be joined, and a plurality of fields on which to join the plurality of tables;
determining, using the one or more data processors, that the plurality of fields on which to join includes at least one field that contains homomorphically encrypted data;
determining a homomorphic join strategy;
performing, using the one or more data processors, a homomorphic join using the plurality of fields; and
providing, using the one or more data processors, the resultant homomorphically joined tables,
wherein the homomorphic join strategy is directly comparing values in two homomorphically encrypted fields when it is determined that the fields have both been encrypted using a common deterministic encryption scheme.

### Claim 26 (depends on 25)

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

### Claim 27 (depends on 26)

The apparatus of claim 26, 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.

### Claim 28 (depends on 25)

The method of claim 25, wherein the homomorphic join strategy is 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.

### Claim 29 (depends on 25)

The method of claim 25, wherein when the homomorphic join strategy is to utilize grouping keys, additionally comprising:
receiving a plurality of grouping keys;
determining a range of fields values that each grouping key may be used to decrypt; and
decrypting each of the values in each of the ranges using the grouping keys.

### Claim 30 (depends on 25)

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

### Claim 31 (depends on 30)

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

### Claim 32 (depends on 30)

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

### Claim 33

A non-transitory computer readable medium storing instructions that, when executed, cause an apparatus at least to perform:
receiving model query for processing, wherein the model query requires data values from more than one table in a data repository;
based on the model query a join type to perform, a plurality of tables to be joined, and a plurality of fields on which to join the plurality of tables;
determining that the plurality of fields on which to join includes at least one field that contains homomorphically encrypted data;
determining a homomorphic join strategy;
performing a homomorphic join using the plurality of fields; and
providing the resultant homomorphically joined tables,
wherein the homomorphic join strategy is directly comparing values in two homomorphically encrypted fields when it is determined that the fields have both been encrypted using a common deterministic encryption scheme.

### Claim 34 (depends on 33)

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

### Claim 35 (depends on 34)

The non-transitory computer readable medium of claim 34 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.

### Claim 36 (depends on 33)

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