Differential Privacy for Cloud Storage Access Patterns
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current encryption methods in cloud storage systems fail to effectively conceal data access patterns, leading to potential privacy breaches, and traditional Oblivious Random Access Memory (ORAM) solutions are hindered by high bandwidth overhead and storage requirements, making them impractical for widespread deployment.
Innovation Solution
Implementing differentially private access methods that relax security requirements, using fake queries and probabilistic storage strategies to conceal access patterns while maintaining data privacy, and integrating with Oblivious Random Access Memory (ORAM) and Oblivious Storage (OS) to achieve efficient and secure data retrieval without revealing access sequences.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional encryption methods are used in cloud storage systems, then data confidentiality is improved, but data access patterns are revealed leading to privacy breaches
Solution Approach 1:
The patent introduces oblivious transfer protocols as an intermediary mechanism between the client and cloud storage system. This protocol allows the client to retrieve encrypted data blocks without revealing which blocks are being accessed, thereby concealing access patterns while maintaining data confidentiality. The mediator (oblivious transfer protocol) hides the client's intent from the cloud storage provider.
Solution Approach 2:
The patent creates multiple copies of data blocks across different cloud storage locations and uses cryptographic techniques to allow retrieval of any copy without revealing which specific copy or location is being accessed. This copying strategy, combined with oblivious transfer, prevents the cloud provider from inferring access patterns based on which original data location is queried.
2Object-affected harmful factors
If Oblivious Random Access Memory (ORAM) solutions are implemented to conceal access patterns, then data privacy is improved, but bandwidth overhead and storage requirements increase significantly
Solution Approach 1:
The patent applies partial ORAM techniques where only certain data blocks or access patterns are obscured using full ORAM protocols, while other accesses use more efficient differential privacy mechanisms. This selective approach reduces overall bandwidth overhead compared to applying full ORAM to all accesses, while still providing adequate privacy protection for the most sensitive operations.
Solution Approach 2:
The patent changes the security parameter model from requiring complete obliviousness to accepting differential privacy guarantees. This parameter change allows the system to use less bandwidth-intensive techniques that provide sufficient privacy protection under relaxed security definitions, thereby reducing the bandwidth overhead associated with traditional ORAM.
3Object-affected harmful factors
If Oblivious Random Access Memory (ORAM) solutions are implemented to conceal access patterns, then data privacy is improved, but storage requirements increase significantly
Solution Approach 1:
The patent implements partial ORAM where only a subset of data blocks are managed through full ORAM structures, while other blocks use simpler storage schemes. This partial application reduces the overall storage overhead compared to implementing complete ORAM for all data, while maintaining privacy protection for the most sensitive data blocks.
Solution Approach 2:
The patent segments the storage system into different regions or layers: hot data that requires strong privacy protection uses ORAM structures, while cold data uses more efficient storage schemes. This segmentation allows the system to optimize storage requirements by applying heavy privacy mechanisms only where necessary, rather than uniformly across all data.
4Object-affected harmful factors
If fake queries are used to conceal access patterns, then data privacy is improved, but query processing time and system complexity increase
Solution Approach 1:
The patent implements fake queries periodically rather than for every data access. By injecting dummy queries at regular intervals or based on access frequency thresholds, the system conceals access patterns without incurring the time overhead of fake queries for every single operation, thereby reducing overall query processing time while still preventing access pattern leakage.
Solution Approach 2:
The patent uses fake queries selectively based on the sensitivity of the data being accessed or the access pattern itself. Not all queries require fake query obfuscation - the system applies this technique partially to the most sensitive operations, reducing the overall time overhead compared to applying fake queries to every query while still protecting against access pattern leakage for critical data.
Data Source
AI summary
A method executing an instruction (300) to execute a query (q) for a data block (102) and determining whether the data block is stored in a block stash (370). When the data block is stored in the block stash during a download phase, the method includes removing the data block from the block stash, sending a fake query (304) to a distributed system (140) to retrieve a random data block stored in memory (114) of a distributed system (140), and discarding the random data block. When a current version of the data block is stored in the block stash during an overwrite phase, the method includes sending a fake query to the distributed system to retrieve another random data block stored in the memory of the distributed system, decrypting and re-encrypting the random data block with fresh randomness, and re-uploading the re-encrypted random data block onto the distributed system.