Email this article 
Open Access
Subscription or Fee Access
Hidden Traffic Pattern from Disclosure Attack in MANETs
Abstract
Number of techniques has been proposed based on packet encryption to protect the communication in MANETs. STARS functioning based on stastical characteristics of captured raw traffic. STARS discover the relationships of source to destination communication.
To prevent STAR attack an source hidding technique is introduced. The traffic pattern aims to derive the source/destination probability distribution. That is the probability for each node to entire traffic captured with link details message source/destination and the end-to-end link probability distribution that is the probability for each pair of nodes to be an end-to-end communication pair. Hence construct point-to-point traffic originate and then derive the end-to-end traffic with a set of traffic filtering rules; thus actual traffic protected from disclosure attack. Through this protective mechanism efficiency of traffic increased by 95% from attacked traffic. For further enhancement to avoid overall attacks second shortest path is selected.
References
BingLie,Dijiang,Huang,Senior,Member,Yang,Qin,in,(2014)”STARS:AStatistical Traffic Pattern Discovery System for MANETs” ,IEEE Transaction on dependable and secure computing. Vol 11,No2.pp.181-192.
Chaum D,(1981) “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms,” Comm. ACM, Vol. 24, No. 2, pp. 84-88.
Chen S, and Jajodia S, Wang X, (2007) “Network Flow Watermarking Attack on Low-Latency Anonymous Communication Systems,” Proc. IEEE Symp. Security and Privacy, pp. 116-130.
Dai W,(2013) “Two Attacks against a PipeNet-Like Protocol Once Used by the Freedom Service,” tp://weidai.com/freedomattacks. Txt
Danezis G,(2003) “Statistical Disclosure Attacks: Traffic Confirmation in Open Environments,” Proc. Security and Privacy in the Age of Uncertainty (SEC ’03), Vol. 122, pp. 421-426.
Figueiredo D, Towsley D, Nain P, (2004) “On the Analysis of the Predecessor Attack on Anonymity Systems,” technical report, Computer Science, pp. 04-65.
Huang D, Qin Y, (2008) “OLAR: On-Demand Lightweight Anonymous Routing in MANETs,” Proc. Fourth Int’l Conf. Mobile Computing and Ubiquitous Networking (ICMU ’08), pp. 72-79.
Keromytis, Rubin A , Blaze M, Ioannidis J , Malkin T ,(2005) “WAR: Wireless Anonymous Routing,” Proc. Int’l Conf. Security Protocols, pp. 218-232.
Kong J, Gerla M. Hong X, (2007) “An Identity-Free and On- Demand Routing Scheme against Anonymity Threats in Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, Vol. 6, No. 8, pp. 888-902.
Liu W, Lou W, and Fang Y, Zhang Y, (2006) “MASK: Anonymous On- Demand Routing in Mobile Ad Hoc Networks,” IEEE Trans. Wireless Comm., Vol. 5, No. 9, pp. 2376-2385.
Raymond J,(2001) “Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems,” Proc. Int’l Workshop Designing Privacy Enhancing Technologies: Design Issues in Anonymity and Unobservability, pp. 10-29.
Rubin, Reiter M ,(1998) “Crowds: Anonymity for Web Transactions” ACM Trans. Information and System Security, Vol. 1, No. 1, pp. 66-92.
Salem N,Buttyan L,Hubaux J,and Jakobsson M,(2006), “Node Cooperation in Hybrid Ad Hoc Networks ,” IEEE Trans.on Mobile Computing, Vol 5 No.4, pp. 365-376.
Serjantov, Danezis G.,(2004) “Statistical Disclosure or Intersection Attacks on Anonymity Systems,” Proc. Sixth Information Hiding Workshop (IH ’04), pp. 293-308.
Yi S, Naldurg P, and Kravets R, (2001), “Securiy-Aware Ad Hoc Routing for Wireless Networks,” in Proc.2nd ACM Symp.MobiHoc Networking Computing, pp. 299–302
www.wikepedia.com
www.cisco.com
www.PacketDeliveryratio.awk.com
http://www.businessdictionary.com/definition/overhead.html
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.