Anonymous Routing Research Articles

Breaking On-Chip Communication Anonymity using Flow Correlation Attacks

Network-on-Chip (NoC) is widely used to facilitate communication between components in sophisticated System-on-Chip (SoC) designs. Security of the on-chip communication is crucial because exploiting any vulnerability in shared NoC would be a goldmine for an attacker that puts the entire computing infrastructure at risk. We investigate the security strength of existing anonymous routing protocols in NoC architectures, making two pivotal contributions. Firstly, we develop and perform a machine learning (ML)-based flow correlation attack on existing anonymous routing techniques in Network-on-Chip (NoC) systems, revealing that they provide only packet-level anonymity. Secondly, we propose a novel, lightweight anonymous routing protocol featuring outbound traffic tunneling and traffic obfuscation. This protocol is designed to provide robust defense against ML-based flow correlation attacks, ensuring both packet-level and flow-level anonymity. Experimental evaluation using both real and synthetic traffic demonstrates that our proposed attack successfully deanonymizes state-of-the-art anonymous routing in NoC architectures with high accuracy (up to 99%) for diverse traffic patterns. It also reveals that our lightweight anonymous routing protocol can defend against ML-based attacks with minor hardware and performance overhead.

A Comprehensive Review of Geographic Routing Protocols in Wireless Sensor Network

To analyses the impact of high mobility, dynamic topologies, scalability and routing due to the more dynamic changes in network. To enhance mobile Ad-hoc network (MANET) self-organization capabilities by geographical routing algorithm during mobility. In this paper, a survey has been carried out on geographic routing protocols, such as hybrid routing, Greedy Routing, face-2 Algorithm, Perimeter Routing, quasi random deployment (QRD) techniques and time of arrival (TOA). An optimized multipath routing in wireless sensor network (WSN), energy utilization, detection of anonymous routing, node mobility prediction, data packet distribution strategies in WSN is analyzed. Geographic routing offers previous data packet information such as physical locations, packet elimination dependencies, storage capacity of topology, Associate costs and also identifies the dynamic behavior of nodes with respect to packets frequencies.

Self-Configuration and Self-Healing Framework Using Extreme Gradient Boosting (XGBoost) Classifier for IoT-WSN

In most Internet of Things (IoT) systems, Quality of service (QoS) must be confirmed with respect to the requirement of implementation domain. The dynamic nature of the IoT surroundings shapes it to complicate the fulfilment of these commitments. A wide range of unpredictable events endanger the quality of service. While execution the self-adaptive schemes handle with system’s unpredictable. In IoT-based Wireless Sensor Networks (WSNs), the significant self-management objectives are self-configuration (SC) and self-healing (SH). In this paper, Self-Configuration and Self-healing Framework using an extreme gradient boosting (XGBoost) Classifier are proposed. In this framework, the IoT traffic classes are categorized as several types under XGBoost classifier. In SC phase, the IoT devices are self-configured by allocating various transmission slots, contention access period (CAPs) on the basis of its categories with priorities. In SH phase, the source node cardinally establishes a confined route retrieval method if the residual power in-between node is truncated or the node has displaced far away. The proposed framework is executed in NS-2 and the results exhibit that the proposed framework has higher packet delivery ratio with reduced packet drops and computational cost. Therefore, the proposed approach has attained 24.7%, 28.9%, 12.75% higher PDR, and 16.8%, 19.87%, and 13.7% higher residual energy than the existing methods like Self-Healing and Seamless Connectivity using Kalman Filter among IoT Networks (SH-SC-KF-IoT), Provenance aware run-time verification mechanism for self-healing IoT (PA-RVM-SH-IoT), and Fully Anonymous Routing Protocol and Self-healing Capacity in Unbalanced Sensor Networks (FARP-SC-USN) methods, respectively.

Securing Network-on-chips Against Fault-injection and Crypto-analysis Attacks via Stochastic Anonymous Routing

