Encrypted File Search via Bloom Filter Indexing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Traditional cryptographic key management systems rely on centralized servers and passwords, which are vulnerable to security risks and difficult to manage.
Innovation Solution
A method for searching encrypted files without decrypting them, using a system that includes a bloom filter index with a file public secret, proof of work, multipart threshold public encryption key, and multipart threshold public search key, allowing for secure and decentralized key management among multiple devices.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If centralized key servers and passwords are used for cryptographic key management, then key distribution and access control are simplified, but security vulnerabilities increase and system reliability decreases
Solution Approach 1:
The patent segments the cryptographic key into multiple shares using secret sharing schemes (e.g., Shamir's Secret Sharing). Each device holds a portion of the key material, and a threshold number of devices are required to reconstruct the full key. This eliminates the single point of failure in centralized key servers while maintaining ease of key distribution and access control.
Solution Approach 2:
The patent implements nested cryptographic structures where public keys are embedded within encrypted file metadata, and secret shares are nested within device storage. The bloom filter index is nested within the encrypted file structure, allowing search functionality without decryption. This layered approach enhances security while preserving operational simplicity.
2Measurement precision
If encrypted files are searched by decrypting them first, then search accuracy is improved, but security is compromised and processing time increases
Solution Approach 1:
The patent creates bloom filter indexes from public key components and metadata before encryption occurs. These indexes are stored in an encrypted form within the file structure. When searching, the query is processed against these pre-generated indexes without requiring decryption of the actual file content, thus maintaining both security and search accuracy.
Solution Approach 2:
The patent introduces bloom filters as an intermediary structure between the encrypted file content and the search query. The bloom filter operates on public key derivatives and metadata, providing accurate search results without exposing the encrypted content. This intermediary layer enables precise searching while maintaining cryptographic security.
3Adaptability or versatility
If traditional key management systems are used, then device compatibility is improved, but security risks from centralized storage increase
Solution Approach 1:
The patent implements a universal key management system where multiple devices can participate in key reconstruction through standardized secret sharing protocols. The system works across different device types and platforms, providing both broad compatibility and enhanced security by distributing key material across the device ecosystem rather than centralizing it.
Data Source
AI summary
A method for searching an encrypted file comprises: receiving a query from a first device of a set of devices; tokenizing the query; searching the encrypted file, without decrypting the file, for the tokenized query; aggregating results of the search; and outputting the aggregated results. The searching includes checking a bloom filter of an index of the encrypted file. The index includes a file public secret (R), a proof of work for the file secret (Rproof), a multipart threshold public encryption key (LKe-pub), a multipart threshold public search key (LKs-pub), and the bloom filter. The bloom filter including index values that are elliptic curve paired between a curve-hashed token of the encrypted file and the product of the encrypted file's ephemeral secret value (r) and the multipart threshold public search key (LKs-pub).