Encrypted Multi-Map Querying for Concurrent End-to-End Encryption
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing end-to-end encryption technologies face challenges in providing secure data management, especially in multi-client and multi-writer settings, with vulnerabilities to data leakage and inefficiencies in concurrent operations, server crashes, and client failures.
Innovation Solution
Implementing a system with encrypted multi-map data structures and encryption schemes that support snapshot security, multiple clients, efficient concurrent operations, and resilience to client failures, using stateless architectures and optimized token-based operations to manage encrypted data securely.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If end-to-end encryption is implemented in database systems, then data security is improved, but query execution efficiency deteriorates
Solution Approach 1:
The patent segments the database into multiple encrypted multi-map data structures (EMMs), each storing encrypted versions of database collections. This segmentation allows parallel processing of encrypted data without requiring full decryption, thereby maintaining query execution efficiency while preserving data security through distributed encryption management.
Solution Approach 2:
The patent introduces encrypted indexes as intermediary structures that enable efficient search and query operations on encrypted data. These indexes store encrypted keys and values that act as mediators between the encryption layer and query processing layer, allowing the system to maintain both data security and query efficiency by operating on encrypted representations rather than requiring decryption of all data.
2Device complexity
If traditional encryption schemes are used, then implementation simplicity is maintained, but vulnerability to data leakage increases
Solution Approach 1:
The patent applies different encryption schemes to different parts of the database system based on their specific security requirements. Encrypted multi-maps use one encryption approach for storing encrypted collections, while encrypted indexes use another approach for enabling efficient queries. This localized application of encryption techniques provides targeted protection against data leakage while maintaining implementation feasibility through modular design.
Solution Approach 2:
The patent combines multiple encryption techniques and data structures into a composite system. It integrates encrypted multi-maps, encrypted indexes, and various encryption schemes (such as symmetric and asymmetric encryption) to create a multi-layered security architecture that resists data leakage attacks while remaining implementable through systematic integration of proven cryptographic methods.
3Reliability
If encryption is applied to all data structures, then security is improved, but storage overhead increases
Solution Approach 1:
The patent implements dynamic encryption where the level and type of encryption applied to data structures adapts based on their access patterns and security requirements. Frequently accessed data may use more efficient encryption schemes with lower overhead, while less accessed data uses stronger encryption. This dynamic approach maintains high security across all data while optimizing storage overhead by avoiding uniform application of maximum-security encryption to all data structures.
Data Source
AI summary
According to some aspects, provided are systems and methods that implement end-to-end encryption, and provide implementation configured to secure information during execution of queries on an encrypted data source. Various embodiments include multiple encrypted multi-map data structures and associated encryption schemes configured to securely read, write, and delete information while supporting any one or more of the following features: snapshot security, multiple client support, efficient execution under concurrent operation, and resilience to client failures. In various embodiments, addressable multi-map data structures enable concurrent access, and allow correct operation under polynomial time constraints.