Encrypted Identifier Linking via Component Segmentation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for linking interrelated encrypted datasets are inefficient and insecure, particularly when using sensitive identifiers, as they require cumbersome full-identifier comparisons that become exponentially slower with increasing dataset size.
Innovation Solution
The method involves breaking down encrypted identifiers into elemental components, comparing these components component-by-component to determine matching criteria, allowing for efficient and secure linking of encrypted datasets without exposing unencrypted data, and enabling joint computations in an encrypted space.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If full homomorphic encryption comparisons are used to correlate encrypted identifiers, then data security is maintained, but computational speed becomes prohibitively slow
Solution Approach 1:
The patent divides the encrypted identifier into multiple encrypted components (e.g., first encrypted component, second encrypted component) that can be processed independently. This segmentation allows parallel computation and reduces the complexity of comparing entire identifiers, thereby improving speed while maintaining security through the encrypted components.
Solution Approach 2:
The patent transforms the comparison problem from a single high-dimensional encrypted identifier comparison into multiple lower-dimensional component comparisons. By breaking down the identifier structure and comparing components in parallel, the system achieves faster computation without sacrificing the security guarantees of full homomorphic encryption.
2Quantity of substance
If dataset size increases to enable more comprehensive data analysis, then data completeness improves, but the number of pairwise identifier comparisons increases exponentially
Solution Approach 1:
By segmenting identifiers into components that can be compared in parallel, the system reduces the exponential growth of comparison complexity. Multiple component comparisons can be performed simultaneously, transforming the time complexity from O(n²) to approximately O(n log n) or better through parallelization.
Solution Approach 2:
The patent merges multiple comparison operations into a unified parallel processing framework where different component comparisons occur simultaneously. This combining of operations across multiple dimensions enables efficient handling of large datasets while maintaining comprehensive data analysis capabilities.
3Reliability
If encrypted identifiers are compared using traditional methods, then security is maintained, but computational complexity increases with dataset size
Solution Approach 1:
The patent segments the encrypted identifier into multiple independent encrypted components, each of which can be compared using simpler operations. This reduces the computational complexity of the overall comparison process while maintaining security, as each component comparison operates on smaller data structures with lower complexity requirements.
Data Source
AI summary
A device, system and method for linking encrypted data sets using common encrypted identifiers in encrypted space. A first and second parties' encrypted data sets may include first and second respective encrypted data and associated first and second respective encrypted identifiers. The first and second encrypted identifiers may be converted into a first and second respective sets of a plurality of elemental identifier components. Each of the plurality of elemental identifier components in each component set characterizes a distinct numeric property of the corresponding converted encrypted identifier. The first and second sets of the plurality of elemental identifier components may be composed, component-by-component, to generate a plurality of component-specific results. If the plurality of component-specific results are determined to satisfy a matching criterion indicating that the first and second encrypted identifiers match, the first and second encrypted data associated with the first and second matching encrypted identifiers may be linked.