Network-on-chip (NoC) is widely used as an efficient communication architecture in multi-core and many-core System-on-chips (SoCs). However, the shared communication resources in an NoC platform, e.g., channels, buffers, and routers, might be used to conduct attacks compromising the security of NoC-based SoCs. Most of the proposed encryption-based protection methods in the literature require leaving some parts of the packet unencrypted to allow the routers to process/forward packets accordingly. This reveals the source/destination information of the packet to malicious routers, which can be exploited in various attacks. For the first time, we propose the idea of secure, anonymous routing with minimal hardware overhead to encrypt the entire packet while exchanging secure information over the network. We have designed and implemented a new NoC architecture that works with encrypted addresses. The proposed method can manage malicious and benign failures at NoC channels and buffers by bypassing failed components with a situation-driven stochastic path diversification approach. Hardware evaluations show that the proposed security solution combats the security threats at the affordable cost of 1.5% area and 20% power overheads chip-wide.

Cracking the Anonymous IoT Routing Networks: A Deep Learning Approach

In recent years, IoT technology has been one of the most rapidly expanding fields, connecting over 27 billion connected devices worldwide. Increasing security concerns, such as software flaws and cyberattacks, limit the use of IoT devices. Tor, also known as “The Onion Router,” is one of the most popular, secure, and widely deployed anonymous routing systems in IoT networks. Tor is based on a worldwide network of relays operated by volunteers worldwide. Tor continues to be one of the most popular and secure tools against network surveillance, traffic analysis, and information censorship due to its robust use of encryption, authentication, and routing protocols. However, ToR is not anticipated to be entirely safe. The increasing computational capabilities of adversaries threaten Tor's ability to withstand adversarial attacks and maintain anonymity. This article describes the foundation of the Tor network, how it operates, potential attacks against Tor, and the network's defense strategies. In addition, the authors present a framework for deep learning that uses bandwidth performance to identify the server's location in Tor, thereby compromising anonymity. This article examines Tor's network's current and projected future in the Internet of Things.

Towards The Development Of A Hybrid Routing Protocol For Flooding Attacks Mitigation In MANET.

Mobile Ad-Hoc Networks are infrastructure-less wireless communication technology that interconnects mobile devices such as phones, laptops, and smart devices including providing flexibility, seamless communication and mobility to all devices forming the network. MANET suffers security lapses due to the absence of central control infrastructure to monitor and control the devices that joins the network. These security lapses in MANET discourage it and makes it vulnerable to attacks such as denial of service attacks. Amongst various attacks prevalent on MANET environment, packet flooding is a common attack and causes a devastating effect on MANET nodes which if left undetected may lead to consequent crashing of the entire network. There is need to secure data and be kept confidential. In this paper, the separation of trusted nodes from malicious nodes and to protect the data packet from attackers is to be taken as research goal. Therefore, a highly secured Hybrid Trust-based Anonymous Authenticated Routing Protocol (HTBAARP) to mitigate flooding attacks is to be developed to avoid unauthorized access and to detect malicious nodes. This will be achieved by integrating a Modified Authenticated Anonymous Routing Protocol (MAASR) to a Trusted Management Scheme (TMS). Simulation will be done using NS-2 in conjunction with MATLAB R2020a to evaluate performance. The proposed solution is expected to improve throughput, packet delivery ratio and, reduces routing delay and routing overhead in the network. Keywords: Anonymous, Flooding, Hybrid protocol, MANET, Malicious nodes, Routing

A Comprehensive Survey of Routing Attacks and Defense Mechanisms in MANETs

Mobile Ad Hoc NETwork (MANET) is the most desired topic of research amidst researchers mainly because of its flexibility and independent nature of network infrastructures. MANET's unique characteristics, like the dynamic behaviour related to network topology, limited bandwidth and battery resources, make routing a challenging task. Currently, several efficient routing protocols based on topology and geographical information have been proposed for MANET. However, most of them assume a trusted and cooperative oriented environment. With the influence of adversaries, the MANET routing protocols are vulnerable to various kinds of attacks. Recently, several research efforts have been made to counter these adversarial activities. This survey investigates the latest and on demand security concerns in MANET. This paper comprehensively discusses the existing attacks in the network layer, various categories of defense mechanisms in the literature, and their benefits and defects when applying to MANET. This paper also classifies the attacks and defense mechanisms based on the routing nature, such as topological and geographical. It also discusses intrusion detection systems as well as anonymous routing in MANETs. Finally, it discusses the challenges and future directions in routing security over the MANET environment.

Spatial Path Selection and Network Topology Optimisation in P2P Anonymous Routing Protocols

