Shuozhong Wang

Cyber warfare: steganography vs. steganalysis

For every clever method and tool being developed to hide information in multimedia data, an equal number of clever methods and tools are being developed to detect and reveal its secrets.

Vulnerability of pixel-value differencing steganography to histogram analysis and modification for enhanced security

The pixel-value differencing (PVD) steganography can embed a large amount of secret bits into a still image with high imperceptibility as it makes use of the characteristics of human vision sensitivity. However, a loophole exists in the PVD method. Unusual steps in the histogram of pixel differences reveal the presence of a secret message. An analyst can even estimate the length of hidden bits from the histogram. To enhance security, a modified scheme is proposed which avoids occurrence of the above-mentioned steps in the pixel difference histogram while preserving the advantage of low visual distortion of the PVD. The histogram-based steganalysis is therefore defeated.

Steganography using multiple-base notational system and human vision sensitivity

This letter proposes a novel steganographic scheme that employs human vision sensitivity to hide a large amount of secret bits into a still image with a high imperceptibility. In this method, data to be embedded are converted into a series of symbols in a notation system with multiple bases. The specific bases used are determined by the degree of local variation of the pixel magnitudes in the host image so that pixels in busy areas can potentially carry more hidden data. Experimental results are given to show the advantage of this adaptive technique.

Fragile Watermarking With Error-Free Restoration Capability

This paper proposes a novel fragile watermarking scheme capable of perfectly recovering the original image from its tampered version. In the scheme, a tailor-made watermark consisting of reference-bits and check-bits is embedded into the host image using a lossless data hiding method. On the receiver side, by comparing the extracted and calculated check-bits, one can identify the tampered image-blocks. Then, the reliable reference-bits extracted from other blocks are used to exactly reconstruct the original image. Although content replacement may destroy a portion of the embedded watermark data, as long as the tampered area is not too extensive, the original image information can be restored without any error.

Reference Sharing Mechanism for Watermark Self-Embedding

This paper proposes two novel self-embedding watermarking schemes based upon a reference sharing mechanism, in which the watermark to be embedded is a reference derived from the original principal content in different regions and shared by these regions for content restoration. After identifying tampered blocks, both the reference data and the original content in the reserved area are used to recover the principal content in the tampered area. By using the first scheme, the original data in five most significant bit layers of a cover image can be recovered and the original watermarked image can also be retrieved when the content replacement is not too extensive. In the second scheme, the host content is decomposed into three levels, and the reference sharing methods with different restoration capabilities are employed to protect the data at different levels. Therefore, the lower the tampering rate, the more levels of content data are recovered, and the better the quality of restored results.

Statistical Fragile Watermarking Capable of Locating Individual Tampered Pixels

Capability of accurately locating tampered pixels is desirable in image authentication. We propose a novel statistical scheme of fragile watermarking, in which a set of tailor-made authentication data for each pixel together with some additional test data are embedded into the host image. On the authentication side, examining the pixels and their corresponding authentication data will reveal the exact pattern of the content modification. As long as the tampered area is not too extensive, two distinct probability distributions corresponding to tampered and original pixels can be used to exactly identify the tampered pixels.

Fast communication: Fragile watermarking scheme using a hierarchical mechanism

This paper proposes a novel fragile watermarking scheme with a hierarchical mechanism, in which pixel-derived and block-derived watermark data are carried by the least significant bits of all pixels. On the receiver side, after identifying the blocks containing tampered content, the watermark data hidden in the rest blocks are exploited to exactly locate the tampered pixels. Moreover, using exhaustive attempts, the proposed scheme is capable of recovering the original watermarked version without any error.

Robust Hashing for Image Authentication Using Zernike Moments and Local Features

A robust hashing method is developed for detecting image forgery including removal, insertion, and replacement of objects, and abnormal color modification, and for locating the forged area. Both global and local features are used in forming the hash sequence. The global features are based on Zernike moments representing luminance and chrominance characteristics of the image as a whole. The local features include position and texture information of salient regions in the image. Secret keys are introduced in feature extraction and hash construction. While being robust against content-preserving image processing, the hash is sensitive to malicious tampering and, therefore, applicable to image authentication. The hash of a test image is compared with that of a reference image. When the hash distance is greater than a threshold τ1 and less than τ2, the received image is judged as a fake. By decomposing the hashes, the type of image forgery and location of forged areas can be determined. Probability of collision between hashes of different images approaches zero. Experimental results are presented to show effectiveness of the method.

Reversible Data Hiding in Encrypted JPEG Bitstream

This correspondence proposes a framework of reversible data hiding (RDH) in an encrypted JPEG bitstream. Unlike existing RDH methods for encrypted spatial-domain images, the proposed method aims at encrypting a JPEG bitstream into a properly organized structure, and embedding a secret message into the encrypted bitstream by slightly modifying the JPEG stream. We identify usable bits suitable for data hiding so that the encrypted bitstream carrying secret data can be correctly decoded. The secret message bits are encoded with error correction codes to achieve a perfect data extraction and image recovery. The encryption and embedding are controlled by encryption and embedding keys respectively. If a receiver has both keys, the secret bits can be extracted by analyzing the blocking artifacts of the neighboring blocks, and the original bitstream perfectly recovered. In case the receiver only has the encryption key, he/she can still decode the bitstream to obtain the image with good quality without extracting the hidden data.

Improving Embedding Efficiency of Covering Codes for Applications in Steganography

In image steganography, each pixel can carry a ternary message by choosing adding/subtracting one to/from the gray value. Although ternary covering functions can provide embedding efficiency higher than binary ones, it is necessary to convert the binary message into a ternary format. We propose a novel method that improves the embedding efficiency of binary covering functions by fully exploiting the information contained in the choice of addition or subtraction in the embedding. The improved scheme can perform equally well with, or even outperform, ternary covering functions without ternary conversion of the message.