• Title/Summary/Keyword: 가역 데이터 은닉기법

Search Result 21, Processing Time 0.025 seconds

Data Hiding Method Utilizing Skipping Based Hybrid Histogram Shifting (도약기반의 하이브리드 히스토그램 시프팅을 이용하는 데이터 은닉 방법)

  • Choi, YongSoo;Lee, DalHo
    • Journal of Digital Contents Society
    • /
    • v.19 no.2
    • /
    • pp.371-376
    • /
    • 2018
  • In the system security technology, the information hiding field is developed as technologies for embedding information, which are generally used as contents media. The proposed technique is a technical steganography technique which uses a technique of concealing certain information through physical / statistical change of signal values of contents. Recently, there have been various studies based on histogram shifting in reversible data concealment. In multi - peak histogram shifting, the capacity of data concealment gradually increased by applying multiple peak histogram method. In this paper, we analyze the effect of concealment in terms of adopting the histogram shift method including skipping. In addition, we propose multi - branch data concealment as a general method to improve concealment capacity. The above proposal has proved to be an example using mathematical expressions, and further improvement measures could be derived.

An improved technique for hiding confidential data in the LSB of image pixels using quadruple encryption techniques (4중 암호화 기법을 사용하여 기밀 데이터를 이미지 픽셀의 LSB에 은닉하는 개선된 기법)

  • Soo-Mok Jung
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.17 no.1
    • /
    • pp.17-24
    • /
    • 2024
  • In this paper, we propose a highly secure technique to hide confidential data in image pixels using a quadruple encryption techniques. In the proposed technique, the boundary surface where the image outline exists and the flat surface with little change in pixel values are investigated. At the boundary of the image, in order to preserve the characteristics of the boundary, one bit of confidential data that has been multiply encrypted is spatially encrypted again in the LSB of the pixel located at the boundary to hide the confidential data. At the boundary of an image, in order to preserve the characteristics of the boundary, one bit of confidential data that is multiplely encrypted is hidden in the LSB of the pixel located at the boundary by spatially encrypting it. In pixels that are not on the border of the image but on a flat surface with little change in pixel value, 2-bit confidential data that is multiply encrypted is hidden in the lower 2 bits of the pixel using location-based encryption and spatial encryption techniques. When applying the proposed technique to hide confidential data, the image quality of the stego-image is up to 49.64dB, and the amount of confidential data hidden increases by up to 92.2% compared to the existing LSB method. Without an encryption key, the encrypted confidential data hidden in the stego-image cannot be extracted, and even if extracted, it cannot be decrypted, so the security of the confidential data hidden in the stego-image is maintained very strongly. The proposed technique can be effectively used to hide copyright information in general commercial images such as webtoons that do not require the use of reversible data hiding techniques.

New Fluctuation Functions to Measure Spatial Correlation of Encrypted Images in Reversible Data Hiding (가역적 데이터 은닉에서 암호화된 이미지의 공간 상관관계를 측정하기 위한 새로운 섭동 함수 연구)

  • Khanam, Fatema-Tuz-Zohra;Kim, Sunghwan
    • 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

Design of Generalized Fluctuation Function for Reversible Data Hiding in Encrypted Image (암호화된 영상의 가역적 데이터 은닉을 위한 일반화된 섭동 함수 설계)

  • Kim, Young-Hun;Lim, Dae-Woon;Kim, Young-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.11
    • /
    • pp.1329-1340
    • /
    • 2016
  • Recently, Zhang proposed a scheme to hide information in encrypted images using synchronous stream ciphers. After the receiver decrypts the encrypted image and extracts data by calculating the spatial correlation property value using the fluctuation function which is designed to calculate spacial correlation between adjacent pixels in a decrypted image. Then, Hong improved the Zhang's data hiding scheme by introducing the side match technique. In this paper, a novel fluctuation function is proposed to reduce the recovery errors which arise during extracting hidden data. Then, we also demonstrated that the proposed fluctuation function outperforms the previous functions through computer simulations for sample images.

Design of Fluctuation Function to Improve BER Performance of Data Hiding in Encrypted Image (암호화된 영상의 데이터 은닉 기법의 오류 개선을 위한 섭동 함수 설계)

  • Kim, Young-Hun;Lim, Dae-Woon;Kim, Young-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.3
    • /
    • pp.307-316
    • /
    • 2016
  • Reversible data hiding is a technique to hide any data without affecting the original image. Zhang proposed the encryption of original image and a data hiding scheme in encrypted image. First, the encrypted image is decrypted and uses the fluctuation function which exploits the spatial correlation property of decrypted image to extract hidden data. In this paper, the new fluctuation function is proposed to reduce errors which arise from the process extracting hidden data and the performance is verified by simulation.

