Secure Table Joining via Vector Permutation and Bit-Flipping

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing techniques for joining two tables while maintaining confidentiality are inefficient, particularly when there is no key duplication.

Innovation Solution

A secure joining system comprising multiple secure computation apparatuses that utilize vector joining, permutation calculations, bit-flipping, and inverse permutations to efficiently join tables without key duplication while ensuring confidentiality, by generating and applying shares to perform stable sorting and permutation operations.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If existing techniques for joining two tables while maintaining confidentiality are used, then confidentiality is preserved, but the joining speed is slow

Engineering Contradiction:

Improvejoining speedVSAvoidconfidentiality

Core Design Contradiction:

SpeedVSReliability

Solution Approach 1:

The patent segments the joining process into multiple independent steps: vector joining to combine key vectors, stable sorting to order the joined vectors, duplicate detection to identify matching keys, and attribute value assembly to construct final joined records. Each step operates on segmented data portions, enabling parallel processing and improving overall joining speed while maintaining confidentiality through secret-sharing protocols at each stage.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary actions by pre-processing the key vectors through vector joining and stable sorting before the actual joining operation. This preliminary organization of data eliminates the need for repeated comparisons during the joining process, significantly accelerating the operation. The duplicate detection vector is also prepared in advance, allowing for efficient identification of matching records without compromising security.

Inventive Principle:

Principle #10Preliminary action

2Productivity

If existing techniques are used to maintain confidentiality during table joining, then security is ensured, but processing efficiency deteriorates

Engineering Contradiction:

Improveprocessing efficiencyVSAvoidconfidentiality

Core Design Contradiction:

ProductivityVSReliability

Solution Approach 1:

The patent introduces intermediary data structures including the duplicate detection vector and permutation vectors that facilitate efficient processing without revealing confidential information. These intermediaries act as mediators that enable productive operations on secret-shared data, allowing parallel computation and optimized processing paths while maintaining the confidentiality guarantees of secure multi-party computation protocols throughout the joining process.

Inventive Principle:

Principle #24Intermediary (Mediator)

Data Source

PatentUS11797540B2Secret joining system, method, secret calculation apparatus and program

Publication Date: 2023.10.24 NIPPON TELEGRAPH & TELEPHONE CORP

AI summary

A secure joining system is a secure joining system comprising a plurality of secure computation apparatuses; and the plurality of secure computation apparatuses are provided with vector joining parts 11n, first permutation calculating parts 12n, first permutation applying parts 13n, first vector generating parts 14n, second vector generating parts 15n, bit-flipping parts 16n, second permutation calculating parts 17n, second permutation applying parts 18n, third vector generating parts 19n, inverse permutation applying parts 110n, vector separating parts 111n, third permutation applying parts 112n, attribute value permutating parts 113n and fourth vector generating parts 114n.