Data Access Method Using Key Relationship Arrays for Secure Multi-Key Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional data access methods require a unique search key for each piece of data, limiting the ability to use multiple search keys while concealing data, search keys, and access patterns, which is undesirable for secure data storage solutions.
Innovation Solution
A data access method involving a server and client apparatus that utilize hash tables and key relationship arrays/tables to generate and manage multiple search keys, allowing data access while concealing all data, search keys, and access patterns by referencing a single piece of data with any number of search keys.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a unique search key is assigned to each piece of data, then data access security is improved, but the ability to access data with multiple search keys deteriorates
Solution Approach 1:
The patent segments the relationship between search keys and data by introducing intermediate structures (hash tables and key relationship arrays) that separate the direct one-to-one mapping. Multiple search keys are segmented into different entries in the key relationship array, each pointing to the same data through the hash table, enabling many-to-one access while maintaining security.
Solution Approach 2:
The patent introduces intermediary data structures (hash tables and key relationship arrays) that mediate between search keys and data. These intermediaries allow multiple search keys to reference the same data without exposing the data or the key relationships, thus maintaining security while enabling multiple access paths.
2Reliability
If data is encrypted to conceal content, then data privacy is improved, but the ability to search data efficiently deteriorates
Solution Approach 1:
The patent performs preliminary actions by pre-computing and storing hash values and key relationships in the hash tables and key relationship arrays during data insertion. This preliminary processing enables efficient search operations later without requiring decryption or complex computations, thus maintaining both privacy and search efficiency.
Solution Approach 2:
The patent creates copies of data in encrypted form in the hash tables while maintaining the ability to search through the key relationship arrays. The encrypted copies allow efficient searching through key relationships without exposing the actual data content, balancing privacy protection with search capability.
3Reliability
If access patterns are concealed to prevent information leakage, then security is improved, but the complexity of the access system deteriorates
Solution Approach 1:
The patent extracts the access pattern information from the direct data access path by introducing separate key relationship arrays and hash tables. The actual data access patterns are concealed by routing all searches through these intermediary structures, which randomize and uniformize the access patterns, preventing information leakage while managing complexity through modular design.
Data Source
AI summary
A search key is generated (S20). A key relationship array is transmitted (S11). If an element matching the key relationship array is present, the found search key is held (S21). A key relationship index is transmitted (S22). A record read out using the key relationship index is transmitted (S12). If the record matches the search key, the found search key is held (S23). The found search key is set for an empty element of the key relationship array and is transmitted (S24). A data array is transmitted (S13). If an element matching the data array is present, the found data is held (S25). A data index is transmitted (S26). A record read out using the data index is transmitted (S14). If the record matches the search key, the found data is held (S27). Desired data is set for an empty element of the data array and is transmitted (S28).