Block-based Audio Authentication Algorithm using Reversible Watermarking (가역 워터마킹을 이용한 블록 단위 오디오 인증 알고리즘)

  • Yeo, Dong-Gyu;Jo, Hyun-Wu;Lee, Hae-Yeoun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.380-383
    • /
    • 2011
  • 데이터 은닉 기술은 디지털 콘텐츠에 기밀 정보를 비가시적으로 삽입하는 기술로서, 소유권 증명, 저작권 보호, 방송 모니터링, 콘텐츠 인증 등의 다양한 목적으로 활용되고 있다. 본 논문에서는 오디오 콘텐츠의 무결성을 인증하고 위조 영역을 탐지하기 위한 가역 워터마킹 기반의 블록 단위의 오디오 콘텐츠 인증 기법을 제안한다. 제안한 기법은 오디오를 작은 크기의 블록으로 나누고 각 블록 단위로 워터마크를 삽입하여 무결성 인증을 수행한다. 또한 차이값 히스토그램 기반 가역 워터마킹 알고리즘을 적용함으로써 높은 품질을 유지하면서도 완전한 원본으로의 복원을 가능케 하였다.

Transmission Methods Using RS Codes to Improve Spatial Relationship of Images in Reversible Data Hiding Systems (가역적 데이터 은닉 시스템에서 RS 부호를 사용한 이미지 공간상관 관계 향상을 위한 전송 기법)

  • Kim, Taesoo;Jang, Min-Ho;Kim, Sunghwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.8
    • /
    • pp.1477-1484
    • /
    • 2015
  • In this paper, a novel reversible data hiding by using Reed-Solomon (RS) code is proposed for efficient transmission in encryption image. To increase the recovery of data from encrypted image, RS codes are used to encode messages, and then the codewords can be embedded into encrypted image according to encryption key. After receiving encrypted image which embeds the codewords, the receiver firstly decryptes the encrypted image using the encryption key and get metric about codewords containing messages. According to recovery capability of RS codes, better estimation of message is done in data hiding system. Simulation results about two images and two RS codes show that the performances of the proposed schemes are better than ones of the reference scheme.

An Advanced Watermarking Algorithm with Reversibility (개선된 가역 워터마킹 알고리즘)

  • Jung, Soo-Mok
    • Journal of the Korea Convergence Society
    • /
    • v.9 no.2
    • /
    • pp.151-156
    • /
    • 2018
  • In this paper, an efficient reversible watermarking algorithm is proposed. By using the proposed algorithm, it is possible to increase the amount of copyright-related information to be embedded in cover image. Depending on the spatial locality and surface characteristics, it is possible to precisely predict the pixel value using neighboring pixels. If the predicted pixel value almost the same as the pixel value of the cover image, the differential value between the predicted pixel value and the pixel value of cover image is very small. So, the frequency is increased greatly at the peak point of histogram of difference sequence. Thus, it is possible to increase greatly the amount of secret data to be embedded in cover image. The experimental results show that the proposed watermarking algorithm is superior to the previous algorithms.

Consecutive Difference Expansion Based Reversible DNA Watermarking (연속적 차분 확장 기반 가역 DNA 워터마킹)

  • Lee, Suk-Hwan;Kwon, Ki-Ryong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.7
    • /
    • pp.51-62
    • /
    • 2015
  • Of recent interests on high capacity DNA storage, DNA watermarking for DNA copyright protection, and DNA steganography for DNA secret communication are augmented, the reversible DNA watermarking is much needed both to embed the watermark without changing the functionality of organism and to perfectly recover the host DNA sequence. In this paper, we address two ways of DE based reversible DNA watermarking using noncoding DNA sequence. The reversible DNA watermarking should consider the string structure of a DNA sequence, the organism functionality, the perfect recovery, and the high embedding capacity. We convert the string sequence of four characters in noncoding region to the decimal coded values and embed the watermark bit into coded values by two ways; DE based multiple bits embedding (DE-MBE) using pairs of neighbor coded values and consecutive DE-MBE (C-DE-MBE). Two ways process the comparison searching to prevent the false start codon that produces false coding region. Experimental results verified that our ways have more high embedding capacity than conventional methods and produce no false start codon and recover perfectly the host sequence without the reference sequence. Especially C-DE-MBE can embed more high two times than DE-MBE.

An Efficient Pixel Value Prediction Algorithm using the Similarity and Edge Characteristics Existing in Neighboring Pixels Scanned in Inverse s-order (역 s-순으로 스캔된 주변 픽셀들에 존재하는 유사성과 에지 특성을 이용한 효율적인 픽셀 값 예측 기법)

  • Jung, Soo-Mok
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.1
    • /
    • pp.95-99
    • /
    • 2018
  • In this paper, we propose an efficient pixel value prediction algorithm that can accurately predict pixel value using neighboring pixel values scanned in reverse s-order in the image. Generally, image has similarity with similar values between adjacent pixel values, and may have directional edge characteristics. In this paper, we proposed a method to improve pixel value prediction accuracy by improving GAP(Gradient Adjacent Pixel) algorithm for predicting pixel value by using similarity between adjacent pixels and edge characteristics. The proposed method increases the accuracy of the predicted pixel value by precisely predicting the pixel value using the positional weights of the neighboring pixels. Experiments on real images confirmed the superiority of the proposed algorithm. The proposed algorithm is useful for applications such as reversible data hiding, reversible watermarking, and data compression applications.