Data Hiding in Halftone Images by XOR Block-Wise Operation with Difference Minimization

( Ching-nung Yang ),( Guo-cin Ye ),( Cheonshik Kim ) 한국인터넷정보학회 2011 KSII Transactions on Internet and Information Syst Vol.5 No.2

This paper presents an improved XOR-based Data Hiding Scheme (XDHS) to hide a halftone image in more than two halftone stego images. The hamming weight and hamming distance is a very important parameter affecting the quality of a halftone image. For this reason, we proposed a method that involves minimizing the hamming weights and hamming distances between the stego image and cover image in 2×2-pixel grids. Moreover, our XDHS adopts a block-wise operation to improve the quality of a halftone image and stego images. Furthermore, our scheme improves security by using a block-wise operation with A-patterns and B-patterns. Our XDHS method achieves a high quality with good security compared to the prior arts. An experiment verified the superiority of our XDHS compared with previous methods.

Authorized Tracking and Tracing for RFID

Ming-Yang Chen,Ching-Nung Yang,Chi-Sung Laih 보안공학연구지원센터 2007 International Journal of Security and Its Applicat Vol.1 No.1

Radio Frequency Identification (RFID) systems have become popular for identifying not only objects but also persons. For example, in supply chain applications, the company can constantly track the movements of goods. Also, for Body Area Network or Personal Area Work, the tag is usually used for identifying a person. However, the movements and current locations of goods and a person’s activity profiles are the sensitive information and should be kept secret. This paper develops the interaction protocols between readers and tags to address this privacy issue of protecting tagged objects from tracking and tracing by unauthorized readers.

Reducing Computations in Chang et al.’s on-line Electronic Check

Zhili Zhou,Ching-Nung Yang,Chih-Fei Chen 보안공학연구지원센터 2016 International Journal of Security and Its Applicat Vol.10 No.10

With the recent popularity of shopping online, on-line electronic check (OLEC) as low-risk and low-cost way to perform payment has become an important component in e-commerce. Recently, Chang et al. propose an OLEC by using hash chain to represent the maximum face value and the face amount on an e-check. However, these values of Chang et al.’s OLEC cannot be arbitrary, and it is infeasible to compute hash operations for too large values. In this paper, we adopt a decimal based hash chain to design an enhanced OLEC (EOLEC). Our EOLEC significantly reduces the hash operations in Chang et al.’s OLEC to provide a much faster transaction, and meanwhile retains its original characteristics. Also, our EOLEC with arbitrary maximum face value and face amount on a check is more like the traditional paper check.

Coverless Multi-keywords Information Hiding Method Based on Text

Zhili Zhou,Yan Mu,Ching-Nung Yang,Ningsheng Zhao 보안공학연구지원센터 2016 International Journal of Security and Its Applicat Vol.10 No.9

As a new information hiding method, coverless information hiding has become a hot issue in the field of information security. The existing coverless information hiding method can hide only one Chinese character in each natural text. However, the problem of the method is that the hiding capacity is too small. To address this problem, a new method named coverless multi-keywords information hiding method based on text is proposed in this paper. The main idea of the method is that both the keywords and their number will be hidden in the texts. Experimental results show that the proposed method can improve the capacity of the existing coverless information hiding method based on text.

Improving capacity of Hamming (<i>n</i>,<i>k</i>)+1 stego-code by using optimized Hamming + <i>k</i>

Kim, Cheonshik,Shin, Dongkyoo,Yang, Ching-Nung,Chou, Yung-Shun Elsevier 2018 Digital signal processing Vol.78 No.-

<P><B>Abstract</B></P> <P>The Hamming coding ( n , k ) + 1 data hiding (H1DH) scheme is based on matrix encoding and has the characteristic of a good embedding efficiency. This scheme improves the embedding efficiency of Hamming coding ( n , k ) data hiding (HDH). H1DH is used to hide a k + 1 bit in a ( n + 1 ) block by adding or subtracting one. However, the embedding rates of HDH, H1DH, and HCIH are only 0.43, 0.5, and 0.75 respectively. The important criterion of data hiding is the amount of embedding capacity with a high PSNR in a cover image. In this paper, we propose a Hamming coding ( n , k ) + k data hiding (HkDH) scheme to hide 2<I>k</I> bits in a block with overlapped LSB and 2LSB using matrix encoding by adding or subtracting by two. In order to hide 2<I>k</I> bits in a block, it is necessary to increase or decrease by one, two or three. Assuming that we need two modifications to hide 2<I>k</I> bits in a block and the location of two modifications is the same, the collision problem occurs in the block. We suggest an optimal method for hiding 2<I>k</I> bits in a block and verify the proposed method. The main contribution of this paper is theoretically proving that our HkDH scheme has a better embedding capacity than HDH, H1DH, EMD, and HCIH while not seriously degrading the PSNR.</P> <P><B>Highlights</B></P> <P> <UL> <LI> Our HkDH scheme was proposed to hide 2<I>k</I> bits in a block ( <SUP> 2 k </SUP> − 1 ) with Hamming code and optimal rules. </LI> <LI> For HkDH, the optimal rules were proposed by exploiting 2LSB and LSB. </LI> <LI> The superiority of HkDH was demonstrated theoretically. </LI> </UL> </P>

Self-embedding fragile watermarking scheme to restoration of a tampered image using AMBTC

Kim, Cheonshik,Shin, Dongkyoo,Yang, Ching-Nung Springer-Verlag 2018 Personal and ubiquitous computing Vol.22 No.1

