• Journal of Korea Multimedia Society
• /
• v.15 no.4
• /
• pp.526-539
• /
• 2012

This paper proposes a high capacity data hiding method using high frequence secret data indexing algorithm. Many novel data hiding methods based on LSB and PVD methods were presented to enlarge hiding capacity and provide an imperceptible quality. In this paper, first, calculating data iteration frequency of the secret message and make up the high frequency data index matrix (HFDT) using high frequence data's location information. Next, HFDT uses to that data hiding process on the cover image and recovering process on the stego image. The experimental results demonstrate the efficiency of the proposed high frequency secret data indexing method. For the data hiding method, experiments are conducted for four cases: 2 pattern secret data (2PD), 4 pattern secret data (4PD), 8 pattern secret data (8PD) and higher pattern secret data (HPD). When comparing the proposed method with other data hiding methods, for the HPD case, the results show that the proposed method has a good PSNR and more capacity, and for the other case, the results show that the proposed method has a higher PSNR and larger capacity.

• Journal of Korea Multimedia Society
• /
• v.2 no.2
• /
• pp.155-165
• /
• 1999

Because the encrypted data is random, there is a possibility of threat that attacker reveals the secret data. On the other hand, as the image steganogrphy is to embed the secret data into cover image and to transmit the embedded image to receiver, an attacker could not know the existence of secret data even though he/she sees the embedded image, therefore the sender may reduce the threat of attack. In the image steganography, the secret data is embedded by modifying value of pixels as a form of noise. If the secret data is embedded into gray image, the degradation of image quality results from the modifications of image due to noise. Therefore many methods have been proposed to embed the secret data while dethering the gray image, but the existing method using error-diffusion has a problem that any patterns such as a diagonal lines or vertical take place due to embedding the secret data at the fixed interval. To solve this problem and to improve the existing method, we proposed the new method that embeds the secret data at changed point with respect to 1's run-length or at the position where has the minimum difference with the original dithered value. We evaluated the performance of the proposed method by computer simulation.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.5
• /
• pp.472-476
• /
• 2008

In this paper, we propose a simple and user friendly visual secret sharing scheme based on binary image. The proposed scheme is a new information hiding method which uses only bit-wise exclusive-or (XOR) operation and NOT operation to share a secret binary image information in the user friendly binary images. The proposed scheme has the following merits: (1) It provides efficient embedding and reconstruction algorithms. (2) It provides lossless and perfect reconstruction of the secret binary image. (3) It provides the detection method of its own group by sharing the user friendly image. (4) It can share same sized secret image such as original cover image unlike previous methods.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.2
• /
• pp.113-119
• /
• 2006

Image steganography is a secret communication method used to transmit secret messages that have been embedded into an image. To accommodate a secret message in a digital image, the original cover image is modified by the embedding algorithm. As a result, a stego image is obtained. The sender hides the secret message in a cover image that has no meaning, and then transmits the stego image to the receiver. In this paper, we propose a steganographic method based on spatial domain to embed a secret message using a difference value of two consecutive pixels and a secret quantization range. Especially, we use the modular operation for increasing of insertion information. Through experiments, we have shown that the proposed method has much mon payload capacity, average 60 percent, than some existing methods by using modular operation.

• The Korean Journal of Archival Studies
• /
• no.23
• /
• pp.257-297
• /
• 2010

The U. S. government has a long history to classify and manage governmental records which are created, collected, and preserved for itself. During the colonial period before the independence, the U. S. mostly practiced the maintenances of secret records and restrictions of access to the records following a long convention without any specific legal authority. Since establishment of the U. S. Constitution, the government had kept secret records on the basis of constitutional authority. However, the U. S. government began to take shape the secret records management system when it participated in the World War I, which required the system to reflect the needs in reality to manage drastic increases in important military and foreign relation documents. The World War II made the U. S. government strengthen its secret records management system, and its conception of secret records management system at that time has sustained until now. It can be said that the current secret records management system of the U. S. government continues to be managed by constitutional authorities and the executive orders which are opt to change. This article intends to review the secret records management system of the U. S. from the initial history of the U. S. to the Cold War. To understand its system of secret management, the paper investigates the U. S. secret records management history by dividing into three periods: the period of establishment of its tradition(the Colonial era~just before the WWI); the period of taking shape of its system (the WWI~the WWII); and the period of current conception of its system. The criteria of these divisions are created based on the differences of the laws relevant to the secret records and the application methods of secret management system in reality.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.1
• /
• pp.382-403
• /
• 2020

