CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Implementation of Steganography Secret Sharing approach (N,1) for Color Digital Images

Published on April 2012 by M. Thaneshwari, N. Arumugam
journal_cover_thumbnail

International Conference in Recent trends in Computational Methods, Communication and Controls
Foundation of Computer Science USA
ICON3C - Number 2
April 2012
Authors: M. Thaneshwari, N. Arumugam
ad05ceee-cfb4-4cff-bafc-9a3a34bf7537

M. Thaneshwari, N. Arumugam . Implementation of Steganography Secret Sharing approach (N,1) for Color Digital Images. International Conference in Recent trends in Computational Methods, Communication and Controls. ICON3C, 2 (April 2012), 7-11.

@article{
author = { M. Thaneshwari, N. Arumugam },
title = { Implementation of Steganography Secret Sharing approach (N,1) for Color Digital Images },
journal = { International Conference in Recent trends in Computational Methods, Communication and Controls },
issue_date = { April 2012 },
volume = { ICON3C },
number = { 2 },
month = { April },
year = { 2012 },
issn = 0975-8887,
pages = { 7-11 },
numpages = 5,
url = { /proceedings/icon3c/number2/6009-1010/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 International Conference in Recent trends in Computational Methods, Communication and Controls
%A M. Thaneshwari
%A N. Arumugam
%T Implementation of Steganography Secret Sharing approach (N,1) for Color Digital Images
%J International Conference in Recent trends in Computational Methods, Communication and Controls
%@ 0975-8887
%V ICON3C
%N 2
%P 7-11
%D 2012
%I International Journal of Computer Applications
Abstract

Steganography has been considered as the solution for illicit interception and unauthorized copying of digital media. Steganography hides secret data in a host medium and conveys the hidden data. The intended recipient can then extract the secret data from the stego image. The hidden data should make a visually imperceptible change to the stego image when viewed by an unintended recipient. A remedy to achieve the imperceptibility of the stego image has been proposed, and is a concept called secret sharing. In a secret sharing approach, the sending party sends N stego images to one or multiple recipients and allows a receiving party to extract the secret data only when all N stego images are available. The (N,1) is a steganography secret sharing approach that utilises N+1 cover images. Both the sending party as well as the receiving party shares the N cover images through a secure channel. The remaining one cover image is converted to gray coded stego image at the sending party and is to be sent through an unsecure channel. The conversion is performed based on operations through the N+ 1 cover image pixels and secret data.

References
  1. Chan, C. C. and Hwang, R. J. 1998. Sharing Secret Images using Shadow Codebooks in Information Sciences, 111(1-4): pp 335-345.
  2. Chang C. -C. , T. D. Kieu, and Y. -C. Chou 2008, 'A High Payload Steganographic Scheme Based on (7, 4) Hamming Code for Digital Images', Proc. of the 2008 International Symposium on Electronic Commerce and Security, pp. 16-21.
  3. Feng J. B. , H. C. Wu, C. S. Tsai, and Y. P. Chu 2005, 'A New MultiSecret Images Sharing Scheme Using Largrange's Interpolation', Journal of Systems and Software,76(3), pp. 327- 339.
  4. Kim C. , E. -J. Yoon, Y. -S. Hong, and H. 1. Kim 2009, 'Secret Sharing Scheme Using Gray Code based on Steganography' Journal of the Institute of Electronics Engineers of Korea, 46(1), pp. 96-102.
  5. Lin C. C. , and W. H. Tsai 2004, 'Secret Image Sharing with Steganography and Authentication', Journal of Systems and Software, 73(3), pp. 405-414.
  6. Miche Y. , P. Bas, A. Lendasse, and C. Jutten 2009, 'Reliable Steganalysis Using a Minimum Set of Samples and Features', EURASIP Journal on Information Security, DOI:IO. 1155/2009/901381.
  7. Provos N. , and P. Honeyman 2003, 'Hide and Seek: An Introduction to Steganography', IEEE Security and Privacy, 1(3), pp. 32-44.
  8. Sallee P. 2004, 'Model-Based Steganography' LNCS, Vol. 2939, pp. 254-260.
  9. Sharmir A. 1979, 'How to Share a Secret', Communications of the ACM, 22(11), pp. 612-613.
  10. Solanki K. , A. Sarkar, and B. S. manjunath 2008, 'YASS: Yet Another Steganographic Scheme That Resists Blind Steganalysis', LNCS, Vol. 4567, pp. 16-31.
  11. Thien C. C. , and J. C. Lin 2002, 'Secret Image Sharing', Computers and Graphics, 26(1), pp. 765-770.
  12. Westfeld A. 2001, 'F5-A Steganographic Algorithm: High Capacity Despite Better Steganalysis' LNCS, Vol. 2137, pp. 289-302.
  13. Westfeld A. , and A. Pfitzmann 1999, 'Attacks on Steganographic Systems', LNCS, Vol. 1768, pp. 61-76.
  14. Zhang W. , S. Wang, and X. Zhang 2007, 'Improving Embedding Efficiency of Covering Codes for Applications in Steganogrphy', IEEE Communications Letters,11(8), pp. 680-682.
Index Terms

Computer Science
Information Sciences

Keywords

Steganography Least Significant Bit Embedding Extracting