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

一种高效的大容量隐写技术

Efficient High Capacity Steganography Technique

Alan Anwer Abdulla, Sabah A. Jassim, Harin Sellahewa

摘要:

表征现代隐写技术的性能指标包括容量(即可以隐藏在覆盖介质中的数据量)、隐写质量(即伪影可见性)、安全性(即不可检测性)和强度或鲁棒性(旨在抵抗旨在破坏秘密消息的主动攻击)。基于Fibonacci的嵌入技术已经在文献中被研究和提出,以实现在容量方面与隐写质量有关的高效隐写。本文研究了一种新的思想,即通过位平面映射而不是位平面替换来扩展Fibonacci类隐写术。我们所提出的算法增加了嵌入容量,使用位平面映射的秘密信息的两个比特嵌入在三个比特的一个像素的封面,在代价的隐写质量的边际损失。由于Zeckendorf定理的限制,现有的Fibonacci嵌入算法不使用覆盖的某些强度进行嵌入,我们的建议解决了这个问题,并使所有强度值成为嵌入的候选者。实验结果表明,该技术相比现有的Fibonacci方法的嵌入容量增加了一倍,它是安全的,对统计攻击,如RS,直方图,和差异图像直方图(DIH)。

英文摘要:

Performance indicators characterizing modern steganographic techniques include capacity (i.e. the quantity of data that can be hidden in the cover medium), stego quality (i.e. artifacts visibility), security (i.e. undetectability), and strength or robustness (intended as the resistance against active attacks aimed to destroy the secret message). Fibonacci based embedding techniques have been researched and proposed in the literature to achieve efficient steganography in terms of capacity with respect to stego quality. In this paper, we investigated an innovative idea that extends Fibonacci-like steganography by bit-plane(s) mapping instead of bit-plane(s) replacement. Our proposed algorithm increases embedding capacity using bit-plane mapping to embed two bits of the secret message in three bits of a pixel of the cover, at the expense of a marginal loss in stego quality. While existing Fibonacci embedding algorithms do not use certain intensities of the cover for embedding due to the limitation imposed by the Zeckendorf theorem, our proposal solve this problem and make all intensity values candidates for embedding. Experimental results demonstrate that the proposed technique double the embedding capacity when compared to existing Fibonacci methods, and it is secure against statistical attacks such as RS, POV, and difference image histogram (DIH).

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

↑