Encrypted Record Search Using Hash Indexes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data storage systems face challenges in securely searching and processing encrypted data records without exposing plaintext data, particularly in outsourced computing models where data is stored remotely and accessed over networks.
Innovation Solution
A computer-implemented method and system for searching encrypted records using hash values, where a query is processed by calculating second hash values based on first hash values and nonces associated with each encrypted record, allowing for efficient matching using binary search algorithms in sorted hash arrays.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data is stored encrypted in remote datacenters to protect privacy, then data security is improved, but the ability to search and process the data without decryption deteriorates
Solution Approach 1:
The patent introduces encrypted indexes as an intermediary structure that enables search operations on encrypted data without requiring decryption. The indexes store encrypted representations of search terms and use cryptographic operations to match queries against encrypted records, acting as a mediator between the need for security and the need for searchability
Solution Approach 2:
The patent transforms the search problem by changing the parameter space from plaintext matching to cryptographic operation matching. Instead of comparing plaintext values, the system performs cryptographic operations on encrypted data and encrypted queries, fundamentally changing how search operations are executed while maintaining security
2Reliability
If traditional encryption methods are used to protect data, then data confidentiality is improved, but processing performance and search efficiency deteriorate
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing encrypted indexes during data ingestion and update operations. These indexes are prepared in advance and stored in optimized data structures, enabling fast search operations without requiring complex cryptographic computations during query execution
Solution Approach 2:
The patent creates cryptographic copies of search terms in the form of encrypted indexes that can be efficiently compared against encrypted data. Instead of performing expensive cryptographic operations on the original data during searches, the system uses pre-computed cryptographic representations that enable fast matching
3Reliability
If encrypted data is stored in remote locations, then data protection is improved, but access control and authorized processing become more difficult
Solution Approach 1:
The patent segments access control into multiple cryptographic layers: data encryption keys, index encryption keys, and query authentication mechanisms. Each layer provides a specific security function and can be independently managed, allowing fine-grained access control without requiring complex centralized authorization systems
Data Source
AI summary
A computer implemented method of applying a unified search for a match of one or more features in a plurality of encrypted records, comprising using one or more processors of a server associated with a database comprising a plurality of encrypted records. The processor(s) is adapted for receiving a query for searching one or more plaintext features in the plurality of encrypted, searching for a match of the one or more plaintext features using a first search methodology and a second search methodology and outputting an indication of matching encrypted records according to the match. Wherein the second search methodology is asymptotically faster than the first search methodology and wherein the first search methodology is used for searching a subset of the plurality of encrypted records selected based on status indication associated with each encrypted record.