Open Access Open Access  Restricted Access Subscription or Fee Access

LSB and DCT Based Steganography in Safe Message Routing and Delivery for Structured Peer-To-Peer Systems

G. Satyavathy, M. Punithavalli

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 DCT based Steganography which embeds the text message in least significant bits of the Discrete Cosine (DC) coefficient of digital picture. When information is hidden inside video, the program hiding the information usually performs the DCT. DCT works by slightly changing each of the images in the video, only to the extent that is not noticeable by the human eye. An implementation of both these methods and their performance analysis has been done in this paper.

Keywords


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

Full Text:

PDF

References


G.Satyavathy, M. Punithavalli, Steganography in Safe Message Routing and delivery for Structured Peer-to-Peer Systems

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 Operatating System Design and Implementation, Dec 2002.

D. Wallach, A survey of peer-to-peer security isssues. In Proceedings of International Symposium of Software Security - Theories and Systems, Nov 2003.

M. S. Artigas, P. G. Lopez, A. F. G. Skarmeta, A Novel methodology for constructing secure multipath overlays. IEEE Internet Computing, 9(6):50-57,2005.

E. K. Lua, T. Griffn, M. Pias, H. Zheng, and J. Crowcroft, On-line secret sharing. In ACM SIGCOMM- Usenix Internet Measurement Conference 2005 (IMC2005), Oct 2005.

E. K. Lua and T. G. Griffn, Embeddable overlay networks. In Proceedings of IEEE Symposium on Computers and Communications 2007, July 2007.

I. 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.

A. 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 .

B. 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.

J. R. Douceur, The Sybil attack. In Proceedings of the First International Workshop on Peer-to-Peer System, March 2002.

E. K. Lua, Securing peer-to-peer overlay networks from sybil attack. In Proceedings of International Symposium on Communications and Information Technologies, Oct 2007.

D. A. Bryan, B. B. Lowekamp, and M. Zangrilli, The design of a versatile, secure P2PSIP communications architecture for the public internet. In Proceedings of IEEE International Symposium on Parallel and Distributed Processing, April 2008.

Xu Xiang,Tan Jin, Efficient Secure Message Routing for Structured Peer-to-Peer Systems.2009 International Conference on Networks Security,Wireless Communications and Trusted Computing.

Jiju A. Mathew, Steganography and Covert Communications in Open Systems Environment. 2009 International Conference on Advances in Recent Technologies in Communication and Computing.

Ken Cabeen and Peter Gent, ―Image Compression and Discrete Cosine Transform‖, College ofRedwoods. http://online.redwoods.cc.ca.us/instruct/darnold/LAPROJ/Fall98/PKen/dct.pdf P a g e | 8 Vol. 10 Issue 1 (Ver 1.0), April 2010 Global Journal of Computer Science and Technology

Andrew B. Watson, ―Image Compression Using the Discrete Cosine Transform‖, NASA Ames Research Center , Mathematica Journal, 4(1), p.81- 88,1994

Dr.Ekta Walia, Payal Jain, Navdeep, An Analysis of LSB & DCT Based Steganography.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.