• 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.

• ETRI Journal
• /
• 제40권5호
• /
• pp.677-686
• /
• 2018

A novel data hiding technique based on modified histogram shifting that incorporates multi-bit secret data hiding is proposed. The proposed technique divides the image pixel values into embeddable and nonembeddable pixel values. Embeddable pixel values are those that are within a specified limit interval surrounding the peak value of an image. The limit interval is calculated from the number of secret bits to be embedded into each embeddable pixel value. The embedded secret bits can be perfectly extracted from the stego image at the receiver side without any overhead bits. From the simulation, it is found that the proposed technique produces a better quality stego image compared to other data hiding techniques, for the same embedding rate. Since the proposed technique only embeds the secret bits in a limited number of pixel values, the change in the visual quality of the stego image is negligible when compared to other data hiding techniques.

• ETRI Journal
• /
• 제33권4호
• /
• pp.580-588
• /
• 2011

This paper proposes reversible data hiding using minimum/maximum preserved overflow/underflow avoidance (MMPOUA). The proposed MMPOUA algorithm consists of three main steps. These steps include the minimum (or maximum) pixel fixing, pixel squeezing, and pixel isolation. The aims of pixel fixing are to keep the minimum (or maximum) pixel of a host block unchanged and prevent the occurrence of overflow/underflow. Both the pixel squeezing and pixel isolation supply hiding storage while keeping the amount of distortion low. The proposed method can avoid (or significantly reduce) the overhead bits used to overcome overflow/underflow issues. At an embedding rate of 0.15 bpp, the proposed algorithm can achieve a PSNR value of 48.52 dB, which outperforms several existing reversible data hiding schemes. Furthermore, the algorithm performed well in a variety of images, including those in which other algorithms had difficulty obtaining good hiding storage with high perceived quality.

• 한국멀티미디어학회논문지
• /
• 제25권9호
• /
• pp.1291-1306
• /
• 2022

The dual image-based reversible data hiding scheme embeds secret data into two images to increase the embedding capacity of secret data. The dual image-based reversible data hiding scheme can transmit a lot of secret data. Therefore, various schemes have been proposed until recently. In 2021, Chen and Hong proposed a dual image-based reversible data hiding scheme that embeds a large amount of secret data using a reference matrix, secret data, and bit values. However, in this paper, more secret data can be embedded than Chen and Hong's scheme. To achieve this goal, the proposed scheme generates polynomials and shared values using secret sharing scheme, and embeds secret data using reference matrix and septenary number, and random value. Experimental results show that the proposed scheme can transmit more secret data to the receiver while maintaining the image quality similar to other dual image-based reversible data hiding schemes.

• 아태비즈니스연구
• /
• 제13권1호
• /
• pp.19-36
• /
• 2022

Purpose - Previous studies tried to find antecedents of innovative behavior. However, research on knowledge hiding behavior, psychological mechanism, and perception of organizational justice has been relatively limited. In this sense, this study has investigated the impact of organizational justice on employees' innovative behavior and explored the factors that affect the above relationship. Especially, this study tested the direct effect of organizational justice on innovative behavior. This study also examines the mediating roles of knowledge hiding behavior in this causal relationship. Moreover, the process of organizational justice to innovative behavior is assumed to be influenced by leadership style. Therefore, we examined the moderating effect of authentic leadership on the relationship between organizational justice and knowledge hiding behavior. Design/methodology/approach - For the empirical test, we collected data via a questionnaire survey of a sample of 252 employees from Korean firms. We conducted a hierarchical regression analysis to test hypotheses. Results - The results of the empirical analysis revealed that organizational justice was positively related to innovative behavior and negatively related to knowledge hiding behavior. The results also showed that knowledge hiding behavior negatively mediated the relationship between organizational justice and innovative behavior. In addition, we found the moderating role of authentic leadership. More importantly, we found that the conditional indirect effect of organizational justice on innovative behavior via knowledge hiding behavior was depending on authentic leadership. Uncovering the relationship between organizational justice and innovative behavior through the mediating role of knowledge hiding behavior and the moderated mediating role of authentic leadership has useful theoretical and practical implications. We also suggest directions for future research by providing several limitations.

• 한국컴퓨터정보학회논문지
• /
• 제23권8호
• /
• pp.85-93
• /
• 2018

