loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Marek Klonowski 1 ; Tomasz Strumiński 2 and Małgorzata Sulkowska 1

Affiliations: 1 Faculty of Fundamental Problems of Technology, Department of Computer Science, Wrocław University of Science and Technology and Poland ; 2 BrightIT, Wrocław and Poland

Keyword(s): Data Deletion, Provable Security, Formal Analysis.

Related Ontology Subjects/Areas/Topics: Data and Application Security and Privacy ; Data Protection ; Database Security and Privacy ; Formal Methods for Security ; Information and Systems Security ; Personal Data Protection for Information Systems ; Security in Information Systems ; Security Requirements

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. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.136.97.64

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Klonowski, M.; Strumiński, T. and Sulkowska, M. (2019). Universal Encoding for Provably Irreversible Data Erasing. In Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - SECRYPT; ISBN 978-989-758-378-0; ISSN 2184-3236, SciTePress, pages 137-148. DOI: 10.5220/0007922101370148

@conference{secrypt19,
author={Marek Klonowski. and Tomasz Strumiński. and Małgorzata Sulkowska.},
title={Universal Encoding for Provably Irreversible Data Erasing},
booktitle={Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - SECRYPT},
year={2019},
pages={137-148},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007922101370148},
isbn={978-989-758-378-0},
issn={2184-3236},
}

TY - CONF

JO - Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - SECRYPT
TI - Universal Encoding for Provably Irreversible Data Erasing
SN - 978-989-758-378-0
IS - 2184-3236
AU - Klonowski, M.
AU - Strumiński, T.
AU - Sulkowska, M.
PY - 2019
SP - 137
EP - 148
DO - 10.5220/0007922101370148
PB - SciTePress

- Science and Technology Publications, Lda.
RESOURCES

Proceedings

Papers

Authors

Ontology

CONTACTS

Science and Technology Publications, Lda
Avenida de S. Francisco Xavier, Lote 7 Cv. C,
2900-616 Setúbal, Portugal.

Phone: +351 265 520 185 (National fixed network call)
Fax: +351 265 520 186
Email: info@scitepress.org

EXTERNAL LINKS

PRIMORIS

INSTICC

SCITEVENTS

CROSSREF

PROCEEDINGS SUBMITTED FOR INDEXATION BY:

dblp

Ei Compendex

SCOPUS

Semantic Scholar

Google Scholar

Microsoft Academic