<P>The problem of digital forgeries has become more and more serious in various fields like entertainment, digital forensics, and journalism. This paper proposes a self-embedding watermarking scheme for the restoration of an image after tampering by digital forgery. In this study, an absolute moment block truncation coding image was used as a watermark, in which the image was a compressed version of the original cover image and contained the content features of the cover image. Therefore, it was perfectly possible to perform self-embedding. The watermark was embedded using the LSB and 2LSB for the pixels of the cover image. This procedure made it possible to recover the original watermarked image from a tampered watermarked image. Furthermore, there was no problem in reconstructing it when the rate of tampering was more than 80%. In addition, we verified our proposed self-embedding scheme through an experiment. As a result of the experiment, the recovered image showed good perceptual quality compared to that of the previous scheme.</P>

Data Hiding Using Sequential Hamming + k with m Overlapped Pixels

( Cheonshik Kim ),( Dongkyoo Shin ),( Ching-nung Yang ),( Yi-cheng Chen ),( Song-yu Wu ) 한국인터넷정보학회 2019 KSII Transactions on Internet and Information Syst Vol.13 No.12

Recently, Kim et al. introduced the Hamming + k with m overlapped pixels data hiding (Hk_ mDH) based on matrix encoding. The embedding rate (ER) of this method is 0.54, which is better than Hamming code HC (n, n- k) and HC (n, n- k) +1 DH (H1DH), but not enough. Hamming code data hiding (HDH) is using a covering function COV(1, n=2^k-1, k) and H1DH has a better embedding efficiency, when compared with HDH. The demerit of this method is that they do not exploit their space of pixels enough to increase ER. In this paper, we increase ER using sequential Hk_mDH (SHk_mDH ) through fully exploiting every pixel in a cover image. In SHk_mDH, a collision maybe happens when the position of two pixels within overlapped two blocks is the same. To solve the collision problem, in this paper, we have devised that the number of modification does not exceed 2 bits even if a collision occurs by using OPAP and LSB. Theoretical estimations of the average mean square error (AMSE) for these schemes demonstrate the advantage of our SHk_mDH scheme. Experimental results show that the proposed method is superior to previous schemes.

Separable reversible data hiding in encrypted halftone image

Kim, Cheonshik,Shin, Dongkyoo,Leng, Lu,Yang, Ching-Nung Elsevier 2018 Displays Vol.55 No.-

<P><B>Abstract</B></P> <P>In this paper, new high-capacity separable reversible data hiding in an encrypted halftoned image is proposed. The proposed scheme used Hamming code to exploit embedding efficiency with a halftoned image. Our proposed scheme is meeting a condition of separable reversible data hiding in the encrypted image (SRDHEI) and can achieve a high embedding efficiency of a halftoned image with low distortion. Experimental results also show that the scheme provides a large embedding payload and reconstructs about the same original halftoned image and embedded additional information.</P> <P><B>Highlights</B></P> <P> <UL> <LI> We proposed new separable reversible data hiding based on halftoned images. </LI> <LI> Our proposed scheme improves the embedding efficiency using Hamming code. </LI> <LI> Our proposed scheme is the first scheme to deal with the halftoned image. </LI> </UL> </P>

Data-Hiding for Halftone Images Using an Improved CPT scheme

( Phan Trung Huy ),( Nguyen Hai Thanh ),( Cheonshik Kim ),( Ching-nung Yang ) 한국인터넷정보학회 2013 KSII Transactions on Internet and Information Syst Vol.7 No.2

In publishing applications, it is advantageous to embed data in halftone images. The CPT scheme (Chen-Pan-Tseng, 2000) is a steganographic data hiding scheme that was proposed for binary images, e.g., facsimiles. The CPT scheme uses a secret key and weight matrix to protect the hidden data and can hide as many as r = [log2(m×n+1)] bits of data in the image by changing at most 2 bits in the image. Our proposed scheme also uses a secret key to protect it from being compromised and a weight matrix to increase the data hiding rate. Our scheme improves the performance of the CPT scheme by using the simple principle of splitting each block into two parts. Our proposed scheme is called improved CPT (ICPT) and has a very high embedding capacity compared to previous schemes. Experimental results demonstrate that our proposed scheme generally has higher performance than previous schemes.

Study of detection method for spoofed IP against DDoS attacks

Lee, Yong-Joon,Baik, Nam-Kyun,Kim, Cheonshik,Yang, Ching-Nung Springer-Verlag 2018 PERSONAL AND UBIQUITOUS COMPUTING Vol.22 No.1

<P>Cybercriminals are learning to harness the power of simpler devices like connected cameras. In September of 2016, Mirai software was used to infect more than 100,000 devices and unleash one of the largest distributed denial-of-service (DDoS) attacks up to that time. After this incident, many people identified multiple large attacks coming from Internet of Things (IoT) devices, like CCTV cameras, and described these attacks as a new trend. A technique to detect whether a signal source is counterfeited in the initial stage of a DDoS attack is important. This paper proposes a method for the quick detection of a spoofed Internet protocol (IP) during a DDoS attack based on a DDoS shelter that is established to defend against DDoS attacks. In order to achieve this goal, we evaluate the number of time-to-live hops in normal traffic as a reference for the bandwidth of each network that is accessible to the DDoS shelter. In this study, we conduct an experiment using cases of actual DDoS attacks. As a result of this experiment, we prove that our proposed method quickly detects a spoofed IP.</P>