To anonymous internet traffic, many popular protocols route traffic through a network of nodes in order to conceal information about the request. However, routing traffic through other nodes inherently introduces added latency. Over the past two decades, there were many attempts to improve the path selection in order to decrease latency with little or no trade-off in terms of security, and anonymity. In this paper, we show the potential use of geo-sharding in decentralized routing networks to improve fault-tolerance, and latency. Such networks can be used as a communication layer for Edge devices computing huge amounts of data. Specifically, we focus our work on Low Latency Anonymous Routing Protocol (LLARP), a protocol built on top of Oxen blockchain that aims to achieve internet privacy. We analyse the existing network of Service Nodes(SN), observe cloud provider centralisation, and propose a high level protocol that provides incentives for a better geographical distribution mitigating potential cloud provider/country wide service dropouts. Additionally, the protocol level information about geographical location can be used to improve client’s path (the string of nodes that will participate in the transaction) selection, decreasing network latency. We show the feasibility of our approach by comparing it with the random path selection in a simulated environment. We observe marginal drops in average latency when selecting paths geographically closer to each other.

FarpScusn: Fully Anonymous Routing Protocol with Self-Healing Capability in Unstable Sensor Networks.

Anonymous technology is an effective way for protecting users’ privacy. Anonymity in sensor networks is to prevent the unauthorized third party from revealing the identities of the communication parties. While, in unstable wireless sensor networks, frequent topology changes often lead to route-failure in anonymous communication. To deal with the problems of anonymous route-failure in unstable sensor networks, in this paper we propose a fully anonymous routing protocol with self-healing capability in unstable sensor networks by constructing a new key agreement scheme and proposing an anonymous identity scheme. The proposed protocol maintains full anonymity of sensor nodes with the self-healing capability of anonymous routes. The results from the performance analysis show that the proposed self-healing anonymity-focused protocol achieves full anonymity of source nodes, destination nodes, and communication association.

DPHI: An improved high-speed network-layer anonymity protocol

Abstract The Internet infrastructure has not been built with security or privacy in mind. As a result, an adversary who has control over a single Autonomous System can set-up mass surveillance systems to gather meta data by passively collecting the headers of the messages they route. To solve this problem, lightweight anonymous routing protocols such as LAP, DOVETAIL and most recently PHI have been proposed which are efficient enough to be deployed in a large scale infrastructure such as the Internet. In this paper we take a closer look at PHI and introduce several de-anonymization attacks malicious nodes can perform to reduce the sender and receiver anonymity. As a direct consequence of this analysis we propose a new protocol called dependable PHI (dPHI). The security analysis of dPHI includes a detailed quantitative anonymity analysis that compares dPHI with PHI, LAP and HORNET. Together with the performance analysis, this allows for a good comparison of trade-offs for these anonymity protocols.

Increasing Base-station Anonymity through Illusive Void Formation

A wireless sensor network consists of a set of nodes connected by wireless links. These nodes probe their surroundings and send their data over multi-hop routes to a base-station (BS) for processing. The BS further interfaces the network to remote command centres. Given the critical role that the BS plays, it becomes a natural target for adversary attacks. Although cryptographic primitives and anonymous routing protocols can hide the identity of the BS, the traffic pattern in the network degrades the BS location anonymity and makes it vulnerable. In this paper, we propose an approach for formation of illusive void for increased BS anonymity (FIVA). FIVA exploits the features of geographic routing to confuse the adversary about the routing topology. Specifically, FIVA opts to construct a fake void around the BS and gets nodes to forward packets to encounter such a void. The goal is to exclude the BS from all traceable data paths in order to avert the adversary attention away from the BS vicinity. FIVA is validated through simulation and is shown to outperform prominent competing anti-traffic analysis techniques.

Secure and Anonymous Communications Over Delay Tolerant Networks

Today’s society has a fundamental need for security and anonymity. Well suited, real-life scenarios such as whistleblower reports, intelligence service operations, and the ability to communicate within oppressive governments, call for such fundamental needs. The contribution and focus of this paper is the study of anonymous communications in the context of Delay Tolerant Networks (DTNs). Current literature achieves anonymity via mechanisms that are built around the onion routing paradigm which, unfortunately, is vulnerable to malicious nodes. Instead, our work introduces a novel message forwarding algorithm that delivers messages, from source to destination, via a random walk process. As such, our protocol does not list the intermediate nodes along the route’s path and, therefore, enhances significantly the anonymity of the underlying communications. We propose two different approaches for encrypting the exchanged messages. The first one is based solely on public key cryptosystems and is, thus, suitable for short, SMS-style messaging. The second one is a hybrid solution that combines both public and symmetric key cryptography and is targeted towards large multimedia messages, such as images or video. Through extensive simulation experiments, we show that our proposed anonymous routing protocol achieves high message delivery rates, while using modest computational resources on the mobile devices.

