Secure Join Using Permuted Hash Vectors to Cut Data Transfer
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secure join methods require large communication amounts due to the transmission and reception of all ciphertexts of data between parties, especially when one party has large data.
Innovation Solution
A secure join system that rearranges and encrypts hash values and ciphertexts using permutations unknown to one party, allowing for secure data joining without transmitting the entire dataset, reducing communication overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If all ciphertexts of data held by both parties are transmitted and received between the two parties, then secure data joining can be performed, but the communication amount becomes large when at least one party has large data
Solution Approach 1:
The patent extracts only the hash values of keys from the complete ciphertext data for transmission. Instead of sending all encrypted data between parties, the system extracts and transmits only the essential hash value components needed for secure joining, dramatically reducing communication overhead while maintaining security.
Solution Approach 2:
The patent segments the data processing into distinct components: hash value extraction, permutation application, and ciphertext matching. By dividing the secure join process into these segments, the system can transmit only the necessary hash segments rather than complete ciphertexts, reducing communication volume.
2Quantity of substance
If hash values and ciphertexts are rearranged by permutation unknown to one party, then communication amount is reduced, but the system complexity increases
Solution Approach 1:
The patent introduces a permutation function as an intermediary mechanism that operates on hash values and ciphertexts. This intermediary permutation layer allows the system to reduce communication by transmitting only permuted hash segments, while the complexity is contained within the permutation mechanism rather than the overall system architecture.
3Reliability
If dummy values are used to mask which data is joined, then security is improved by hiding join information, but the data processing complexity increases
Solution Approach 1:
The patent applies local quality by using dummy values specifically at the positions where data joining occurs. Instead of complicating the entire data structure, the system maintains simple ciphertext storage and only introduces complexity locally at the join points by inserting dummy values to mask actual joins, thereby improving security with minimal overall processing complexity.
Data Source
AI summary
The secure join system includes the first and second information-processing-apparatuses respectively holding first and second data. The second information-processing-apparatus is configured to: create third and fourth vectors in which a hash-value related to a key-value of the first data in a first vector and a ciphertext of the first data corresponding to the key-value in a second vector are rearranged by permutation; and create a fifth vector having a hash-value related to a key-value of the second data. The first information-processing-apparatus is configured to: search for j in which a hash-value of an i-th element of the fifth vector matches a j-th element value of the third vector for each i and create encrypted data in which a ciphertext of a j-th element value of the fourth vector is set when j is found and a ciphertext of a dummy value is set when j is not found.