Message hidden in 1st and 2nd bit plane

Authors:
Parvinder Singh;Sudhir Batra;H. R. Sharma
Affiliations:
Department of Computer Science and Engineering, Guru Jambheshwar University, Hisar, India;Department of Mathematics and Computer Science, TIT&S, Bhiwani, India;Department of Computer Science and Engineering, CSIT Durg, India
Venue:
ICCOMP'05 Proceedings of the 9th WSEAS International Conference on Computers
Year:
2005

Citing 6
Cited 0

The first 50 years of electronic watermarking

EURASIP Journal on Applied Signal Processing - Emerging applications of multimedia data hiding
Stretching the Limits of Steganography

Proceedings of the First International Workshop on Information Hiding
Computer Based Steganography: How It Works and Why Therefore Any Restrictions on Cryptography Are Nonsense, at Best

Proceedings of the First International Workshop on Information Hiding
Fingerprinting

SP '83 Proceedings of the 1983 IEEE Symposium on Security and Privacy
Exploring Steganography: Seeing the Unseen

Computer
On the limits of steganography

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Four algorithms to hide the message in 1st and 2nd bit plane of image pixel and its retrieval at the receiver end are developed. Algorithms hide the message in 1st bit and 2nd bit in such a way that effect to original image is same as in the case, when message is hidden in least significant bit (0th bit plane). However these algorithms avoid the some of the disadvantages associated with least significant bit insertion method.