Secure Derivative Data for Deduplication Proof
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data deduplication methods are vulnerable to attacks where attackers can generate hash values to feign ownership of data, leading to potential unauthorized access and data duplication in remote storage systems.
Innovation Solution
Implementing secure derivative data, which includes a hash of the encrypted data, a hash tree, and an encrypted key, to securely prove ownership and possession, thereby preventing data duplication and ensuring secure storage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of information
If hash values are used to prove ownership of data, then the proof size is reduced, but security is compromised allowing attackers to feign ownership
Solution Approach 1:
The patent segments the proof of ownership into multiple components: a hash of encrypted data, an encrypted key, and a hash tree structure. This segmentation allows each component to serve a specific security function while maintaining compact size, resolving the contradiction between small proof size and security reliability.
Solution Approach 2:
The patent creates a composite proof structure combining multiple cryptographic elements (hashes, encrypted keys, and hash trees) into a unified proof mechanism. This composite approach leverages the strengths of each component to achieve both compact size and high security, preventing attacker-generated hash collisions while maintaining efficient storage.
2Quantity of substance
If data deduplication is implemented, then storage efficiency is improved, but vulnerability to hash collision attacks increases
Solution Approach 1:
The patent performs preliminary cryptographic processing on data before storage, creating hash of encrypted data and hash trees in advance. This preliminary action ensures that even if deduplication is implemented, attackers cannot exploit hash collisions because the cryptographic proofs are generated from encrypted data using secure derivative functions that prevent reverse engineering.
Solution Approach 2:
The patent introduces cryptographic intermediaries (encrypted keys and hash trees) between the raw data and the deduplication mechanism. These intermediaries act as mediators that enable efficient deduplication through hash comparison while simultaneously protecting against attacks by ensuring that the hash values cannot be reverse-engineered or colluded.
3Ease of operation
If clear data is transmitted over the network for verification, then ownership proof is simplified, but security is compromised
Solution Approach 1:
The patent creates cryptographic copies (hashes and encrypted keys) of the data that can be transmitted and verified without transmitting the actual clear data. These copies maintain the essential verification functionality while eliminating security risks associated with network transmission of sensitive information.
Solution Approach 2:
The patent replaces the mechanical approach of transmitting clear data for verification with a cryptographic system using hash functions and encrypted keys. This substitution maintains verification simplicity through efficient hash comparison while eliminating the security vulnerabilities of transmitting clear data over networks.
Data Source
AI summary
Storage providers can securely store data and avoid data duplication with secure derivative data and offload the responsibility of generating the secure derivative data to the data owners. Initially, a data source will provide an encrypted version of data and the secure derivative data to a remote storage provider. The secure derivative data can include a hash of the data, a hash of the encrypted version of the data, a hash tree generated from the data, and an encrypted version of the key used to encrypt the data. When the remote storage provider later receives a request to store the same data, the remote storage provider uses the secure derivative data for secure proofs of storage and for proof of data possession.


