• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5963-5980
• /
• 2017

Image scrambling is an important technology in information hiding, where the Arnold transformation is widely used. Several researchers have proposed the application of $H{\acute{e}}non$ map in square image scrambling, and certain improved technologies require scrambling many times to achieve a good effect without resisting chosen-plaintext attack although it can be directly applied to non-square images. This paper presents a non-square image scrambling algorithm, which can resist chosen-plaintext attack based on a chaotic two-dimensional Sine Logistic modulation map and $H{\acute{e}}non$ map (2D-SLHM). Theoretical analysis and experimental results show that the proposed algorithm has advantages in terms of key space, efficiency, scrambling degree, ability of anti-attack and robustness to noise interference.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2941-2956
• /
• 2013

In this paper, we propose an effective fragile image watermarking scheme for tampering detection and content recovery. Cover image is divided into a series of non-overlapping blocks and a block mapping relationship is constructed by the secret key. Several DCT coefficients with direct current and lower frequencies of the MSBs for each block are used to generate the reference bits, and different coefficients are assigned with different bit numbers for representation according to their importance. To enhance recovery performance, authentication bits are generated by the MSBs and the reference bits, respectively. After LSB substitution hiding, the embedded watermark bits in each block consist of the information of itself and its mapping blocks. On the receiver side, all blocks with tampered MSBs can be detected and recovered using the valid extracted reference bits. Experimental results demonstrate the effectiveness of the proposed scheme.

• The Journal of the Korea Contents Association
• /
• v.14 no.8
• /
• pp.30-39
• /
• 2014

The proposed watermark embedding algorithm uses histogram of difference image between a modified original image and predicted image. To increase the prediction performance of the predicted image, the reference pixels for prediction are adaptively selected and the other pixels are directionally interpolated with the reference pixels. The simulation result shows that the proposed algorithm gives good performances in the embedding capacity and the PSNR values.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.141-148
• /
• 2023

During the medical data transmissions, the protection of the patient information is vital. Hence this work proposes a spatial domain watermarking algorithm that enhances the data payload (capacity) while maintaining the authentication and data hiding. The code is distributed at every pixel of the digital image and not only in the regions of non-interest pixels. But the image details are still preserved. The performance of the proposed algorithm is evaluated using several performance measures such as the mean square error (MSE), the mean absolute error (MAE), and the peak signal to noise Ratio (PSNR), the universal image quality index (UIQI) and the structural similarity index (SSIM).

• Journal of Korea Multimedia Society
• /
• v.17 no.7
• /
• pp.849-857
• /
• 2014

In this paper, we propose a (2,2)-reversible secret image sharing scheme using histogram shifting and difference expansion. Two techniques are widely used in information hiding. Advantages of them are the low distortion between cover and stego images, and high embedding capacity. In secret image sharing procedure, unlike Shamir's secret sharing, a histogram generate that the difference value between the original image and copy image is computed by difference expansion. And then, the secret image is embedded into original and copy images by using histogram shifting. Lastly, two generated shadow images are distributed to each participant by the dealer. In the experimental results, we measure a capacity of a secret image and a distortion ratio between original image and shadow image. The results show that the embedding capacity and image distortion ratio of the proposed scheme are superior to the previous schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5C
• /
• pp.664-672
• /
• 2004

Widespread popularity of wireless data communication devices, coupled with the availability of higher bandwidths, has led to an increased user demand for content-rich media such as images and videos. Since such content often tends to be private, sensitive, or paid for, there exists a requirement for securing such communication. However, solutions that rely only on traditional compute-intensive security mechanisms are unsuitable for resource-constrained wireless and embedded devices. In this paper, we propose a selective partial image encryption scheme for image data hiding , which enables highly efficient secure communication of image data to and from resource constrained wireless devices. The encryption scheme is invoked during the image compression process, with the encryption being performed between the quantizer and the entropy coder stages. Three data selection schemes are proposed： subband selection, data bit selection and random selection. We show that these schemes make secure communication of images feasible for constrained embed-ded devices. In addition we demonstrate how these schemes can be dynamically configured to trade-off the amount of ded devices. In addition we demonstrate how these schemes can be dynamically configured to trade-off the amount of data hiding achieved with the computation requirements imposed on the wireless devices. Experiments conducted on over 500 test images reveal that, by using our techniques, the fraction of data to be encrypted with our scheme varies between 0.0244％ and 0.39％ of the original image size. The peak signal to noise ratios (PSNR) of the encrypted image were observed to vary between about 9.5㏈ to 7.5㏈. In addition, visual test indicate that our schemes are capable of providing a high degree of data hiding with much lower computational costs.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.57-65
• /
• 2010

In this paper, we present a universal steganalysis scheme. The proposed method extract features of two types. First feature set is extracted from histogram characteristic of the wavelet subbands. Second feature set is determined by statistical moments of wavelet characteristic functions. 3-level wavelet decomposition is performed for stego image and cover image using the Haar wavelet basis. We extract one features from 9 high frequency subbands of 12 subbands. The number of second features is 39. We use total 48 features for steganalysis. Multi layer perceptron(MLP) is applied as classifier to distinguish between cover images and stego images. To evaluate the proposed steganalysis method, we use the CorelDraw image database. We test the performance of our proposed steganalysis method over LSB method, spread spectrum data hiding method, blind spread spectrum data hiding method and F5 data hiding method. The proposed method outperforms the previous methods in sensitivity, specificity, error rate and area under ROC curve, etc.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.2
• /
• pp.113-119
• /
• 2006

Image steganography is a secret communication method used to transmit secret messages that have been embedded into an image. To accommodate a secret message in a digital image, the original cover image is modified by the embedding algorithm. As a result, a stego image is obtained. The sender hides the secret message in a cover image that has no meaning, and then transmits the stego image to the receiver. In this paper, we propose a steganographic method based on spatial domain to embed a secret message using a difference value of two consecutive pixels and a secret quantization range. Especially, we use the modular operation for increasing of insertion information. Through experiments, we have shown that the proposed method has much mon payload capacity, average 60 percent, than some existing methods by using modular operation.

• Convergence Security Journal
• /
• v.10 no.2
• /
• pp.19-26
• /
• 2010

In this study, we try to make up for the vulnerability in steganography that it is easily revealed the hidden logo image in cover image by bit-plane extraction. For this, we apply some methods, the permutation which shift the scattered pieces of logo image to one side, bit-plane dispersion insertion method and pack-type compressor.

• Journal of Korea Multimedia Society
• /
• v.9 no.4
• /
• pp.505-514
• /
• 2006

We proposes a multipurpose image watermarking algorithm which embeds visible watermark and invisible watermark into an original image. This is to satisfy the two characteristics of copyright notification of the visible watermark and copyright protection of the invisible watermark. The visible watermark's transparency is highlighted to be easily identified in contrast to the original image and the invisible watermark is embedded in a spatial domain.