Data Atomization and Key Extraction for Cloud Security
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for securely storing and retrieving data, especially in cloud storage, are vulnerable to interception and hacking due to weaknesses in deterministic algorithms and limited randomness, leading to potential decryption of encrypted files once accessed by hackers.
Innovation Solution
A method involving random fragmentation of data into 'Atoms' and distributing them across multiple zones with an AtomKey for reassembly, where the AtomKey is kept separate from the cloud storage to maintain control and security, using a system that atomizes data into disassociated segments and encrypts them with long random keys, ensuring only the user can decrypt and reassemble the data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If data is encrypted using deterministic algorithms with limited randomness, then encryption can be performed efficiently, but the encryption becomes vulnerable to decryption once keys are compromised
Solution Approach 1:
The patent divides confidential data into multiple discrete packets using an Information Dispersal Algorithm (IDA). Each packet contains only a portion of the original data and cannot be decrypted independently. The data is further segmented into Fragments that are distributed across multiple storage locations, ensuring that no single location contains enough information to compromise security.
Solution Approach 2:
The patent introduces a temporal dimension to the encryption scheme by implementing a Time Release Mechanism. Even if all data packets are intercepted, the decrypted data remains useless until a specific release time is reached. This adds a time-based layer of security that prevents immediate exploitation of intercepted data.
2Object-affected harmful factors
If data is dispersed into multiple packets for security, then interception difficulty increases, but all packets can still be collected at network pinch points
Solution Approach 1:
The patent divides confidential data into multiple discrete packets using an Information Dispersal Algorithm (IDA). Each packet contains only a portion of the original data and cannot be decrypted independently. The data is further segmented into Fragments that are distributed across multiple storage locations, ensuring that no single location contains enough information to compromise security.
Solution Approach 2:
The patent introduces decoy packets that appear to be valid data packets but contain encrypted dummy information. These decoys are distributed alongside real data packets, making it difficult for attackers to distinguish between real and fake packets. This intermediary element adds confusion and increases the effort required to successfully intercept and decrypt actual data.
3Ease of operation
If encryption keys are controlled by cloud service providers for convenience, then data access is simplified, but key security cannot be guaranteed
Solution Approach 1:
The patent extracts the decryption key generation and control functions from the cloud service provider and places them exclusively on the user's device. The system uses the user's existing encryption keys (from email, file encryption, or other sources) to generate decryption keys locally, eliminating the need to trust the cloud provider with key management. This extraction of key control ensures that even if the cloud provider is compromised, the attacker cannot decrypt the data without the user's private keys.
4Reliability
If data files are kept by hackers after interception, then computational resources can be applied to decrypt files, but time can be used against the user
Solution Approach 1:
The patent introduces a temporal dimension to the encryption scheme by implementing a Time Release Mechanism. Even if all data packets are intercepted, the decrypted data remains useless until a specific release time is reached. This adds a time-based layer of security that prevents immediate exploitation of intercepted data and forces attackers to wait, during which time the user can detect and respond to the breach.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method for securing user data includes the steps of: a) setting the user data as input data; b) randomly fragmenting the input data into a plurality of Atoms and randomly distributing the Atoms into an AtomPool and an AtomKey; and c) recording information about the fragmentation and the distribution of step b) into an AtomMap.