Linked e-resources
Details
Table of Contents
Acknowledgments; Contents; Acronyms; Part I Introduction and Background; 1 Introduction; 1.1 Organization and Structure; 2 RelatedWork on Secure Deletion; 2.1 Introduction; 2.2 RelatedWork; 2.2.1 Layers and Interfaces; 2.2.2 Physical-Layer and Controller-Layer Sanitization; 2.2.3 User-Level Solutions; 2.2.4 File-System-Level Solutions with In-Place Updates; 2.2.5 Cross-layer Solutions; 2.2.6 Summary; 2.3 Adversarial Model; 2.3.1 Classes of Adversarial Capabilities; 2.3.2 Summary; 2.4 Analysis of Solutions; 2.4.1 Classes of Environmental Assumptions; 2.4.2 Classes of Behavioural Properties.
2.4.3 Summary3 System Model and Security Goal; 3.1 Introduction; 3.2 System Model; 3.3 Storage Medium Models; 3.4 Adversarial Model; 3.5 Security Goal; Part II Secure Deletion for Mobile Storage; 4 Flash Memory: Background and Related Work; 4.1 Overview; 4.2 Flash Memory; 4.2.1 In-Place Updates and Log-Structured File Systems; 4.2.2 Flash Translation Layer; 4.2.3 Flash File Systems; 4.2.4 Generalizations to Other Media; 4.3 RelatedWork for Flash Secure Deletion; 4.4 Summary; 5 User-Level Secure Deletion on Log-Structured File Systems; 5.1 Introduction; 5.2 System and Adversarial Model.
5.3 YAFFS5.4 Data Deletion in Existing Log-Structured File Systems; 5.4.1 Instrumented YAFFS; 5.4.2 Simulating Larger Storage Media; 5.5 User-Space Secure Deletion; 5.5.1 Purging; 5.5.2 Ballooning; 5.5.3 Hybrid Solution: Ballooning with Purging; 5.6 Experimental Evaluation; 5.6.1 Experimental Results; 5.7 Summary; 5.8 Research Questions; 6 Data Node Encrypted File System; 6.1 Introduction; 6.2 System and Adversarial Model; 6.3 DNEFS's Design; 6.3.1 Key Storage Area; 6.3.2 Keystore; 6.3.3 Clocked Keystore Implementation; 6.3.4 Clock Operation: KSA Update; 6.3.5 Key-State Map; 6.3.6 Summary.
6.4 Extensions and Optimizations6.4.1 Granularity Trade-off; 6.4.2 KSA Update Policies; 6.4.3 KSA Organization; 6.4.4 Improving Reliability; 6.4.5 Encrypted File System; 6.5 Summary; 6.6 Research Questions; 7 UBIFSec: Adding DNEFS to UBIFS; 7.1 Introduction; 7.2 System and Adversarial Model; 7.3 Background; 7.3.1 MTD and UBI Layers; 7.3.2 UBIFS; 7.4 UBIFSec Design; 7.4.1 Key Storage Area; 7.4.2 Key-State Map; 7.4.3 Summary; 7.5 Experimental Validation; 7.5.1 Android Implementation; 7.5.2 Wear Analysis; 7.5.3 Power Consumption; 7.5.4 Throughput Analysis; 7.5.5 Timing Analysis; 7.6 Conclusions.
7.7 Practitioner's NotesPart III Secure Deletion for Remote Storage; 8 Cloud Storage: Background and Related Work; 8.1 Introduction; 8.2 Persistent Storage; 8.2.1 Securely Deleting and Persistent Combination; 8.2.2 Cloud Storage; 8.3 RelatedWork; 8.4 Summary; 9 Secure Data Deletion from Persistent Media; 9.1 Introduction; 9.2 System and Adversarial Model; 9.3 Graph Theory Background; 9.4 Graph-Theoretic Model of Key Disclosure; 9.4.1 Key Disclosure Graph; 9.4.2 Secure Deletion; 9.5 Shadowing Graph Mutations; 9.5.1 Mangrove Preservation; 9.5.2 Shadowing Graph Mutation Chains.
2.4.3 Summary3 System Model and Security Goal; 3.1 Introduction; 3.2 System Model; 3.3 Storage Medium Models; 3.4 Adversarial Model; 3.5 Security Goal; Part II Secure Deletion for Mobile Storage; 4 Flash Memory: Background and Related Work; 4.1 Overview; 4.2 Flash Memory; 4.2.1 In-Place Updates and Log-Structured File Systems; 4.2.2 Flash Translation Layer; 4.2.3 Flash File Systems; 4.2.4 Generalizations to Other Media; 4.3 RelatedWork for Flash Secure Deletion; 4.4 Summary; 5 User-Level Secure Deletion on Log-Structured File Systems; 5.1 Introduction; 5.2 System and Adversarial Model.
5.3 YAFFS5.4 Data Deletion in Existing Log-Structured File Systems; 5.4.1 Instrumented YAFFS; 5.4.2 Simulating Larger Storage Media; 5.5 User-Space Secure Deletion; 5.5.1 Purging; 5.5.2 Ballooning; 5.5.3 Hybrid Solution: Ballooning with Purging; 5.6 Experimental Evaluation; 5.6.1 Experimental Results; 5.7 Summary; 5.8 Research Questions; 6 Data Node Encrypted File System; 6.1 Introduction; 6.2 System and Adversarial Model; 6.3 DNEFS's Design; 6.3.1 Key Storage Area; 6.3.2 Keystore; 6.3.3 Clocked Keystore Implementation; 6.3.4 Clock Operation: KSA Update; 6.3.5 Key-State Map; 6.3.6 Summary.
6.4 Extensions and Optimizations6.4.1 Granularity Trade-off; 6.4.2 KSA Update Policies; 6.4.3 KSA Organization; 6.4.4 Improving Reliability; 6.4.5 Encrypted File System; 6.5 Summary; 6.6 Research Questions; 7 UBIFSec: Adding DNEFS to UBIFS; 7.1 Introduction; 7.2 System and Adversarial Model; 7.3 Background; 7.3.1 MTD and UBI Layers; 7.3.2 UBIFS; 7.4 UBIFSec Design; 7.4.1 Key Storage Area; 7.4.2 Key-State Map; 7.4.3 Summary; 7.5 Experimental Validation; 7.5.1 Android Implementation; 7.5.2 Wear Analysis; 7.5.3 Power Consumption; 7.5.4 Throughput Analysis; 7.5.5 Timing Analysis; 7.6 Conclusions.
7.7 Practitioner's NotesPart III Secure Deletion for Remote Storage; 8 Cloud Storage: Background and Related Work; 8.1 Introduction; 8.2 Persistent Storage; 8.2.1 Securely Deleting and Persistent Combination; 8.2.2 Cloud Storage; 8.3 RelatedWork; 8.4 Summary; 9 Secure Data Deletion from Persistent Media; 9.1 Introduction; 9.2 System and Adversarial Model; 9.3 Graph Theory Background; 9.4 Graph-Theoretic Model of Key Disclosure; 9.4.1 Key Disclosure Graph; 9.4.2 Secure Deletion; 9.5 Shadowing Graph Mutations; 9.5.1 Mangrove Preservation; 9.5.2 Shadowing Graph Mutation Chains.