arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.04750cs.MMcs.CReess.IV
收藏

利用 JPEG 编码器输出的无差错鲁棒 JPEG 隐写术

Errorless Robust JPEG Steganography using Outputs of JPEG Coders

Jan Butora, Pauline Puteaux, Patrick Bas

AI总结:

本文提出一种基于 DCT 系数格的 JPEG 隐写方法,通过分析系数在再压缩中的行为构建鲁棒集合,实现无差错消息恢复,并验证了其安全性。

摘要:

鲁棒隐写术是一种将秘密消息隐藏在图像中,使得消息在经历额外图像处理后仍可恢复的技术。最常见的处理操作之一是 JPEG 再压缩。遗憾的是,目前大多数针对这一问题的隐写方法仅提供恢复秘密的概率性保证,因此并非无差错。这是不可接受的,因为即使是一个意外的改变,也可能使加密后的整个消息无法读取。我们提出通过检查 DCT 系数在再压缩过程中的行为来构建一个鲁棒集合,这需要访问目标 JPEG 压缩器。具体做法是将 DCT 系数划分为 64 个互不重叠的格,因为在再压缩过程中,一次嵌入修改可能潜在地影响同一 DCT 块中的许多其他系数。然后将鲁棒性与标准隐写代价相结合,创建一种对 JPEG 再压缩具有鲁棒性的格嵌入方案。通过实验,我们表明鲁棒集合的大小和方案的安全性取决于嵌入过程中格的排序。我们用三种典型的 JPEG 压缩器和 Slack 即时通讯应用验证了所提方法的有效性。我们针对不同的嵌入载荷、三种不同的格排序方式以及一系列质量因子对其安全性进行了基准测试。最后,该方法在构造上就是无差错的,意味着嵌入的消息将始终可读。

英文摘要:

Robust steganography is a technique of hiding secret messages in images so that the message can be recovered after additional image processing. One of the most popular processing operations is JPEG recompression. Unfortunately, most of today's steganographic methods addressing this issue only provide a probabilistic guarantee of recovering the secret and are consequently not errorless. That is unacceptable since even a single unexpected change can make the whole message unreadable if it is encrypted. We propose to create a robust set of DCT coefficients by inspecting their behavior during recompression, which requires access to the targeted JPEG compressor. This is done by dividing the DCT coefficients into 64 non-overlapping lattices because one embedding change can potentially affect many other coefficients from the same DCT block during recompression. The robustness is then combined with standard steganographic costs creating a lattice embedding scheme robust against JPEG recompression. Through experiments, we show that the size of the robust set and the scheme's security depends on the ordering of lattices during embedding. We verify the validity of the proposed method with three typical JPEG compressors and the {\it Slack} instant messaging application. We benchmark its security for various embedding payloads, three different ways of ordering the lattices, and a range of Quality Factors. Finally, this method is errorless by construction, meaning the embedded message will always be readable.

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

↑