A Novel Data Hiding Scheme for Binary Images

08/25/2012
by   Do Van Tuan, et al.
0

This paper presents a new scheme for hiding a secret message in binary images. Given m*n cover image block, the new scheme can conceal as many as log(m*n +1) bits of data in block, by changing at most one bit in the block. The hiding ability of the new scheme is the same as Chang et al.'s scheme and higher than Tseng et al.'s scheme. Additionally, the security of the new scheme is higher than the two above schemes.

READ FULL TEXT
research
07/09/2021

Darlin: A proof carrying data scheme based on Marlin

In this document we describe the Darlin proof carrying data scheme for t...
research
04/02/2020

A high capacity text steganography scheme based on permutation and color coding

In this paper, we propose a text steganographic scheme based on color co...
research
03/08/2023

Achievable Rates and Low-Complexity Encoding of Posterior Matching for the BSC

Horstein, Burnashev, Shayevitz and Feder, Naghshvar et al. and others ha...
research
02/04/2021

A Practical Coding Scheme for the BSC with Feedback

We provide a practical implementation of the rubber method of Ahlswede e...
research
10/18/2018

Using Pseudocodewords to Transmit Information

The linear programming decoder will occasionally output fractional-value...
research
05/05/2022

One Picture is Worth a Thousand Words: A New Wallet Recovery Process

We introduce a new wallet recovery process. Our solution associates 1) v...
research
12/06/2022

A Robust Image Steganographic Scheme against General Scaling Attacks

Conventional covert image communication is assumed to transmit the messa...

Please sign up or login with your details

Forgot password? Click here to reset