Steganography is the art of concealing the existence of a secret data in a non-secret digital carrier called cover media. While the image of steganography methods is extensively researched, studies on other cover files remain limited. Videos are promising research items for steganography primitives. This study presents an improved approach to video steganography. The improvement is achieved by allowing senders and receivers exchanging secret data without embedding the hidden data in the cover file as in traditional steganography methods. The method is based mainly on searching for exact matches between the secret text and the video frames RGB channel pixel values. Accordingly, a random key-dependent data is generated, and Elliptic Curve Public Key Cryptography is used. The proposed method has an unlimited embedding capacity. The results show that the improved method is secure against traditional steganography attacks since the cover file has no embedded data. Compared to other existing Steganography video systems, the proposed system shows that the method proposed is unlimited in its embedding capacity, system invisibility, and robustness. The system achieves high precision for data recovery in the receiver. The performance of the proposed method is found to be acceptable across different sizes of video files.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.1
• /
• pp.404-421
• /
• 2020

A reversible data hiding scheme in JPEG compressed bitstreams is proposed, which could avoid decoding failure and file expansion by means of removing of bitstreams corresponding to high frequency coefficients and embedding of secret data in file header as comment part. We decode original JPEG images to quantified 8×8 DCT blocks, and search for a high frequency as an optimal termination point, beyond which the coefficients are set to zero. These blocks are separated into two parts so that termination point in the latter part is slightly smaller to make the whole blocks available in substitution. Then spare space is reserved to insert secret data after comment marker so that data extraction is independent of recovery in receiver. Marked images can be displayed normally such that it is difficult to distinguish deviation by human eyes. Termination point is adaptive for variation in secret size. A secret size below 500 bits produces a negligible distortion and a PSNR of approximately 50 dB, while PSNR is also mostly larger than 30 dB for a secret size up to 25000 bits. The experimental results show that the proposed technique exhibits significant advantages in computational complexity and preservation of file size for small hiding capacity, compared to previous methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.471-485
• /
• 2023

As data sharing increases explosively, such information encoded in QR code is completely public as private messages are not securely protected. This paper proposes a new 'PROMISE' framework for hiding information based on the QR code projection matrix by using image segmentation without modifying the essential QR code characteristics. Projection matrix mapping, matrix scrambling, fusion image segmentation and steganography with SEL(secret embedding logic) are part of the PROMISE framework. The QR code could be mapped to determine the segmentation site of the fusion image as a binary information matrix. To further protect the site information, matrix scrambling could be adopted after the mapping phase. Image segmentation is then performed on the fusion image and the SEL module is applied to embed the secret message into the fusion image. Matrix transformation and SEL parameters should be uploaded to the server as the secret key for authorized users to decode the private message. And it was possible to further obtain the private message hidden by the framework we proposed. Experimental findings show that when compared to some traditional information hiding methods, better anti-detection performance, greater secret key space and lower complexity could be obtained in our work.

• Journal of Korea Multimedia Society
• /
• v.8 no.3
• /
• pp.379-388
• /
• 2005

Image steganography Is a secret communication scheme to transmit a secret message, which is embedded into an image. The original image and the embedded image are called the cover image and the stego image, respectively. In other words, a sender embeds a secret message into a cover image and transmits a stego image to a receiver, while the receiver takes the stego image, extracts the message from it, and reads the message. General requirements for steganography are great capacity of secret messages, imperceptibility of stego images, and confidentiality between a sender and a receiver. In this paper, we propose a method for being satisfied with three requirements. In order to hide a secret message into a cover image safely, we use a difference value of two consecutive pixels and a secret quantization range. The former is used for the imperceptibility and the latter for the confidentiality. Furthermore, the number of insertion bits is changed according to the difference value for the imperceptibility. Through experiments, we have shown that our method is more good quality of stego images than many other related methods and increases the amount o( message insertion by performing dual insertion processing for some pixels.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.3
• /
• pp.1051-1077
• /
• 2021

The secure communication of information is a major concern over the internet. The information must be protected before transmitting over a communication channel to avoid security violations. In this paper, a new hybrid method called compressed encrypted data embedding (CEDE) is proposed. In CEDE, the secret information is first compressed with Lempel Ziv Welch (LZW) compression algorithm. Then, the compressed secret information is encrypted using the Advanced Encryption Standard (AES) symmetric block cipher. In the last step, the encrypted information is embedded into an image of size 512 × 512 pixels by using image steganography. In the steganographic technique, the compressed and encrypted secret data bits are divided into pairs of two bits and pixels of the cover image are also arranged in four pairs. The four pairs of secret data are compared with the respective four pairs of each cover pixel which leads to sixteen possibilities of matching in between secret data pairs and pairs of cover pixels. The least significant bits (LSBs) of current and imminent pixels are modified according to the matching case number. The proposed technique provides double-folded security and the results show that stego image carries a high capacity of secret data with adequate peak signal to noise ratio (PSNR) and lower mean square error (MSE) when compared with existing methods in the literature.