Off-By-One Implementation Error in J-UNIWARD

TL;DR

This paper investigates a subtle off-by-one implementation error in J-UNIWARD, a JPEG steganography method, assessing its impact on costmaps and steganalysis performance, finding minimal effects.

Contribution

It identifies and evaluates the effect of a specific off-by-one bug in J-UNIWARD's implementation on its costmaps and steganalysis results.

Findings

Some image blocks are over-priced or under-priced due to the error.

The off-by-one error has a relatively small impact on costmaps.

Steganalysis performance is largely unaffected by the error.

Abstract

J-UNIWARD is a popular steganography method for hiding secret messages in JPEG cover images. As a content-adaptive method, J-UNIWARD aims to embed into textured image regions where changes are difficult to detect. To this end, J-UNIWARD first assigns to each DCT coefficient an embedding cost calculated based on the image's Wavelet residual, and then uses a coding method that minimizes the cost while embedding the desired payload. Changing one DCT coefficient affects a 23x23 window of Wavelet coefficients. To speed up the costmap computation, the original implementation pre-computes the Wavelet residual and then considers per changed DCT coefficient a 23x23 window of the Wavelet residual. However, the implementation accesses a window accidentally shifted by one pixel to the bottom right. In this report, we evaluate the effect of this off-by-one error on the resulting costmaps. Some image blocks are over-priced while other image blocks are under-priced, but the difference is relatively small. The off-by-one error seems to make little difference for learning-based steganalysis.