Increasing base-station anonymity through illusive void formation

A wireless sensor network consists of a set of nodes connected by wireless links. These nodes probe their surroundings and send their data over multi-hop routes to a base-station (BS) for processing. The BS further interfaces the network to remote command centres. Given the critical role that the BS plays, it becomes a natural target for adversary attacks. Although cryptographic primitives and anonymous routing protocols can hide the identity of the BS, the traffic pattern in the network degrades the BS location anonymity and makes it vulnerable. In this paper, we propose an approach for formation of illusive void for increased BS anonymity (FIVA). FIVA exploits the features of geographic routing to confuse the adversary about the routing topology. Specifically, FIVA opts to construct a fake void around the BS and gets nodes to forward packets to encounter such a void. The goal is to exclude the BS from all traceable data paths in order to avert the adversary attention away from the BS vicinity. FIVA is validated through simulation and is shown to outperform prominent competing anti-traffic analysis techniques.

On Anonymous Routing in Delay Tolerant Networks

Due to instability of links in the network, the model of delay tolerant networks (DTNs) is often adopted in many emerging mobile applications. To organizations and individuals using these mobile applications, security and privacy are considered to be two of the most significant concerns. This research seeks to address anonymous communications in DTNs. While many different anonymous routing protocols have been proposed for ad hoc networks, to the best of our knowledge, only variants of onion-based routing have been tailored for DTNs. Since each type of anonymous routing protocol has its pros and cons, there is no single anonymous routing protocol for DTNs that can adapt to the different levels of security requirements. In this paper, we first design a set of anonymous routing protocols for DTNs, called anonymous Epidemic and zone-based anonymous routing, based on the original anonymous routing protocols for ad hoc networks. Then, we propose a framework of anonymous routing (FAR) for DTNs, which subsumes all the aforementioned protocols. By tuning its parameters, the proposed FAR is able to outperform onion-based, anonymous Epidemic, and zone-based routing. In addition, numerical analyses for the traceable rate, node anonymity, and path anonymity models are built. Extensive simulations using randomly generated graphs as well as real traces demonstrate that the proposed framework for DTNs successfully achieves its design goals.

Manets Trust Based Data Security and Secure Anonymous Routing

For express employments of the mobile ad hoc networks (MANETs) sent during opponent conditions, unidentified correspondences through data overwhelm with expectedness is goliath. A fundamental thing is to give unidentifiability and unlinkability toward the mobile center obsessions as well as their techniques. The present protocol be weak against security dangers similar to if all else fails government administrator strikes, fake routing packs ambushes otherwise denial-of-service (DoS) broad-tossing assault, transfer examination strikes as well as insider strikes. During this document we suggest another routing protocol which is an improvement of the present protocol Authenticated Anonymous Secure Routing (AASR) protocol. AASR secures the strikes and outfits adequate nonattendance of clearness with the help of get-together signature and key mixed onion routing. In this work a bound together trust the board plan has been hardened with AASR protocol in order to upgrade the routing and data security in MANETs. Beguilement consequences contain shown the adequacy of the planned protocol through enhanced execution to the degree throughput, bunch got degree, pack adversity degree and surrender when ascended out of the present ones.

Highly Anonymous Mobility-Tolerant Location-Based Onion Routing for VANETs

Vehicular ad hoc networks (VANETs) have received considerable attention in recent years. Like any other network, privacy and anonymity are a requirement in VANETs. Classic anonymous routing protocols such as onion routing algorithm are fragile in mobile networks due to frequent link breaks. In this article, we propose a novel onion-based anonymous routing protocol for highly mobile vehicular networks. It introduces the concept of location-based dynamic relay groups. In this concept, vehicles dynamically form groups around specific locations to act as cryptographic onion relays. The proposed protocol satisfies source anonymity, destination anonymity, and route anonymity features and is very scalable. Employment of pseudo-IDs further helps in keeping the real identity of vehicles anonymous. The proposed protocol can modify the chain structure on the fly and make it longer to maintain source/destination location anonymity or cut it short to maintain performance. The extensive simulations conducted based on the SUMO traffic simulator showed that the proposed protocol significantly outperforms the naive onion routing protocol in terms of delivery ratio, delay and number of retransmissions.

