arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv cs/0702161cs.ITcs.CRmath.IT
收藏

完全安全隐写术:容量、错误指数和代码构造

Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions

Ying Wang, Pierre Moulin

摘要:

本文分析了满足以下完美不可检测性条件的隐写系统。在将消息嵌入到covertext中之后,所得到的隐写文本需要具有与covertext完全相同的概率分布。那么没有统计测试可以可靠地检测隐藏消息的存在。我们称这种隐写方案为完全安全的。在最近的文献中已经提出了一些这样的方案,但他们有消失率。我们证明,通信性能可以大大提高,具体来说,我们的基本设置假设独立同分布(i.i.d.)covertext,我们构建完全安全的隐写代码从公共水印代码使用binning方法和随机排列的代码。置换是编码器和解码器之间共享的秘密密钥。我们推导出(正)容量和随机编码指数的完全安全的隐写系统。误差指数提供实现目标低误差概率所需的码长的估计。我们解决了由于完美的安全要求在通信性能的潜在损失。这种损失是相同的损失下得到一个较弱的阶-1隐写的要求,只需要匹配的一阶边缘的covertext和隐写文本分布。此外,如果覆盖文本分布是均匀的,失真度量是循环对称的,则不会发生损失;然后通过随机线性码实现隐写容量。我们的框架也可能是有用的计算安全隐写系统,具有接近最佳的通信性能。

英文摘要:

An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext, the resulting stegotext is required to have exactly the same probability distribution as the covertext. Then no statistical test can reliably detect the presence of the hidden message. We refer to such steganographic schemes as perfectly secure. A few such schemes have been proposed in recent literature, but they have vanishing rate. We prove that communication performance can potentially be vastly improved; specifically, our basic setup assumes independently and identically distributed (i.i.d.) covertext, and we construct perfectly secure steganographic codes from public watermarking codes using binning methods and randomized permutations of the code. The permutation is a secret key shared between encoder and decoder. We derive (positive) capacity and random-coding exponents for perfectly-secure steganographic systems. The error exponents provide estimates of the code length required to achieve a target low error probability. We address the potential loss in communication performance due to the perfect-security requirement. This loss is the same as the loss obtained under a weaker order-1 steganographic requirement that would just require matching of first-order marginals of the covertext and stegotext distributions. Furthermore, no loss occurs if the covertext distribution is uniform and the distortion metric is cyclically symmetric; steganographic capacity is then achieved by randomized linear codes. Our framework may also be useful for developing computationally secure steganographic systems that have near-optimal communication performance.

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

↑