In this research, it is proposed that a method to hide data by modifying directory index entry information. It consists of two methods: a directory list hiding and a file contents hiding. The directory list hiding method is to avoid the list of files from appearing in the file explorer window or the command prompt window. By modifying the file names of several index entries to make them duplicated, if the duplicated files are deleted, then the only the original file is deleted, but the modified files are retained in the MFT entry intact. So, the fact that these files are hidden is not exposed. The file contents hiding is to allocate data to be hidden on an empty index record page that is not used. If many files are made in the directory, several 4KB index records are allocated. NTFS leaves the empty index records unchanged after deleting the files. By modifying the run-list of the index record with the cluster number of the file-to-hide, the contents of the file-to-hide are hidden in the index record. By applying the proposed method to the case of hiding two files, the file lists are not exposed in the file explorer and the command prompt window, and the contents of the file-to-hide are hidden in the empty index record. It is proved that the proposed method has effectiveness and validity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권1호
• /
• pp.431-443
• /
• 2016

Secure multi-party computation (MPC) has been a research focus of cryptography in resent studies. However, hiding the topology of the network in secure computation is a rather novel goal. Inspired by a seminal paper [1], we proposed a topology-hiding broadcast protocol based on NTRUEncrypt and secret sharing. The topology is concealed as long as any part of the network is corrupted. And we also illustrated the merits of our protocol by performance and security analysis.

• 한국멀티미디어학회논문지
• /
• 제24권6호
• /
• pp.768-788
• /
• 2021

The reversible data hiding technique safely transmits secret data to the recipient from malicious attacks by third parties. In addition, this technique can completely restore the image used as a transmission medium for secret data. The reversible data hiding schemes have been proposed in various forms, and recently, the reversible data hiding schemes based on interpolation are actively researching. The reversible data hiding scheme based on the interpolation method expands the original image into the cover image and embed secret data. However, the existing interpolation-based reversible data hiding schemes did not embed secret data during the interpolation process. To improve this problem, this paper proposes embedding the first secret data during the image interpolation process and embedding the second secret data into the interpolated cover image. In the embedding process, the original image is divided into blocks without duplicates, and the maximum and minimum values are determined within each block. Three way searching based on the maximum value and two way searching based on the minimum value are performed. And, image interpolation is performed while embedding the first secret data using the PVD scheme. A stego image is created by embedding the second secret data using the maximum difference value and log function in the interpolated cover image. As a result, the proposed scheme embeds secret data twice. In particular, it is possible to embed secret data even during the interpolation process of an image that did not previously embed secret data. Experimental results show that the proposed scheme can transmit more secret data to the receiver while maintaining the image quality similar to other interpolation-based reversible data hiding schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권8호
• /
• pp.1964-1981
• /
• 2012

In this paper a reversible data hiding scheme based on histogram shifting of host image blocks is presented. This method attempts to use full available capacity for data embedding by dividing the image into non-overlapping blocks. Applying histogram shifting to each block requires that extra information to be saved as overhead data for each block. This extra information (overhead or bookkeeping information) is used in order to extract payload and recover the block to its original state. A method to eliminate the need for this extra information is also introduced. This method uses maximum gap that exists between histogram bins for finding the value of pixels that was used for embedding in sender side. Experimental results show that the proposed method provides higher embedding capacity than the original reversible data hiding based on histogram shifting method and its improved versions in the current literature while it maintains the quality of marked image at an acceptable level.

• 한국멀티미디어학회논문지
• /
• 제17권4호
• /
• pp.466-477
• /
• 2014

Many image hiding schemes based on least significant bit (LSB) transformation have been proposed. One of the LSB-based image hiding schemes that employs diamond encoding was proposed in 2008. In this scheme, the binary secret data is converted into base n representation, and the converted secret data is concealed in the cover image. Here, we show that this scheme has two vulnerabilities: noticeable spots in the stego-image, i.e., a non-smooth embedding result, and inefficiency caused by rough re-adjustment of falling-off-boundary value and impractical base translation. Moreover, we propose a new scheme that is efficient and produces a smooth and high quality embedding result by restricting n to power of 2 and using a sophisticated re-adjustment procedure. Our experimental results show that our scheme yields high quality stego-images and is secure against RS detection attack.