• Title/Summary/Keyword: Image hiding

Search Result 223, Processing Time 0.024 seconds

A novel Reversible Data Hiding Scheme based on Modulo Operation and Histogram Shifting (모듈러 연산과 히스토그램 이동에 기반한 새로운 가역 정보 은닉 기법)

  • Kim, Dae-Soo;Yoo, Kee-Young
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.5
    • /
    • pp.639-650
    • /
    • 2012
  • In 2009, Tsai et al. proposed reversible image hiding scheme using linear prediction coding and histogram shifting. Tsai et al.'s scheme improved the hiding capacity of Ni et al.'s scheme by using the prediction coding and two histograms. However, Tsai et al.'s scheme has problems. In the prediction coding, the basic pixel is not used from embedding procedure. Many additional communication data are generated because two peak and zero point pairs are generated by each block. To solve the problems, this paper proposes a novel reversible data hiding scheme based on modulo operation and histogram shifting. In experimental results, the hiding capacity was increased by 28% than Tsai et al.'s scheme. However, the additional communication data was decreased by 71%.

An Image Hiding Scheme by Linking Pixels in the Circular Way

  • Chan, Chi-Shiang;Tsai, Yuan-Yu;Liu, Chao-Liang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.6
    • /
    • pp.1718-1734
    • /
    • 2012
  • The proposed method in this paper is derived from Mielikainen's hiding method. However, there exist some significant differences between two methods. In Mielikainen's method, pixels are partitioned into pairs and a LSB matching function is applied to two pixels for hiding. On the contrary, the proposed method partitions pixels into groups with three pixels in each group. The bits of pixels in each group are linked by using an exclusive OR (XOR) operator in a circular way. If the number of different values between the calculated XOR values and the secret bits is smaller than or equal to 2 in a group, the proposed method can guarantee that at most one pixel is needed to be modified by adding/subtracting its value to/from one, and three secret bits can be embedded to three pixels. Through theoretical analysis, the amount of the embedded secret data in the proposed method is larger than those in other methods under the same amount of pixel modifications. Taking real images in our experiments, the quality of stego-images in the proposed method is higher than those in other methods.

Efficient Scheme for Secret Hiding in QR Code by Improving Exploiting Modification Direction

  • Huang, Peng-Cheng;Li, Yung-Hui;Chang, Chin-Chen;Liu, Yanjun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.5
    • /
    • pp.2348-2365
    • /
    • 2018
  • QR codes as public patent are widely used to acquire the information in various fields. However, it faces security problem when delivering the privacy message by QR code. To overcome this weakness, we propose a secret hiding scheme by improving exploiting modification direction to protect the private message in QR code. The secret messages will be converted into octal digit stream and concealed to the cover QR code by overwriting the cover QR code public message bits. And the private messages can be faithfully decoded using the extraction function. In our secret hiding scheme, the QR code public message still can be fully decoded publicly from the marked QR codes via any standard QR Code reader, which helps to reduce attackers' curiosity. Experiments show that the proposed scheme is feasible, with high secret payload, high security protection level, and resistant to common image post-processing attacks.

A Study on reversible data hiding using the characteristics of image and solving CZP problem (영상의 특성을 효과적으로 이용하고 CZP 문제를 해결하여 영상에 가역적으로 데이터를 은닉하는 기법에 대한 연구)

  • Jung, Soo-Mok
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.12 no.1
    • /
    • pp.83-91
    • /
    • 2019
  • In this paper, we have effectively used the surface characteristics and local similarity existing in image, solved the problem that there is no CZP(Closest Zero point) that occurs in a very few images to hide secrete data into cover image by using histogram shift. By applying the proposed technique, it is possible to hide secrete data invisibly into the cover image, extract secrete data from the stego-image with no data loss, and completely restore the original cover image. It is impossible to know whether the secrete data is hidden in the stego-image because the stego-image constructed by applying the proposed technique has a good visual quality that can not distinguish the difference from the cover image. The proposed method is able to hide secrete data at various levels compared to conventional APD(Adjacent Pixel Difference) technique, and hide secrete data up to 25.1% more than APD in cover image.

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.

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.

ACA Based Image Steganography

  • Sarkar, Anindita;Nag, Amitava;Biswas, Sushanta;Sarkar, Partha Pratim
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.2 no.5
    • /
    • pp.266-276
    • /
    • 2013
  • LSB-based steganography is a simple and well known information hiding technique. In most LSB based techniques, a secret message is embedded into a specific position of LSB in the cover pixels. On the other hand, the main threat of LSB-based steganography is steganalysis. This paper proposes an asynchronous-cellular-automata(ACA)-based steganographic method, where secret bits are embedded into the selected position inside the cover pixel by ACA rule 51 and a secret key. As a result, it is very difficult for malicious users to retrieve a secret message from a cover image without knowing the secret key, even if the extraction algorithm is known. In addition, another layer of security is provided by almost random (rule-based) selection of a cover pixel for embedding using ACA and a different secret key. Finally, the experimental results show that the proposed method can be secured against the well-known steganalysis RS-attack.

  • PDF

A Study on Optical Information Processing using Volume Hologram (체적 홀로그램을 이용한 광정보처리 기술에 관한 연구)

  • Cho, Chong Duck;Kim, Kyu Tae
    • 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.

Steganographic Method Based on Three Directional Embedding (세 방향 자료 은닉이 가능한 이미지 스테가노그래픽기법 연구)

  • Jung, Ki-Hyun;Kim, In-Taek;Kim, Jae-Cheol
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.13 no.2
    • /
    • pp.268-274
    • /
    • 2010
  • A steganographic method using three directional data embedding for gray images is presented in this paper. Cover image is divided into non-overlapping $2\times2$ sub-blocks and the basis pixel is selected to calculate the three different values of each sub-block. Difference values are replaced by embedding the number of secret bits that is referenced by the range table. For the three pixel pairs in the sub-block, the optimal pixel adjustment is preceded to reduce the distortion of visual quality. The experimental results show that the proposed method achieves a good visual quality and high capacity.

Lossless Information Hiding Based on the Histogram of the Difference Image (차분 영상의 히스토그램 특성을 이용한 무손실 정보은닉 알고리즘)

  • Lee Sang-Kwang;Ho Yo-Sung
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2003.11a
    • /
    • pp.31-34
    • /
    • 2003
  • 본 논문에서는 숨겨진 정보를 검출한 후. 정보가 삽입 된 영상으로부터 왜곡 없이 원본 영상을 복원할 수 있는 무손실 정보은닉(lossless information hiding) 알고리즘을 제안한다. 제안된 알고리즘은 차분 영상(difference image)의 히스토그램 특성을 기반으로 화소 값을 수정하여 데이터를 삽입한다. 이 알고리즘은 기존의 무손실 정보은닉 알고리즘들에 비해 정보 삽입으로 인한 왜곡이 적고. 많은 양의 정보를 삽입할 수 있다 이론적인 증명과 실험 견과를 통해 제안된 알고리즘에 의해 정보가 삽입된 영상의 PSNR(peak singal-to-noise ratio) 값은 대략 51dB 이상의 값을 나타내며. 이 값은 다른 무손식 정보은닉 알고리즘들 보다 훨씬 높다. 또한, 제안된 알고리즘은 여러 형태로 변형되어 다양한 응용에 적절히 적용될 수 있다

  • PDF