2009Unpublished venueRequires access

Data Deletion with Time-Aware Adversary Model

Marek Klonowski, Michał Przykucki, Tomasz Strumiński

Open publisher page 0 citations

Abstract

In our paper we generalize and extend model of storing data on magnetic drives. This model allows to erase data from magnetic drives even in the presence of a very strong adversary that can read the old data overwritten arbitrary number of times. However, from the physical point of view the adversary can be even more powerful, e.g. in addition be can be able to determine the order in which bits were stored. Such an assumption in the case of very well equiped adversary trying to retrive important data can be realistic. For that reason we introduce an extended model of the adversary, that we called time-aware adversary model. We show that the solution for secure data deletion from is not suitable for the time-aware model, i.e. the adversary can reconstruct whole data stored on a magnetic drive with high probability. We investigate time-aware model and its properties and propose some solutions which (to some extent) allow provable deletion in newly introduced model.

About this research paper

What this paper is about

In our paper we generalize and extend model of storing data on magnetic drives. This model allows to erase data from magnetic drives even in the presence of a very strong adversary that can read the old data overwritten arbitrary number of times. However, from the physical point of view the adversary can be even more powerful, e.g. in addition be can be able to determine the order in which bits were stored. Such an assumption in the case of very well equiped adversary trying to retrive important data can be realistic. For that reason we introduce an extended model of the adversary, that we called time-aware adversary model. We show that the solution for secure data deletion from is not suitable for the time-aware model, i.e. the adversary can reconstruct whole data stored on a magnetic drive with high probability. We investigate time-aware model and its properties and propose some solutions which (to some extent) allow provable deletion in newly introduced model.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In our paper we generalize and extend model of storing data on magnetic drives. This model allows to erase data from magnetic drives even in the presence of a very strong adversary that can read the old data overwritten arbitrary number of times. However, from the physical point of view the adversary can be even more powerful, e.g. in addition be can be able to determine the order in which bits were stored. Such an assumption in the case of very well equiped adversary trying to retrive important data can be realistic. For that reason we introduce an extended model of the adversary, that we called time-aware adversary model. We show that the solution for secure data deletion from is not suitable for the time-aware model, i.e. the adversary can reconstruct whole data stored on a magnetic drive with high probability. We investigate time-aware model and its properties and propose some solutions which (to some extent) allow provable deletion in newly introduced model.

Key concepts: Adversary, Adversary model, Computer science, Point (geometry), Theoretical computer science, Computer security, Mathematics, Geometry

Related papers

Back to paper searchBrowse research topicsOriginal source
Data Deletion with Time-Aware Adversary Model — Research Paper | ScholarLens