CFP last date
20 January 2025
Reseach Article

LSB, 3D-DCT and Huffman Encoding based Steganography in Safe Message Routing and Delivery for Structured Peer-to-Peer Systems

Published on None 2011 by G.Satyavathy, M.Punithavalli
Artificial Intelligence Techniques - Novel Approaches & Practical Applications
Foundation of Computer Science USA
AIT - Number 1
None 2011
Authors: G.Satyavathy, M.Punithavalli
fcfe71bc-e92f-4772-bbbb-933dfc880090

G.Satyavathy, M.Punithavalli . LSB, 3D-DCT and Huffman Encoding based Steganography in Safe Message Routing and Delivery for Structured Peer-to-Peer Systems. Artificial Intelligence Techniques - Novel Approaches & Practical Applications. AIT, 1 (None 2011), 1-5.

@article{
author = { G.Satyavathy, M.Punithavalli },
title = { LSB, 3D-DCT and Huffman Encoding based Steganography in Safe Message Routing and Delivery for Structured Peer-to-Peer Systems },
journal = { Artificial Intelligence Techniques - Novel Approaches & Practical Applications },
issue_date = { None 2011 },
volume = { AIT },
number = { 1 },
month = { None },
year = { 2011 },
issn = 0975-8887,
pages = { 1-5 },
numpages = 5,
url = { /specialissues/ait/number1/2827-208/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Special Issue Article
%1 Artificial Intelligence Techniques - Novel Approaches & Practical Applications
%A G.Satyavathy
%A M.Punithavalli
%T LSB, 3D-DCT and Huffman Encoding based Steganography in Safe Message Routing and Delivery for Structured Peer-to-Peer Systems
%J Artificial Intelligence Techniques - Novel Approaches & Practical Applications
%@ 0975-8887
%V AIT
%N 1
%P 1-5
%D 2011
%I International Journal of Computer Applications
Abstract

In structured P2P systems, message deliverance can be done by identifying the peer IDs of the individual systems. The initiator has to decide the destination and can route the message through one or more hops. The message passes from one hop to another correctly by identifying the IP address and finally reaches the destination. In this paper we propose an efficient routing strategy to control the routing path and to identify the malicious nodes. We also eliminate the drawbacks of encryption by introducing steganography in message deliverance. This paper proposes a new steganographic encoding scheme which separates the colour channels of the windows bitmap images and then hides messages randomly in the LSB of one colour component of a chosen pixel where the colour components of the other two are found to be equal to the key selected. In addition to this we apply 3D-DCT based Steganography which embeds the text message in LSB of the Discrete Cosine (DC) coefficient of digital picture. Then Huffman encoding is also performed on the secret messages/images before embedding and each bit of Huffman code of secret message/image is embedded in the frequency domain by altering the LSB of each of the DCT coefficients of cover image blocks. The experimental results shows that the algorithm has a high capacity and a good invisibility. Moreover PSNR of cover image with stego-image shows better results in comparison with other existing steganography approaches. Furthermore, satisfactory security is maintained since the secret message/image cannot be extracted without knowing decoding rules and Huffman table. An implementation of these methods and their performance analysis has been done in this paper.

References
  1. G.Satyavathy, M. Punithavalli, “Steganography in Safe Message Routing and delivery for Structured Peer-to-Peer Systems”.
  2. M. Castro, P. Duschel, A. Rowstron, and D. S. Wallach, “Secure routing for structured peer-to-peer overlay network”. In Proceedings of the fifth Symposium on Operating System Design and Implementation, Dec 2002.
  3. D. Wallach, “A survey of peer-to-peer security issues”. In Proceedings of International Symposium of Software Security - Theories and Systems, Nov 2003.
  4. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. “Chord: A scalable peer-to-peer lookup service for Internet applications”. In Proceedings of SIGCOMM 2001, pages 149-160, August 2001.
  5. Rowstron and P. Druschel., “Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems”. Lecture Notes in Computer Science, 2218:161-172, November .
  6. Y. Zhao, J. D. Kubiatowicz, and A. D. Joseph.,”Tapestry: An infrastructure for fault-tolerant wide-area location and routing”. Technical Report UCB/CSD-01-1141, UC Berkeley, Apr, 2001.
  7. J. R. Douceur, “The Sybil attack”. In Proceedings of the First International Workshop on Peer-to-Peer System, March 2002.
  8. Xu Xiang,Tan Jin, “Efficient Secure Message Routing for Structured Peer-to-Peer Systems”. 2009 International Conference on Network Security, Wireless Communications and Trusted Computing.
  9. Jiju A. Mathew, “Steganography and Covert Communications in Open Systems Environment”. 2009 International Conference on Advances in Recent Technologies in Communication and Computing.
  10. Dr.Ekta Walia, Payal Jain, Navdeep, “An Analysis of LSB & DCT Based Steganography”.
  11. A.Nag,S.Biswas,D.Sarkar,P.PSarkar, ”A novel technique for image steganography based on Block-DCT and Huffman Encoding”-International Journal of Computer Science and Information Technology.
  12. Gonzalez, R.C. and Woods, R.E., “Digital Image Processing using MATLAB”, Pearson Education, India, 2006.
  13. Jayaraman, S., Esakkirajan, S. and Veerakumar, T. “Digital Image Processing”, Tata McGraw Hill Education Private Limited, India, 2009.
  14. Samir kumar Bandyopadhyay, Tuhin Utsab Paul,Avishek Raychoudhary, “A Novel Steganographic Technique Based on 3D-DCT Approach-Computer and Information Science Vol 3, No: 4, November 2010.
  15. Andrew S.Tanenbaum ,”Computer Networks”,4th edition.
Index Terms

Computer Science
Information Sciences

Keywords

Peer-to-Peer Least Significant Bit (LSB) Discrete Cosine Transform (DCT) Huffman Encoding Steganography Discrete Cosine Transform (DCT) Huffman Encoding Steganography