Homomorphic Encryption Lookup Tables with Segmented Hash Retrieval
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing homomorphic encryption lookup tables face challenges in reducing the retrievable range while ensuring data safety and suffer from increased retrieval time as the number of records grows, particularly in encrypted database management systems.
Innovation Solution
A data management method using a homomorphic encryption lookup table that involves obtaining hash values, sorting and grouping data, encoding bits into slots, and performing slot-by-slot comparisons to quickly retrieve encrypted data based on queries.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a homomorphically encrypted lookup table is used for data retrieval, then data safety is improved, but retrieval time increases linearly as the number of records increases
Solution Approach 1:
The patent divides the lookup table into multiple groups based on the first N bits of hash values, creating segment-specific sub-lookup tables. This segmentation reduces the search space from the entire lookup table to only relevant segments, thereby decreasing retrieval time while maintaining data safety through homomorphic encryption.
Solution Approach 2:
The patent introduces a new dimension for organizing data by using the first N bits of hash values as group identifiers. This dimensional organization allows the system to quickly locate relevant segments without examining the entire lookup table, effectively reducing retrieval time while preserving security.
2Loss of information
If the entire lookup table is searched for encrypted data retrieval, then complete data coverage is ensured, but the number of comparison operations increases
Solution Approach 1:
The patent segments the lookup table into multiple groups using the first N bits of hash values, allowing the system to search only within relevant segments rather than the entire table. This maintains complete data coverage for matching queries while significantly reducing the number of comparison operations required.
Solution Approach 2:
The patent performs preliminary classification of data into groups based on hash value prefixes before retrieval operations. This preliminary organization enables the system to quickly identify and access only the relevant segments containing potential matches, reducing unnecessary comparison operations while ensuring complete coverage of matching data.
3Reliability
If 128-bit or more encryption is used for data protection, then security strength is improved, but the complexity of retrieval operations increases
Solution Approach 1:
The patent segments the retrieval process into multiple stages: first identifying relevant groups using hash value prefixes, then performing homomorphic comparison operations only within those segments. This segmentation maintains strong 128-bit encryption security while reducing the overall complexity of retrieval operations by limiting the scope of complex homomorphic comparisons to smaller subsets of data.
Data Source
AI summary
Disclosed is a data management method and apparatus. The data management method includes: obtaining a hash value of a key by using a predetermined hash function for each of a plurality of data in which the key matches a data value, sorting the plurality of data in which the key is changed to the hash value of the key based on the obtained hash value, classifying the plurality of sorted data into a plurality of groups according to a predetermined criterion; encoding the plurality of data classified into the plurality of groups, and generating a lookup table based on a predetermined hash value included in each of the plurality of classified groups.