• Title/Summary/Keyword: data hiding capacity

Search Result 76, Processing Time 0.019 seconds

Dual Image Reversible Data Hiding Scheme Based on Secret Sharing to Increase Secret Data Embedding Capacity (비밀자료 삽입용량을 증가시키기 위한 비밀 공유 기반의 이중 이미지 가역 정보은닉 기법)

  • Kim, Pyung Han;Ryu, Kwan-Woo
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.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.

Secure Modulus Data Hiding Scheme

  • Kuo, Wen-Chung
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.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.

High Capacity Information Hiding Method Based on Pixel-value Adjustment with Modulus Operation

  • Li, Teng;Zhang, Yu;Wang, Sha;Sun, Jun-jie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.4
    • /
    • pp.1521-1537
    • /
    • 2021
  • Through information hiding technique, secret message can be hidden in pictures. Stego-image quality and hiding capacity are two important metrics for information hiding. To enhance these metrics, many schemes were proposed by scholars in recent years. Some of them are effective and successful, but there is still a room for further improvement. A high capacity information hiding scheme (PAMO, Pixel-value Adjustment with Modulus Operation Algorithm) is introduced in this paper. PAMO scheme uses pixel value adjustment with modulus operation to hide confidential data in cover-image. PAMO scheme and some referenced schemes are implemented in Python and experiments are carried out to evaluate their performance. In the experiments, PAMO scheme shows better performance than other methods do. When secret message length is less than 72000 bits, the highest hiding capacity of PAMO can reach 7 bits per pixel, at the same time the PSNR of stego-images is greater than 30 dB.

A New Information Data Hiding Scheme based on Pattern Information of Secret Data (비밀데이터의 패턴정보에 기반한 새로운 정보은닉 기법)

  • Kim, Ki-Jong;Shin, Sang-Ho;Yoo, Kee-Young
    • 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.

Histogram-based Reversible Data Hiding Based on Pixel Differences with Prediction and Sorting

  • Chang, Ya-Fen;Tai, Wei-Liang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.12
    • /
    • pp.3100-3116
    • /
    • 2012
  • Reversible data hiding enables the embedding of messages in a host image without any loss of host content, which is proposed for image authentication that if the watermarked image is deemed authentic, we can revert it to the exact copy of the original image before the embedding occurred. In this paper, we present an improved histogram-based reversible data hiding scheme based on prediction and sorting. A rhombus prediction is employed to explore the prediction for histogram-based embedding. Sorting the prediction has a good influence on increasing the embedding capacity. Characteristics of the pixel difference are used to achieve large hiding capacity while keeping low distortion. The proposed scheme exploits a two-stage embedding strategy to solve the problem about communicating peak points. We also present a histogram shifting technique to prevent overflow and underflow. Performance comparisons with other existing reversible data hiding schemes are provided to demonstrate the superiority of the proposed scheme.

High capacity multi-bit data hiding based on modified histogram shifting technique

  • Sivasubramanian, Nandhini;Konganathan, Gunaseelan;Rao, Yeragudipati Venkata Ramana
    • ETRI Journal
    • /
    • v.40 no.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.

A Robust Reversible Data Hiding Scheme with Large Embedding Capacity and High Visual Quality

  • Munkbaatar, Doyoddorj;Park, Young-Ho;Rhee, Kyung-Hyune
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.7
    • /
    • pp.891-902
    • /
    • 2012
  • Reversible data hiding scheme is a form of steganography in which the secret embedding data can be retrieved from a stego image for the purpose of identification, copyright protection and making a covert channel. The reversible data hiding should satisfy that not only are the distortions due to artifacts against the cover image invisible but also it has large embedding capacity as far as possible. In this paper, we propose a robust reversible data hiding scheme by exploiting the differences between a center pixel and its neighboring pixels in each sub-block of the image to embed secret data into extra space. Moreover, our scheme enhances the embedding capacity and can recover the embedded data from the stego image without causing any perceptible distortions to the cover image. Simulation results show that our proposed scheme has lower visible distortions in the stego image and provides robustness to geometrical image manipulations, such as rotation and cropping operations.

New reversible data hiding algorithm based on difference expansion method

  • Kim, Hyoung-Joong;Sachnev, Vasiliy;Kim, Dong-Hoi
    • Journal of Broadcast Engineering
    • /
    • v.12 no.2
    • /
    • pp.112-119
    • /
    • 2007
  • Reversible data embedding theory has marked a new epoch for data hiding and information security. Being reversible, the original data and the embedded data as well should be completely restored. Difference expansion transform is a remarkable breakthrough in reversible data hiding scheme. The difference expansion method achieves high embedding capacity and keeps the distortion low. This paper shows that the difference expansion method with simplified location map, and new expandability and changeability can achieve more embedding capacity while keeping the distortion almost the same as the original expansion method.

A Reversible Data Hiding Scheme Using 7×7 Sudoku Based on Secret Sharing (비밀 공유 기반의 7×7 스도쿠를 사용한 가역 정보 은닉 기법)

  • Kim, Young-Ju;Kim, Pyung-Han;Yoo, Kee-Young
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.2
    • /
    • pp.261-270
    • /
    • 2017
  • Data hiding is a way to hide the information in multimedia media such as images or video. The scheme proposed by Nguyen and Chang, was able to embed, extract, and restore the cover image and the secret data using Sudoku. But in the extracting phase, the occurrence of duplicate values in the reference matrix was found to decrease the embedding capacity of secret data. This paper has proposed a reversible data hiding scheme while maintaining the quality of the image to provide high embedding capacity using $7{\times}7$ Sudoku and Shamir's secret sharing scheme.

Reversible Data Hiding Scheme Based on Maximum Histogram Gap of Image Blocks

  • Arabzadeh, Mohammad;Rahimi, Mohammad Reza
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.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.