Vehicular Adhoc Network Based Location Routing Protocol for Secured Energy

ALERT chiefly uses irregular message routing copy to supply namelessness protection. The projected protocol provides the ALERT routing high namelessness protection, EALERT additionally dynamically partitions a network field into zones and haphazardly chooses nodes in zones as intermediate relay nodes, that Anon-traceable anonymous route. It then haphazardly chooses a node inside the choice zone as a result of subsequent relay node and uses the EGPSR formula as a variant of GPSR in awake to send the information to the relay node. Within the last step, the information is broadcasted to k nodes at intervals the destination zone, providing k-anonymity to the destination. In addition, the protocol contains a method to hide the information instigator among sort of initiators to strengthen the k-anonymity protection of the provision. The projected Energy aware ALERT detects the Sybil attack within the network, Routing protocol, geographical routing.

PARTICLE SWARM OPTIMIZATION ALGORITHM (PSO) USED FOR SECURITY ENHANCEMENT IN MANET

The Mobile ad hoc network (MANET) is become very famous due to their fixed infrastructure-less quality and dynamic nature. it contains a large number of nodes which are connected and communicated to each other in wireless nature. Mobile ad hoc network is a wireless technology that contains high mobility of nodes and does not depend on the background administrator for central authority, because it does not contain any infrastructure.MANET is frequently changing its topologies to transfer the data quickly, because nodes in this network are moving always (mobility) and data transfer has been done by finding the efficient routing path between source and destination. These types of attacks affect the MANET routing path and it hence it is necessary to secure routing. ALERT protocol is evolved which is Distinguished by its low cost due to randomized routing mechanism and anonymity protection for sources, destinations, and routes. PSO is a population based optimization technique use for finding optimum solution. PSO technique is originated from social behavior bird flocking. In PSO optimum solution is obtained from the behavior of bird. Since PSO uses for network centric localization purpose, this approach generates network navigational decisions by obviating centralized control thereby reducing both the congestion and delay.

Anonymous Location-Support and Self-Reliance Routing Protocol For Manet

Mobile Adhoc Network (MANET) is comprised of mobile nodes where each mobile node can act as of any type like starter, router and terminal. While performing node operations, a reliable routing protocol is chosen that ensures packet to reach its destination securely. therefore Anonymous Location-Support and Self reliance Routing (ALsSrR), a protocol for secure packet transmission in MANET are proposed. To keep the packets secure from adversary environment and to provide message encryption for secure data forwarding are the primary objectives of the protocol. this protocol includes anonymity protection for delivering node uniqueness which includes Modular arithmetic and Euclidean algorithm for providing node security. the MD5 algorithm is used for message encrypting and decrypting process. the performance evaluation is shown, and the efficiency is compared with both the conventional and proposed protocols.

City-Level IP Geolocation Algorithm Based on PoP Network Topology

The existing city-level IP geolocation algorithms determine the location of IP by delay measurement and landmark comparison, and thus, the geolocation ability of these algorithms is affected by the delay precision and the number of landmarks. To alleviate the dependence on these conditions, a new city-level geolocation algorithm is proposed based on the PoP network topology in this paper. First, according to the distribution of one-hop delay between network nodes in different cities, the network nodes belonging to the target city are picked out from the detection path, and the landmarks are extended. Second, common anonymous route structures are used to find and merge anonymous routes in the path information. Finally, the PoP network topology inside the city is extracted through the tightly connected network nodes, recorded into the PoP database, and used for city-level geolocation. The experiment results of 35 808 IP geolocations in 28 cities of China and the United States verify that the proposed algorithm still has good city-level geolocation ability when the delay accuracy is low or the number of landmarks is small, comparing with the existing typical IP geolocation algorithms LBG and SLG, the proposed algorithm improves the success rate of city-level geolocation from 74.86% and 94.14% to 97.67%.