• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.3
• /
• pp.143-154
• /
• 2008

Information hiding is a very important technology recently. Having this technology can be a competitive power for secure communication. In this paper, it will be showed that hiding data in MS Office 2007 file is possible. Considering Microsoft (MS) Office 2007 file format is based on Open XML format, the feature of Open XML format makes it possible to hide data in MS Office 2007 file. In Open XML format, unknown XML files and their relationships can be defined by user. These parts and relationships are used to hide data in MS Office 2007 file. Considering unknown parts and unknown relationships are not in normal MS Office 2007 file, the hidden data can be detected by confirming of unknown parts and unknown relationships.

• Knowledge Management Research
• /
• v.22 no.1
• /
• pp.217-242
• /
• 2021

The purpose of this study is to examine the research trends in the filed of individual knowledge hiding through keyword network analysis. As individuals intentionally hide their knowledge beyond not sharing their knowledge in organizations and the research on knowledge hiding steadily spreads, it is necessary to examine the research trends regarding knowledge hiding behaviors. For keyword network analyses, we collected 346 kinds of 578 keywords from 120 articles associated with knowledge hiding behaviors. We also transformed the keywords to 86 nodes and 667 links by data standardizing criteria and finally analyzed the keyword network among them. Moreover, this study scrutinized knowledge hiding trends by comparing the conceptual model for knowledge hiding based on literature review and the network structure based on keyword network analysis. As results, first, the network centrality degree, knowledge sharing, creativity, and performance was higher than others in Degree, Betweenness, Closeness centrality. Second, this study analyzed ego networks about psychological ownership and individual emotion theoretically associated with knowledge hiding and explored the relationship between variables through comparing with the conceptual model for knowledge hiding. Finally, the study suggested theoretical and practical implications and provided the limitations and suggestions for future research based on study findings.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.11 no.4
• /
• pp.69-79
• /
• 2015

This research proposes a modified data hiding method to hide data in a slack space of an NTFS index record. The existing data hiding method is for anti-forensics, which uses traces of file names of an index entry in an index record when files are deleted in a direcotry. The proposed method in this paper modifies the existing method to make non-admittable ASCII characters for a file name applicable. By improving the existing method, problems of a file creation error due to non-admittable characters are remedied; including the non-admittable 9 characters (i. e. slash /, colon :, greater than >, less than <, question mark ?, back slash ${\backslash}$, vertical bar |, semi-colon ;, esterisk * ), reserved file names(i. e. CON, PRN, AUX, NUL, COM1~COM9, LPT1~LPT9) and two non-admittable characters for an ending character of the file name(i. e. space and dot). Two results of the two message with non-admittable ASCII characters by keyboard inputs show the applicability of the proposed method.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.6
• /
• pp.27-34
• /
• 2009

Block truncation coding (BTC) is a simple and efficient image compression technique. However, it yields images of unacceptable quality and significant blocking effects are seen when the block size is increasing. Ordered dither block truncation coding (ODBTC) was proposed to solve above problem maintaining the same compression capability. In this paper, we propose a data hiding method which can be applied to halftone images. EMD was developed by Zhang and Wang [6] for data hiding in the grayscale image. Therefore, EMD is not proper for bitmap images. In this paper, we show that EMD can be used to apply bitmap halftone image. In our experiments, we prove that our method is efficient in a halftone image.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.51-57
• /
• 2010

In this paper, It propose methods compressing BTC image utilizing data hiding technique. BTC is used to compress general digital image into binary image and applied into application such as printer. Additional information, transferred with binary image, is as big as the size of binary image. Therefore, we wish to reduce the total transmission bandwidth by decreasing the additional information with sustaining the small image degradation. Because typical BTC image doesn't have enough space for data hiding, we adopt Adaptive AMBTC (Absolute Moment BTC) algorithm to produce the binary image, and calculate virtual histogram from created binary image and modify this histogram for reducing the additional information. The proposed algorithm can reduce about 6-11 % of the image file size, compared with the existing BTC algorithm, without making perceptible image degradation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6159-6174
• /
• 2019

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.

• International Journal of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.85-88
• /
• 2019

In this paper, we propose a technique for spatially encrypting confidential data into R, G, B planes of color image and extracting spatially encrypted confidential data. The effectiveness of the proposed technique is verified by mathematically analyzing the quality of the stego-image generated using the proposed technique. The proposed technique can hide confidential data securely into cover image by spatially encrypting the confidential data, and can extract confidential data from the stego-image. The quality of the stego-image created by applying the proposed technique is very good. The average value of the quality of the stego-image is 51.14 dB. Therefore, it is not visually recognizable whether the confidential data is hidden in the stego-image. The proposed technique can be widely used for military and intellectual property protection.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.1105-1118
• /
• 2014

In this paper, a new reversible data hiding method based on a dual binary tree of embedding levels is proposed. Four neighborhood pixels in the upper, below, left and right of each pixel are used as reference pixels to estimate local complexity for deciding embeddable and non-embeddable pixels. The proposed method does not need to record pixels that might cause underflow, overflow or unsuitable for embedment. This can reduce the size of location map and release more space for payload. Experimental results show that the proposed method is more effective in increasing payload and improving image quality than some recently proposed methods.

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.168-173
• /
• 2010

Error concealment techniques are significant due to the growing interest in imagery transmission over error-prone channels. This paper presents a spatial error concealment technique for losslessly compressed images using least significant bit (LSB)-based data hiding to reconstruct a close approximation after the loss of image blocks during image transmission. Before transmission, block description information (BDI) is generated by applying quantization following discrete wavelet transform. This is then embedded into the LSB plane of the original image itself at the encoder. At the decoder, this BDI is used to conceal blocks that may have been dropped during the transmission. Although the original image is modified slightly by the message embedding process, no perceptible artifacts are introduced and the visual quality is sufficient for analysis and diagnosis. In comparisons with previous methods at various loss rates, the proposed technique is shown to be promising due to its good performance in the case of a loss of isolated and continuous blocks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.331-337
• /
• 2017

In this work, we propose an improved form of Zhang's reversible data hiding technique in encrypted image. In the original work, average value of neighboring pixels is used for fluctuation calculation which fails to give good performance. In proposed scheme, to reduce the bit error rate a new function is calculated by summing difference from four neighboring pixels for measuring fluctuation. Moreover, modified calculation of fluctuation function is also proposed where border pixels are considered. The simulation results show that the performance of proposed method outperforms Zhang's and Hong's work. From the results, more information can be sent by using proposed system