IEICE TRANSACTIONS on Fundamentals
Single-Letter Characterizations for Information Erasure under Restriction on the Output Distribution
Summary :
In order to erase data including confidential information stored in storage devices, an unrelated and random sequence is usually overwritten, which prevents the data from being restored. The problem of minimizing the cost for information erasure when the amount of information leakage of the confidential information should be less than or equal to a constant asymptotically has been introduced by T. Matsuta and T. Uyematsu. Whereas the minimum cost for overwriting has been given for general sources, a single-letter characterization for stationary memoryless sources is not easily derived. In this paper, we give single-letter characterizations for stationary memoryless sources under two types of restrictions: one requires the output distribution of the encoder to be independent and identically distributed (i.i.d.) and the other requires it to be memoryless but not necessarily i.i.d. asymptotically. The characterizations indicate the relation among the amount of information leakage, the minimum cost for information erasure and the rate of the size of uniformly distributed sequences. The obtained results show that the minimum costs are different between these restrictions.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E104-A No.5 pp.805-813
- Publication Date
- 2021/05/01
- Publicized
- 2020/11/09
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2020EAP1014
- Type of Manuscript
- PAPER
- Category
- Information Theory
Authors
Naruaki AMADA
University of Electro-Communications
Hideki YAGI
University of Electro-Communications
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Naruaki AMADA, Hideki YAGI, "Single-Letter Characterizations for Information Erasure under Restriction on the Output Distribution" in IEICE TRANSACTIONS on Fundamentals,
vol. E104-A, no. 5, pp. 805-813, May 2021, doi: 10.1587/transfun.2020EAP1014.
Abstract: In order to erase data including confidential information stored in storage devices, an unrelated and random sequence is usually overwritten, which prevents the data from being restored. The problem of minimizing the cost for information erasure when the amount of information leakage of the confidential information should be less than or equal to a constant asymptotically has been introduced by T. Matsuta and T. Uyematsu. Whereas the minimum cost for overwriting has been given for general sources, a single-letter characterization for stationary memoryless sources is not easily derived. In this paper, we give single-letter characterizations for stationary memoryless sources under two types of restrictions: one requires the output distribution of the encoder to be independent and identically distributed (i.i.d.) and the other requires it to be memoryless but not necessarily i.i.d. asymptotically. The characterizations indicate the relation among the amount of information leakage, the minimum cost for information erasure and the rate of the size of uniformly distributed sequences. The obtained results show that the minimum costs are different between these restrictions.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2020EAP1014/_p
Copy
@ARTICLE{e104-a_5_805,
author={Naruaki AMADA, Hideki YAGI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Single-Letter Characterizations for Information Erasure under Restriction on the Output Distribution},
year={2021},
volume={E104-A},
number={5},
pages={805-813},
abstract={In order to erase data including confidential information stored in storage devices, an unrelated and random sequence is usually overwritten, which prevents the data from being restored. The problem of minimizing the cost for information erasure when the amount of information leakage of the confidential information should be less than or equal to a constant asymptotically has been introduced by T. Matsuta and T. Uyematsu. Whereas the minimum cost for overwriting has been given for general sources, a single-letter characterization for stationary memoryless sources is not easily derived. In this paper, we give single-letter characterizations for stationary memoryless sources under two types of restrictions: one requires the output distribution of the encoder to be independent and identically distributed (i.i.d.) and the other requires it to be memoryless but not necessarily i.i.d. asymptotically. The characterizations indicate the relation among the amount of information leakage, the minimum cost for information erasure and the rate of the size of uniformly distributed sequences. The obtained results show that the minimum costs are different between these restrictions.},
keywords={},
doi={10.1587/transfun.2020EAP1014},
ISSN={1745-1337},
month={May},}
Copy
TY - JOUR
TI - Single-Letter Characterizations for Information Erasure under Restriction on the Output Distribution
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 805
EP - 813
AU - Naruaki AMADA
AU - Hideki YAGI
PY - 2021
DO - 10.1587/transfun.2020EAP1014
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E104-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2021
AB - In order to erase data including confidential information stored in storage devices, an unrelated and random sequence is usually overwritten, which prevents the data from being restored. The problem of minimizing the cost for information erasure when the amount of information leakage of the confidential information should be less than or equal to a constant asymptotically has been introduced by T. Matsuta and T. Uyematsu. Whereas the minimum cost for overwriting has been given for general sources, a single-letter characterization for stationary memoryless sources is not easily derived. In this paper, we give single-letter characterizations for stationary memoryless sources under two types of restrictions: one requires the output distribution of the encoder to be independent and identically distributed (i.i.d.) and the other requires it to be memoryless but not necessarily i.i.d. asymptotically. The characterizations indicate the relation among the amount of information leakage, the minimum cost for information erasure and the rate of the size of uniformly distributed sequences. The obtained results show that the minimum costs are different between these restrictions.
ER -
English
