• Title/Summary/Keyword: data hiding capacity

Search Result 76, Processing Time 0.023 seconds

DNA Information Hiding Method for DNA Data Storage (DNA 데이터 저장을 위한 DNA 정보 은닉 기법)

  • Lee, Suk-Hwan;Kwon, Ki-Ryong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.51 no.10
    • /
    • pp.118-127
    • /
    • 2014
  • DNA data storage refers to any technique for storing massive digital data in base sequence of DNA and has been recognized as the future storage medium recently. This paper presents an information hiding method for DNA data storage that the massive data is hidden in non-coding strand based on DNA steganography. Our method maps the encrypted data to the data base sequence using the numerical mapping table and then hides it in the non-coding strand using the key that consists of the seed and sector length. Therefore, our method can preserve the protein, extract the hidden data without the knowledge of host DNA sequence, and detect the position of mutation error. Experimental results verify that our method has more high data capacity than conventional methods and also detects the positions of mutation errors by the parity bases.

An effective detection method for hiding data in compound-document files (복합문서 파일에 은닉된 데이터 탐지 기법에 대한 연구)

  • Kim, EunKwang;Jeon, SangJun;Han, JaeHyeok;Lee, MinWook;Lee, Sangjin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.6
    • /
    • pp.1485-1494
    • /
    • 2015
  • Traditionally, data hiding has been done mainly in such a way that insert the data into the large-capacity multimedia files. However, the document files of the previous versions of Microsoft Office 2003 have been used as cover files as their structure are so similar to a File System that it is easy to hide data in them. If you open a compound-document file which has a secret message hidden in it with MS Office application, it is hard for users who don't know whether a secret message is hidden in the compound-document file to detect the secret message. This paper presents an analysis of Compound-File Binary Format features exploited in order to hide data and algorithms to detect the data hidden with these exploits. Studying methods used to hide data in unused area, unallocated area, reserved area and inserted streams led us to develop an algorithm to aid in the detection and examination of hidden data.

Constructive Steganography by Tangles

  • Qian, Zhenxing;Pan, Lin;Huang, Nannan;Zhang, Xinpeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.8
    • /
    • pp.3911-3925
    • /
    • 2018
  • This paper proposes a novel steganography method to hide secret data during the generation of tangle patterns. Different from the traditional steganography based on modifying natural images, we propose to construct stego images according to the secret messages. We first create a model to group a selected image contour, and define some basic operations to generate various pattern cells. During data hiding, we create a cell library to establish the relationships between cells and secret data. By painting the cell inside the image contour, we create a dense tangle pattern to carry secret data. With the proposed method, a recipient can extract the secret data correctly. Experimental results show that the proposed method has a flexible embedding capacity. The constructed stego tangle image has good visual effects, and is secure against adversaries. Meanwhile, the stego tangle pattern is also robust to JPEG compression.

Sharing a Large Secret Image Using Meaningful Shadows Based on VQ and Inpainting

  • Wang, Zhi-Hui;Chen, Kuo-Nan;Chang, Chin-Chen;Qin, Chuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.12
    • /
    • pp.5170-5188
    • /
    • 2015
  • This paper proposes a novel progressive secret image-hiding scheme based on the inpainting technique, the vector quantization technique (VQ) and the exploiting modification direction (EMD) technique. The proposed scheme first divides the secret image into non-overlapping blocks and categorizes the blocks into two groups: complex and smooth. The blocks in the complex group are compressed by VQ with PCA sorted codebook to obtain the VQ index table. Instead of embedding the original secret image, the proposed method progressively embeds the VQ index table into the cover images by using the EMD technique. After the receiver recovers the complex parts of the secret image by decoding the VQ index table from the shadow images, the smooth parts can be reconstructed by using the inpainting technique based on the content of the complex parts. The experimental results demonstrate that the proposed scheme not only has the advantage of progressive data hiding, which involves more shadow images joining to recover the secret image so as to produce a higher quality steganography image, but also can achieve high hiding capacity with acceptable recovered image quality.

UN-Substituted Video Steganography

  • Maria, Khulood Abu;Alia, Mohammad A.;Alsarayreh, Maher A.;Maria, Eman Abu
    • 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.

