Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2108616.2108679acmconferencesArticle/Chapter ViewAbstractPublication PagesicuimcConference Proceedingsconference-collections
research-article

Hiding data in parity check bit

Published: 14 January 2010 Publication History

Abstract

In this paper, we propose a method to hide secret data in parity check bits. In the data embedding phase, the method first takes 4 bits from the cover data and 3 bits from the secret data. The 3-bit secret data are inserted into appropriate positions that represent the parity bits of the 4-bit cover data to form a code word. The Matrix Coding is then used to select a specific bit from the code word to modify so that the code word can satisfy the condition of (7, 4) Hamming code and the 4-bit stego data can be obtained. If the selected bit is a data bit, it is directly modified. In this case, the three parity check bits of the 4-bit stego data are exactly the 3-bit secret data. However, if the selected bit is a parity check bit of the code word, instead of modifying the parity check bit, two cover data bits are modified. In the data extracting phase, the 3-bit secret data can be extracted by calculating parity check bits of 4-bit stego data. The experimental results show that the proposed method has achieved comparable embedding capacity, and the number of modified pixels is also satisfactory.

References

[1]
C. C. Chen and C. C. Chang, "LSB-Based Steganography Using Reflected Gray Code," IEICE Transactions on Information and Systems, vol. E91-D, no. 4, April 2008, pp. 1110--116.
[2]
C. C. Chang, J. Y. Hsiao and C. S. Chan, "Finding Optimal LSB Substitution in Image Hiding by Dynamic Programming Strategy," Pattern Recognition, vol. 36, no. 7, July 2003, pp. 1583--1595.
[3]
C. C. Chang, C. C. Lin and Y. S. Hu, "An SVD oriented watermark embedding scheme with high qualities for the restored images," International Journal of Innovative Computing, Information and Control, vol.3, no.3, 2007, pp.609--620.
[4]
M. S. Fu and O. C. Au, "Halftone Image Data Hiding with Intensity Selection and Connection Selection," Signal Processing: Image Communication, vol. 16, no. 10, August 2001, pp. 909--930.
[5]
M. S. Fu and O. C. Au, "Steganography in Halftone Images: Conjugate Error Diffusion," Signal Processing, vol. 83, no. 10, October 2003, pp. 2171--2178.
[6]
R. W. Hamming, "Error Detecting and Error Correcting Codes," Bell System Technical Journal, vol. 26, no. 2, 1950, pp. 147--160.
[7]
Y. Lee, H. Kim and Y. Park, "A new data hiding scheme for binary image authentication with small image distortion," Information Sciences, vol. 179, no.22, 2009, pp. 3866--3884.
[8]
S. S. Maniccam and N. Bourbakis, "Lossless Compression and Information Hiding in Images," Pattern Recognition, vol. 37, no.3, Mach 2004, pp. 475--486.
[9]
S. C. Pei, and J. M. Guo, "Data Hiding in Halftone Images with Noise-Balanced Error Diffusion," IEEE Signal Processing Letters, vol. 10, no. 12, December 2003, pp. 345--351.
[10]
R. Crandall, "Some Notes on Steganography," posted on Steganography Mailing List, http://os.inf.tu-dresden.de/~westfeld/crandall.pdf, 1998.
[11]
J. Spaulding, H. Noda, M. Shirazi and E. Kawaguchi, "BPCS Steganography Using EZW Lossy Compressed Images," Pattern Recognition Letters, vol. 23, no.13, November 2002, pp. 1579--1587.

Cited By

View all
  • (2010)Hiding secret in parity check bits by applying XOR Function9th IEEE International Conference on Cognitive Informatics (ICCI'10)10.1109/COGINF.2010.5599798(835-839)Online publication date: Jul-2010

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
ICUIMC '10: Proceedings of the 4th International Conference on Uniquitous Information Management and Communication
January 2010
550 pages
ISBN:9781605588933
DOI:10.1145/2108616
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 January 2010

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Hamming code
  2. halftone image
  3. matrix coding

Qualifiers

  • Research-article

Conference

ICUIMC '10
Sponsor:

Acceptance Rates

Overall Acceptance Rate 251 of 941 submissions, 27%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2010)Hiding secret in parity check bits by applying XOR Function9th IEEE International Conference on Cognitive Informatics (ICCI'10)10.1109/COGINF.2010.5599798(835-839)Online publication date: Jul-2010

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media