SciTePress - Affiliation Profile

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Affiliation

Select a Subject
Refine Ontology Subject

Faculty of Fundamental Problems of Technology, Department of Computer Science, Wrocław University of Science and Technology and Poland

Context (please use complete words only)

Field

Sort by

1 Papers

Universal Encoding for Provably Irreversible Data Erasing

Topics: Security Requirements; Personal Data Protection for Information Systems; Data Protection; Database Security and Privacy; Formal Methods for Security

Authors: Marek Klonowski ¹ , Tomasz Strumiński ² and Małgorzata Sulkowska ¹

Affiliations: ¹ Faculty of Fundamental Problems of Technology, Department of Computer Science, Wrocław University of Science and Technology and Poland , ² BrightIT, Wrocław and Poland

Digital Object Identifier: 10.5220/0007922101370148

Proceedings of SECRYPT 2019, ISBN: 978-989-758-378-0

Quick Abstract

One of the most important assumptions in computer security research is that one can permanently delete some data in such a way that no party can retrieve it. In real-life systems this postulate is realized dependently on the specific device used for storing data. In some cases (e.g., magnetic discs) the deletion/erasing is done by overwriting the data to be erased by new one. Many evidence suggest that such procedure may be not sufficient and the attacker armed with advanced microscopic technology is capable in many cases of retrieving data overwritten even many times. In this paper we present a method that provides provable, permanent and irreversible deletion of stored bits based solely on special encoding and processing of data. More precisely the adversary learns nothing about deleted data whp. The security guarantees hold even if the attacker is capable of getting bit-strings overwritten many times. Moreover, in contrast to some previous research, we do not restrict type of data to be deleted.

Related Ontology Subjects/Areas/Topics (8)

Data and Application Security and Privacy	Formal Methods for Security	Security in Information Systems
Data Protection	Information and Systems Security	Security Requirements
Database Security and Privacy	Personal Data Protection for Information Systems