构建完美的隐写系统
Constructing Perfect Steganographic Systems
摘要：
我们提出隐写系统的情况下，covertexts（容器）是由一个有限的内存源可能未知的统计数据。具有和不具有隐藏信息的隐文的概率分布是相同的;这意味着所提出的隐写系统是完全安全的，即观察者不能确定是否正在传输隐藏信息。隐藏信息的传输速度可以任意接近理论极限--隐藏文本来源的香农熵。建议的隐写系统的一个有趣的特征是，它们不需要任何（秘密或公开）密钥。同时，我们概述了一些原则性的隐写术的计算限制。我们表明，有这样的来源的covertexts，任何隐写系统，具有线性（在长度的covertext）的速度传输的隐藏文本必须有一个指数Kolmogorov复杂性。这表明，特别是，一些假设的封面文本的来源是必要的。
英文摘要：
We propose steganographic systems for the case when covertexts (containers) are generated by a finite-memory source with possibly unknown statistics. The probability distributions of covertexts with and without hidden information are the same; this means that the proposed stegosystems are perfectly secure, i.e. an observer cannot determine whether hidden information is being transmitted. The speed of transmission of hidden information can be made arbitrary close to the theoretical limit - the Shannon entropy of the source of covertexts. An interesting feature of the suggested stegosystems is that they do not require any (secret or public) key. At the same time, we outline some principled computational limitations on steganography. We show that there are such sources of covertexts, that any stegosystem that has linear (in the length of the covertext) speed of transmission of hidden text must have an exponential Kolmogorov complexity. This shows, in particular, that some assumptions on the sources of covertext are necessary.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
