• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권7호
• /
• pp.2572-2589
• /
• 2014

Reversible data hiding is a technique for recovering original images without any distortion after secret data are extracted from the image. The technique continues to attract attention from many researchers. In this paper, we introduce a new reversible data hiding scheme based on the adjacent index differences of vector quantization (VQ) indices. The proposed scheme exploits the differences between two adjacent indices to embed secret data. Experimental results show that our scheme can achieve a lower compression rate than an earlier scheme by Yang and Lin. Our scheme's average compression rate, 0.44 bpp, outperforms that of Yang and Lin's scheme, which averages 0.53 bpp. Moreover, the embedding capacity of our scheme can rise to 1.45 bpi, which also is superior to that of Chang et al.'s scheme [35] (1.00 bpi)Yang and Lin's scheme [27] (0.91 bpi) as well as Chang et al.'s scheme [26] (0.74 bpi).

• 한국멀티미디어학회논문지
• /
• 제17권8호
• /
• pp.953-960
• /
• 2014

In Shamir's (t,n)-threshold based secret image sharing schemes, there exists a problem that the secret image can be reconstructed when an arbitrary attacker becomes aware of t secret image pieces, or t participants are malicious collusion. It is because that utilizes linear combination polynomial arithmetic operation. In order to overcome the problem, we propose a secret image sharing scheme using matrix decomposition and adversary structure. In the proposed scheme, there is no reconstruction of the secret image even when an arbitrary attacker become aware of t secret image pieces. Also, we utilize a simple matrix decomposition operation in order to improve the security of the secret image. In experiments, we show that performances of embedding capacity and image distortion ratio of the proposed scheme are superior to previous schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권6호
• /
• pp.2554-2575
• /
• 2020

Data hiding technology hides secret information into the carrier, so that when the carrier is transmitted over network, it will not attract any malicious attention. Using data compression, it is possible to reduce the data size into a small compressed code, which can effectively reduce the time when transmitting compressed code on the network. In this paper, the main objective is to effectively combine these two technologies. We designed a data hiding scheme based on two techniques which are turtle-shell information hiding scheme and absolute moment block truncation coding. The experimental results showed that the proposed scheme provided higher embedding capacity and better image quality than other hiding schemes which were based on absolute moment block truncation coding.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권3호
• /
• pp.600-612
• /
• 2013

In 2006, Zhang and Wang proposed a data hiding scheme based on Exploiting Modification Direction (EMD) to increase data hiding capacity. The major benefit of EMD is providing embedding capacity greater than 1 bit per pixel. Since then, many EMD-type data hiding schemes have been proposed. However, a serious disadvantage common to these approaches is that the embedded data is compromised when the embedding function is disclosed. Our proposed secure data hiding scheme remedies this disclosure shortcoming by employing an additional modulus function. The provided security analysis of our scheme demonstrates that attackers cannot get the secret information from the stegoimage even if the embedding function is made public. Furthermore, our proposed scheme also gives a simple solution to the overflow/underflow problem and maintains high embedding capacity and good stegoimage quality.

• 한국멀티미디어학회논문지
• /
• 제20권4호
• /
• pp.629-639
• /
• 2017

Interpolation based information hiding methods are widely used to get information security. Conventional interpolation methods use the neighboring pixel value and simple calculation like average to embed secret bit stream into the image. But these information hiding methods are not appropriate to color images like military images because the characteristics of military images are not considered and these methods are restricted in grayscale images. In this paper, the new information hiding method based on interpolation using RGB pixel values of color image is proposed and the effectiveness is analyzed through experiments.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권8호
• /
• pp.2984-3004
• /
• 2015

Designing a new reversible data hiding technique with a high embedding rate and a low compression rate for vector quantization (VQ) compressed images is encouraged. This paper proposes a novel lossless data hiding scheme for VQ-compressed images based on the joint neighboring coding technique. The proposed method uses the difference values between a current VQ index and its left and upper neighboring VQ indexes to embed n secret bits into one VQ index, where n = 1, 2, 3, or 4. The experimental results show that the proposed scheme achieves the embedding rates of 1, 2, 3, and 4 bits per index (bpi) with the corresponding average compression rates of 0.420, 0.483, 0.545, and 0.608 bit per pixel (bpp) for a 256 sized codebook. These results confirm that our scheme performs better than other selected reversible data hiding schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권1호
• /
• pp.269-281
• /
• 2014