XOR-based High Quality Information Hiding Technique Utilizing Self-Referencing Virtual Parity Bit (자기참조 가상 패리티 비트를 이용한 XOR기반의 고화질 정보은닉 기술)

  • Choi, YongSoo;Kim, HyoungJoong;Lee, DalHo
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.156-163
    • /
    • 2012
  • Recently, Information Hiding Technology are becoming increasingly demanding in the field of international security, military and medical image This paper proposes data hiding technique utilizing parity checker for gray level image. many researches have been adopted LSB substitution and XOR operation in the field of steganography for the low complexity, high embedding capacity and high image quality. But, LSB substitution methods are not secure through it's naive mechanism even though it achieves high embedding capacity. Proposed method replaces LSB of each pixel with XOR(between the parity check bit of other 7 MSBs and 1 Secret bit) within one pixel. As a result, stego-image(that is, steganogram) doesn't result in high image degradation. Eavesdropper couldn't easily detect the message embedding. This approach is applying the concept of symmetric-key encryption protocol onto steganography. Furthermore, 1bit of symmetric-key is generated by the self-reference of each pixel. Proposed method provide more 25% embedding rate against existing XOR operation-based methods and show the effect of the reversal rate of LSB about 2% improvement.

Original Identifier Code for Patient Information Security

  • Ahmed Nagm;Mohammed Safy
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.7
    • /
    • pp.141-148
    • /
    • 2023
  • During the medical data transmissions, the protection of the patient information is vital. Hence this work proposes a spatial domain watermarking algorithm that enhances the data payload (capacity) while maintaining the authentication and data hiding. The code is distributed at every pixel of the digital image and not only in the regions of non-interest pixels. But the image details are still preserved. The performance of the proposed algorithm is evaluated using several performance measures such as the mean square error (MSE), the mean absolute error (MAE), and the peak signal to noise Ratio (PSNR), the universal image quality index (UIQI) and the structural similarity index (SSIM).

High Performance Lossless Data Embedding Using a Moving Window (움직이는 창을 이용한 고성능 무손실 데이터 삽입 방법)

  • Kang, Ji-Hong;Jin, Honglin;Choe, Yoon-Sik
    • Journal of Broadcast Engineering
    • /
    • v.16 no.5
    • /
    • pp.801-810
    • /
    • 2011
  • This paper proposes a new lossless data embedding algorithm on spatial domain of digital images. A single key parameter is required to embed and extract data in the algorithm instead of embedding any additional information such as the location map. A $3{\times}3$ window slides over the cover image by one pixel unit, and one bit can be embedded at each position of the window. So, the ideal embedding capacity equals to the number of pixels in an image. For further increase of embedding capacity, new weight parameters for the estimation of embedding target pixels have been used. As a result, significant increase in embedding capacity and better quality of the message-embedded image in high capacity embedding have been achieved. This algorithm is verified with simulations.

Reversible Watermarking Using Adaptive Edge-Guided Interpolation

  • Dai, Ningjie;Feng, Guorui;Zeng, Qian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.4
    • /
    • pp.856-873
    • /
    • 2011
  • Reversible watermarking is an open problem in information hiding field, with embedding the encoded bit '1' or '0' into some sensitive images, such as the law enforcement, medical records and military images. The technique can retrieve the original image without distortion, after the embedded message has been extracted. Histogram-based scheme is a remarkable breakthrough in reversible watermarking schemes, in terms of high embedding capacity and low distortion. This scheme is lack of capacity control due to the requirement for embedding large-scale data, because the largest hidden capacity is decided by the amount of pixels with the peak point. In this paper, we propose a reversible watermarking scheme to enlarge the number of pixels with the peak point as large as possible. This algorithm is based on an adaptive edge-guided interpolation, furthermore, hides messages by interpolation-error, i.e. the difference between the original and interpolated image value. Simulation results compared with other state-of-the-art reversible watermarking schemes in this paper demonstrate the validity of the proposed algorithm.

Reversible DNA Watermarking Technique Using Histogram Shifting for Bio-Security (바이오 정보보호 위한 히스토그램 쉬프팅 기반 가역성 DNA 워터마킹 기법)

  • Lee, Suk-Hwan;Kwon, Seong-Geun;Lee, Eung-Joo;Kwon, Ki-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.2
    • /
    • pp.244-253
    • /
    • 2017
  • Reversible DNA watermarking is capable of continuous DNA storage and forgery prevention, and has the advantage of being able to analyze biological mutation processes by external watermarking by iterative process of concealment and restoration. In this paper, we propose a reversible DNA watermarking method based on histogram multiple shifting of noncoding DNA sequence that can prevent false start codon, maintain original sequence length, maintain high watermark capacity without biologic mutation. The proposed method transforms the non-coding region DNA sequence to the n-th code coefficients and embeds the multiple bits of the n-th code coefficients by the non-recursive histogram multiple shifting method. The multi-bit embedding process prevents the false start codon generation through comparison search between adjacent concealed nucleotide sequences. From the experimental results, it was confirmed that the proposed method has higher watermark capacity of 0.004-0.382 bpn than the conventional method and has higher watermark capacity than the additional data. Also, it was confirmed that false start codon was not generated unlike the conventional method.