Secure and invisible data hiding in 2-color images

Yu-Chee Tseng, Hsiang Kuang Pan

Research output: Contribution to journalArticle

50 Scopus citations


In an earlier paper [1], we propose a steganography scheme for hiding a piece of critical information in a host binary image. That scheme ensures that in each m × n image block of the host image, as many as [log2(mn + 1)] bits can be hidden in the block by changing at most 2 bits in the block. As a sequel of that work, in this paper we propose a revised scheme that can maintain higher quality of the host image by sacrificing some data hiding space. The new scheme can still offer a good data hiding ratio. It ensures that for any bit that is modified in the host image, the bit is adjacent to another bit which has a value equal to the former's new value. Thus, the hiding effect is quite invisible.

Original languageEnglish
Pages (from-to)887-896
Number of pages10
JournalProceedings - IEEE INFOCOM
StatePublished - 1 Jan 2001


  • Binary image processing
  • Coding
  • Cryptography
  • Information hiding
  • Prisoner's problem
  • Security
  • Steganography

Fingerprint Dive into the research topics of 'Secure and invisible data hiding in 2-color images'. Together they form a unique fingerprint.

  • Cite this