当前位置: X-MOL 学术IEEE Signal Process. Lett. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Fast and Secure Steganography Based on J-UNIWARD
IEEE Signal Processing Letters ( IF 3.2 ) Pub Date : 2020-01-01 , DOI: 10.1109/lsp.2020.2964485
Ante Su , Sai Ma , Xianfeng Zhao

Adaptive steganography based on minimizing additive distortion model with Syndrome-Trellis Codes (STCs) is considered as a state-of-the-art technique of covert communication. However, the running time on mobile phone with large size image is not acceptable. The current approach only accelerates STCs embedding. J-UNIWARD, as one of the most secure distortion function, its calculation time is ten times longer than STCs embedding time. Therefore, just accelerating STCs embedding will only result in a small decrease in total running time. In this letter, we propose a fast and secure steganography based on properly simplifying J-UNIWARD. A simplified distortion function based on J-UNIWARD is designed to reduce time complexity. Besides, we propose a segmented STCs, which increases the computational parallelism of STCs embedding by several times without significantly degrading the security. Experimental results demonstrate that the proposed method can be three times faster than J-UNIWARD at only a very slight price of security.

中文翻译:

基于 J-UNIWARD 的快速安全隐写术

基于使用综合征格码 (STC) 最小化加性失真模型的自适应隐写术被认为是最先进的隐蔽通信技术。但是,在大尺寸图像的手机上的运行时间是不可接受的。当前的方法仅加速 STC 嵌入。J-UNIWARD,作为最安全的失真函数之一,其计算时间比STCs嵌入时间长十倍。因此,仅仅加速 STC 嵌入只会导致总运行时间的小幅减少。在这封信中,我们提出了一种基于适当简化 J-UNIWARD 的快速且安全的隐写术。基于 J-UNIWARD 的简化失真函数旨在降低时间复杂度。此外,我们提出了一个分段的 STC,这将 STC 嵌入的计算并行性提高了数倍,而不会显着降低安全性。实验结果表明,所提出的方法可以比 J-UNIWARD 快三倍,而安全代价很小。
更新日期:2020-01-01
down
wechat
bug