arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.07462cs.ITmath.IT
收藏

最小信息获取成本的信息论分析

An Information-Theoretical Analysis of the Minimum Cost to Erase Information

Tetsunao Matsuta, Tomohiko Uyematsu

摘要:

我们通常在硬盘驱动器和固态驱动器中保存大量机密信息。当我们想要擦除这些信息以防止泄漏时,我们必须用与信息无关的符号序列来覆盖信息序列。只有在被覆盖的符号与原始符号不同的地方才需要覆盖。然后,覆写的成本(诸如用于擦除信息的覆写符号的数量)是重要的。在本文中,我们澄清了最小成本,如最小数量的重写删除信息的弱和强独立性标准。前者(resp。后者)标准表示原始序列和重写序列之间的互信息被归一化(分别为未归一化)小于给定的期望值。

英文摘要:

We normally hold a lot of confidential information in hard disk drives and solid-state drives. When we want to erase such information to prevent the leakage, we have to overwrite the sequence of information with a sequence of symbols independent of the information. The overwriting is needed only at places where overwritten symbols are different from original symbols. Then, the cost of overwrites such as the number of overwritten symbols to erase information is important. In this paper, we clarify the minimum cost such as the minimum number of overwrites to erase information under weak and strong independence criteria. The former (resp. the latter) criterion represents that the mutual information between the original sequence and the overwritten sequence normalized (resp. not normalized) by the length of the sequences is less than a given desired value.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