Compared to hiding information into digital image, hiding information into digital text file requires less storage space and smaller bandwidth for data transmission, and it has obvious universality and extensiveness. However, text files have low redundancy, so it is more difficult to hide information in text files. To overcome this difficulty, Wang et al. proposed a reversible information hiding scheme using left-right and up-down representations of Chinese characters, but, when the scheme is implemented, it does not provide good visual steganographic effectiveness, and the embedding and extracting processes are too complicated to be done with reasonable effort and cost. We observed that a lot of traditional and simplified Chinese characters look somewhat the same (also called lookalike), so we utilize this feature to propose a novel information hiding scheme for hiding secret data in lookalike Chinese characters. Comparing to Wang et al.'s scheme, the proposed scheme simplifies the embedding and extracting procedures significantly and improves the effectiveness of visual steganographic images. The experimental results demonstrated the advantages of our proposed scheme.

• 한국정보전자통신기술학회논문지
• /
• 제11권3호
• /
• pp.277-282
• /
• 2018

인터넷 상에서 비밀 메시지의 통신 목표는 비인지성과 기밀성을 유지하는 것이다. 디지털 스테가노그래피는 메시지 존재 자체를 제3자가 감지하지 못하게 커버 매체에 비밀 메시지를 삽입하여 목적지에 전송하는 기법이다. 스테가노그래피는 암호화 기법과 혼합되어 기밀성과 무결성을 함께 보장하기 위한 효율적인 방법이다. 비밀(한글) 메시지를 삽입하기 위해 비밀 문자를 분리하고 암호표를 참고로 하여 이진화 코드로 변환하며, 커버 이미지를 두 영역으로 분할하며, 비밀 메시지와 두 번째 영역의 오른쪽 l-LSB 정보를 암호화와 교차 과정을 진행한 후 첫 번째 영역의 k-LSB에 은닉하여 스테고 이미지를 구성하는 방법을 제안한다. 제안된 방법의 실험결과는 PSNR 값이 52.62로 허용 이미지 품질 수준임을 보여준다.

• 한국정보전자통신기술학회논문지
• /
• 제14권2호
• /
• pp.109-114
• /
• 2021

네트워크 환경에서 다양한 사용자가 증가하면서 송수신되는 민감한 비밀 정보를 공격자로부터 보호하는 것은 어렵다. 이미지에 비트화된 비밀 자료를 LSB 기법으로 은닉하는 것은 공격에 매우 취약할 수 있다. 이를 해결하기 위해 암호화와 정보은닉이 결합하는 하이브리드 방법이 활용된다. 이용자가 비밀 메시지를 안전하게 보호하고, 비밀 통신을 구현하기 위한 효과적인 방법이 요구되고 있다. 즉, 이미지 품질을 보장하기 위해 보안성과 인식 불가능성을 향상시키기 위한 새로운 접근법이 필요하다. 이 논문에서 MSB와 LSB를 기반하여 커버 이미지에 한글 메시지를 은닉하는 LSB 스테가노 그래피 기법을 제안한다. 이때 한글을 초성, 중성, 종성으로 분리한 후, 비밀 자료는 선택된 MSB에 따라 Exclusive-OR 혹은 Exclusive-NOR 연산을 적용한다. 또한 계산된 비밀 자료는 피보나치 기법에 의해 변환된 커버 이미지의 LSB n개 비트에 은닉한다. 적용된 결과의 효율성을 확인하기 위해 PSNR을 이용하였다. 허용되는 결과로서 적합한 41.517(dB)가 확인되었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권11호
• /
• pp.4443-4462
• /
• 2020

This paper proposes a new framework of reversible data hiding scheme for absolute moment truncation coding (AMBTC) compressed images. AMBTC-based RDH can be applied to optical remote sensing (ORS) image transmission, which achieves target region preservation and image compression simultaneously. Existing methods can be concluded as two types. In type I schemes, stego codes mimic the original AMBTC format where no file bloat occurs, yet the carried secret data is limited. Type II schemes utilize predication errors to recode quantity levels of AMBTC codes which achieves significant increase in embedding capacity. However, such recoding causes bloat inside stego format, which is not appropriate in mentioned ORS transmission. The proposed method is a novel type I RDH method which prevents bloat inside AMBTC stego codes with significant improvement in embedding capacity. The AMBTC compressed trios are grouped into two categories according to a given threshold. In smooth trio, the modified low quantity level is constructed by concatenating Huffman codes and secret bits. The reversible contrast mapping (RCM) is performed to complex trios for data embedment. Experiments show that the proposed scheme provides highest payload compared with existing type I methods. Meanwhile, no expansion inside stego codes is caused.