Homomorphic Encryption Key Segmentation for Entity Resolution
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for matching and linking encrypted data require significant computational and storage resources, especially when using homomorphic encryption techniques, due to the need for large encryption keys to handle varying string lengths and the complexity of comparisons across different key ranges.
Innovation Solution
The approach involves segmenting data into categories based on string lengths, assigning appropriate encryption keys for each category, and using homomorphic encryption to compare encrypted values without decrypting them, thereby reducing resource requirements and optimizing key usage through overlapping key ranges and efficient storage allocation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If homomorphic encryption is used to match encrypted data without decryption, then data security is improved, but computational resources and storage requirements increase significantly
Solution Approach 1:
The patent segments data into multiple categories based on string length ranges, with each category encrypted using a different encryption key. This segmentation allows the system to use smaller, more efficient encryption keys for each category rather than requiring one large key for all data, thereby reducing computational resources while maintaining security through categorical division.
Solution Approach 2:
Different encryption keys are assigned to different data categories based on their specific string length requirements. Each category receives a locally optimized encryption key size appropriate for its data characteristics, rather than using a uniform large key size for all data. This local optimization reduces overall computational burden while maintaining adequate security for each category.
2Adaptability or versatility
If large encryption keys are used to handle varying string lengths, then encryption coverage is improved, but storage requirements increase
Solution Approach 1:
Data is segmented into multiple categories based on string length, with each category assigned an appropriate encryption key size. This segmentation enables the system to achieve comprehensive encryption coverage for all string lengths while using smaller keys for each category, thereby reducing total storage requirements compared to using a single large key for all data.
Solution Approach 2:
The encryption key parameter (key size) is changed based on the data category and string length requirements. By adjusting the key size parameter to match the specific needs of each data category rather than using a fixed large key size, the system achieves adequate encryption coverage while optimizing storage efficiency.
3Productivity
If multiple encryption keys are used for different data categories, then resource efficiency is improved, but system complexity increases
Solution Approach 1:
The patent implements segmentation of data into categories with distinct encryption keys, which improves resource efficiency by using appropriately sized keys for each category. The segmentation approach manages complexity by organizing data and keys in a structured manner based on string length ranges, making the multi-key system more manageable than an unstructured approach.
4Reliability
If homomorphic encryption comparisons are performed on encrypted data, then data privacy is maintained, but processing time increases
Solution Approach 1:
By segmenting data into categories and using category-specific encryption keys, the patent enables more efficient homomorphic encryption comparisons. The segmentation reduces the computational complexity of comparisons by limiting the search space and allowing optimized processing for each category, thereby reducing processing time while maintaining data privacy through encrypted comparisons.
Data Source
AI summary
Securely matching encrypted entities by receiving data, segmenting the data into a plurality of categories, selecting encryption key(s) according to a data category of the plurality of data categories, encrypting the data of the data category using the encryption key(s), and comparing the encrypted data to previously encrypted data of the data category.