• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.12
• /
• pp.4588-4603
• /
• 2014

In this paper, we present a high-quality image authentication scheme based on absolute moment block truncation coding. In the proposed scheme, we use the parity of the bitmap (BM) to generate the authentication code for each compressed image block. Data hiding is used to authenticate whether the content has been altered or not. For image authentication, we embed the authentication code to quantization levels of each image block compressed by absolute moment block truncation coding (AMBTC) which will be altered when the host image is manipulated. The embedding position is generated by a pseudo-random number generator for security concerned. Besides, to improve the detection ability we use a hierarchical structure to ensure the accuracy of tamper localization. A watermarked image can be precisely inspected whether it has been tampered intentionally or incautiously by checking the extracted watermark. Experimental results demonstrated that the proposed scheme achieved high-quality embedded images and good detection accuracy, with stable performance and high expansibility. Performance comparisons with other block-based data hiding schemes are provided to demonstrate the superiority of the proposed scheme.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.69-75
• /
• 2014

A novel reversible data hiding method using pixel value ordering and prediction error expansion in the sub-block is resented in this paper. For each non-overlapping $2{\times}2$ sub-block, we divide into two groups. In the min group, the lowest value is changed to embed a secret bit and the highest value is changed in the max group. The experimental results show that the proposed method achieves a good visual quality and high capacity. The proposed method can embed 13,900 bits on average, it is higher 4,553 bits than the previous method and the visual quality is maintained 31.39dB on average.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.12
• /
• pp.232-237
• /
• 2013

The role of the window length of time-frequency transformation is important for the audio data hiding methods utilizing phase information. In this paper, the experiments for our audio data hiding method were conducted in order to evaluate the audio quality and robustness against reverberant environment. The experimental results showed the tendency that the worse audio quality but better robustness were obtained when the lengthy window was applied. The important reason for quality degradation was pre-echo which flatters the percussive sound. The results also indicated that the wireless communication theory related to the length of time-frequency transform can be applied in the field of audio data hiding and acoustic data transmission.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.4
• /
• pp.327-337
• /
• 2015

This work provides new forensic techinque to a hide message on a directory index in Windows NTFS file system. Behavior characteristics of B-tree, which is apoted to manage an index entry, is utilized for hiding message in slack space of an index record. For hidden message not to be exposured, we use a disguised file in order not to be left in a file name attribute of a MFT entry. To understand of key idea of the proposed technique, we describe B-tree indexing method and the proposed of this work. We show the proposed technique is practical for anti-forensic usage with a real message hiding case using a developed software tool.

• 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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.570-595
• /
• 2017

Robust and perceptually-adaptive image watermarking algorithms have mainly targeted gray-scale images either at the modeling or embedding levels despite the widespread availability of color images. Only few of the existing algorithms are specifically designed for color images where color correlation and perception are constructively exploited. In this paper, a new perceptual and high-capacity color image watermarking solution is proposed based on the extension of Tsui et al. algorithm. The $CIEL^*a^*b^*$ space and the spatio-chromatic Fourier transform (SCFT) are combined along with a perceptual model to hide watermarks in color images where the embedding process reconciles between the conflicting requirements of digital watermarking. The perceptual model, based on an emerging color image model, exploits the non-uniform just-noticeable color difference (NUJNCD) thresholds of the $CIEL^*a^*b^*$ space. Also, spread-spectrum techniques and semi-random low-density parity check codes (SR-LDPC) are used to boost the watermark robustness and capacity. Unlike, existing color-based models, the data hiding capacity of our scheme relies on a game-theoretic model where upper bounds for watermark embedding are derived. Finally, the proposed watermarking solution outperforms existing color-based watermarking schemes in terms of robustness to standard image/color attacks, hiding capacity and imperceptibility.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.323-342
• /
• 2021

Personal health records (PHRs) is an electronic medical system that enables patients to acquire, manage and share their health data. Nevertheless, data confidentiality and user privacy in PHRs have not been handled completely. As a fine-grained access control over health data, ciphertext-policy attribute-based encryption (CP-ABE) has an ability to guarantee data confidentiality. However, existing CP-ABE solutions for PHRs are facing some new challenges in access control, such as policy privacy disclosure and dynamic policy update. In terms of addressing these problems, we propose a privacy protection and dynamic share system (PPADS) based on CP-ABE for PHRs, which supports full policy hiding and flexible access control. In the system, attribute information of access policy is fully hidden by attribute bloom filter. Moreover, data user produces a transforming key for the PHRs Cloud to change access policy dynamically. Furthermore, relied on security analysis, PPADS is selectively secure under standard model. Finally, the performance comparisons and simulation results demonstrate that PPADS is suitable for PHRs.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.2
• /
• pp.51-76
• /
• 2009

In this paper, a new hybrid opto-digital multiple information hiding and real-time extracting system was suggested and implemented using a volume holographic optical correlator. The multiple information hiding system in which the multiple information can be hided in an arbitrary cover image was digitally implemented by using the combination of pseudo random sequence and Hadamard matrix. In addition, a real-time optical extraction system in which the hided multiple information in a cover image can be extracted in real-time was implemented by using a volume holographic optical correlator. In the VanderLugt-type holographic optical correlator used in this experiment, the multiful matched spatial filters corresponding each of the hided informations were recorded in a photorefractive crystal by using the moving window-based angular multiplexing scheme.

• Journal of Digital Contents Society
• /
• v.17 no.6
• /
• pp.461-469
• /
• 2016

A novel steganography based on ternary BCH code with t = 2 is presented in this paper. Proposed method utilizes powerful BCH code with t = 2 for data hiding to the DCT coefficients from JPEG images. The presented data hiding technique uses a proposed look up table approach for searching multiple solutions for ternary BCH code with t = 2. The proposed look up table approach enables fast and efficient search for locations of DCT coefficients, which are necessary to modify for hiding data. Presented data hiding technique is the first steganography technique based on ternary BCH code. Experimental results clearly indicate advantages of using ternary BCH compared to binary BCH.

• KIISE Transactions on Computing Practices
• /
• v.23 no.3
• /
• pp.165-170
• /
• 2017

Many studies have utilized GPGPU (General-Purpose Graphic Processing Unit) and its high computing power to compute complex tasks. The characteristics of GPGPU programs necessitate the operations of memory copy between the host and device. A high latency period can affect the performance of the program. Thus, it is required to significantly improve the performance of GPGPU programs by optimizations. By executing multiple GPGPU programs simultaneously, the latency hiding effect of memory copy is achieved by overlapping the memory copy and computing operations in GPGPU. This paper presents the results of analyzing the latency hiding effect for memory copy operations. Furthermore, we propose a performance anticipation model and an algorithm for the limitations of using pinned memory, and show that the use of the proposed algorithm results in a 41% performance increase.