Limited Access Pointers for Encrypted Database Security
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current database management systems face inefficiencies in providing access to encrypted databases, particularly in terms of computational resources and data manipulation costs, especially when anonymizing data for secure access.
Innovation Solution
The implementation of limited access pointers that allow for efficient access to encrypted database data without revealing row-wise associations, using randomized associations between database rows, thereby reducing storage and computational requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data masking and manipulation techniques are used to anonymize database data, then data security is improved, but computational cost and storage requirements increase significantly
Solution Approach 1:
The patent introduces limited access pointers as an intermediary mechanism between the database storage layer and the access layer. These pointers enable controlled data retrieval without requiring complex data masking or manipulation operations. The pointers act as a mediator that provides security through access control rather than through computationally expensive data transformation techniques.
Solution Approach 2:
The patent extracts the security function from data masking operations and separates it into a dedicated pointer-based access control mechanism. By taking out the security enforcement logic from the data itself and placing it in the access path (pointers), the system avoids the computational overhead of continuously masking and unmasking data while maintaining security.
2Reliability
If traditional data anonymization techniques are applied to encrypted databases, then access security is improved, but storage resources and computational complexity increase
Solution Approach 1:
The patent segments the database access mechanism into distinct components: data storage, pointer generation, and pointer validation. Each component has a specific function and operates independently. The limited access pointers are generated by segmenting the database row identifiers and applying cryptographic hashing, creating a modular system that reduces overall computational complexity compared to holistic data anonymization approaches.
Solution Approach 2:
The patent performs preliminary action by pre-generating limited access pointers during database setup or data loading operations. These pointers are stored alongside the data, eliminating the need for complex real-time anonymization computations during query execution. The security checks are performed once during pointer generation rather than repeatedly during each access operation.
3Stability of the object's composition
If row-wise data associations are maintained for secure access, then data integrity is improved, but storage requirements and access overhead increase
Solution Approach 1:
The patent creates a simplified copy of the row identifier information embedded within the limited access pointer structure. Rather than storing complete row-wise association metadata, the system uses cryptographic hashes of row identifiers that are significantly smaller in size. These hash copies maintain the necessary integrity verification capability while reducing storage requirements by a substantial factor.
Solution Approach 2:
The patent transforms the row identifier parameter from its original full-form representation into a hashed, condensed representation within the pointer structure. This parameter change reduces the storage size from potentially large row identifiers to compact hash values while preserving the ability to verify data integrity through hash comparison. The transformation maintains security and integrity without the storage overhead of full row metadata.
Data Source
AI summary
Various embodiments of the present invention provide methods, apparatuses, systems, computing devices, computing entities, and/or the like for facilitating efficient and effective execution of database management operations. For example, various embodiments of the present invention describe techniques for enabling access to anatomized data associated with a database table without using computationally expensive data anatomization techniques that use data masking and/or data manipulation and by using limited access pointers that are generated using randomized associations between database rows of a database table.