Distributed Data Erasure Verification via Feedback and Segmentation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing distributed systems face challenges in securely and verifiably deleting data due to the complexity of managing multiple copies across redundant storage nodes, which is critical for protecting sensitive information from espionage or identity theft.

Innovation Solution

Implementing a method that allows customer entities to securely and permanently erase data by leveraging the inherent secure erase capabilities of storage devices, such as self-encrypting hard disk drives or solid state disk drives, or by encrypting data with cryptographic keys and tracking their disposition, ensuring data is irreversibly inaccessible.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If data is replicated across multiple storage nodes for reliability and scalability, then system availability and performance are improved, but the complexity and difficulty of verifying complete data erasure increases

Engineering Contradiction:
Improvedata availabilityVSAvoiderasure verification complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent implements a feedback mechanism where a verification process confirms that data has been successfully erased from all storage nodes. The system receives verification data from storage nodes and processes this feedback to confirm complete erasure, resolving the contradiction by providing automated verification despite the distributed nature of the system

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The patent introduces an intermediary verification process that mediates between the erasure command and the final confirmation. This intermediary layer coordinates the erasure verification across multiple storage nodes, simplifying the overall complexity while maintaining reliability through systematic verification

Inventive Principle:
Principle #24Intermediary (Mediator)

2Object-affected harmful factors

If secure erasure methods are implemented across distributed storage systems, then data security is improved, but the time and resources required for complete erasure verification increase

Engineering Contradiction:
Improvedata security riskVSAvoiderasure verification time
Core Design Contradiction:
Object-affected harmful factorsVSLoss of time

Solution Approach 1:

The patent applies preliminary action by establishing verification processes and protocols before the actual erasure operation. Storage nodes are pre-configured with verification capabilities and the verification process is initiated immediately upon erasure command, reducing the overall time required while maintaining security

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent segments the verification process into independent tasks that can be executed in parallel across multiple storage nodes. Each node performs its verification independently and reports back, allowing concurrent verification that reduces total verification time while maintaining comprehensive security coverage

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS8738935B1Verified erasure of data implemented on distributed systems
Publication Date: 2014.05.27 AMAZON TECH INC
  • US8738935B1 patent drawing
  • US8738935B1 patent drawing
  • US8738935B1 patent drawing

AI summary

Systems, methods and related processes for securely erasing and/or rendering permanently inaccessible data stored on storage systems securely erased is described. Such storage systems may, in some aspects, integrate hardware capable of secure erasure. In some aspects, a cryptographically-based system is utilized.