Topology hiding routing based on learning with errors

Abstract

The protocol of onion routing constitutes the underpinning of Onion Routing network for anonymous communication. However, since the main idea behind such protocol is to hierarchically peel the IP head and decode each crypted routing address, the topology with regards to path length or long-term direction cannot be preserved. Owing to topology exposure, lots of attacks such as denial of service and differential flow analysis can be effectively conducted to violate the security of it. Moreover, considering that the path should be constructed by a sender in advance, onion routing is infeasible to be transplanted to ad hoc networks, let alone other defects such as heavy burden about computational complexity and package length. In this paper, a topology-hiding routing protocol is proposed to address most of the aforementioned problems recurring to homomorphic learning with errors. Security analysis illustrated that nothing but only the IPs of adjacent hops will be revealed to any router. Also the computational complexity on sender side as well as the package length outperforms those of traditional onion routing algorithm in view of comparative simulation. K E Y W O R D Slearning with errors, the onion routing, topology hiding onion routing INTRODUCTIONWithin the open and synergic environment of network, routing is undoubtedly the core for all its functionalities. Based on Dijkstra's algorithm, any package can be delivered to its destination through a shortest transmission path. Though plain routing is simple and efficient, it is vulnerable toward privacy infringement and various active attacks. For example, if the source and destination addresses are exposed to an adversary, he is not only capable of learning the relationship between the communication parties but may also locate their current position. In order to preserve the privacy related to IP addresses, an anonymous communication network named the Onion Routing (TOR) was first established by the U.S. NavalResearch Laboratory in the mid-1990s. 1 Aiming at concealing the start and the end addresses of communication to accomplish anonymity, TOR is realized via multilayer encryption manifested as an onion structure. Formally speaking, the idea behind TOR can be described as the following steps.1. The sender determines the route to the destination, presented as a sequencewhere R i stands for the IP address of intermediate routers. Then it encapsulates this route as R2 | R3 | … | Rn | D according a predefined public cryptosystem E PK (⋅) for Ri+1 = E PK i (R i+1 )and D = E PK n (D). As part of the IP package this information will be transmitted to the first router R 1 .2. Assuming that a router R i has received a message containing)to be aware of the next IP and relay the package till it arrives at the destination D.Although TOR is widely used to prevent messages from tracing in nowadays, a lot of defects such as timing analysis and exit node vulnerability remains unsolved. Besides, we argue some other weaknesses which may jeopardize its implementation and security as...

Retracted: VR Technology and the Theoretical Model and Method of Road Network Traffic State Information Accident Prediction and Perception under the Environment of Internet of Vehicles

“…(1) Traffic image analysis. Static road network data (GIS data), also known as electronic maps and digital maps in road traffic state calculations, reflects the topology of urban road networks and is the main research object in road traffic state calculations [32]. An excellent road network data set must meet the characteristics of a clear topological relationship, simple data compilation, and flexible and convenient information query.…”

Virtual Reality Technology of Multi UAVEarthquake Disaster Path Optimization

“…(1) Environment modeling: according to the distribution and size of obstacles in the electronic chart, the corresponding convex surface is defined, and the autonomous navigation environment model of the unmanned ship is established by link graph method and network topology diagram (link graph) [29]. (2) Initial path planning: use the Dijkstra algorithm to search the link graph from the starting point to the destination, and prepare the initial optimal path by the punctuation method, which is used for the path optimization of hybrid particle swarm optimization algorithm [30].…”

Multi-Target Tracking and Detection Based on Hybrid Filter Algorithm

“…Through statistical analysis, the network data can be obtained as follows: In a 50×50×50 area, 1000 sensor nodes are evenly arranged, the sensing radius between the nodes is 5, and the communication radius is 10. At the same time, suppose that a target with an energy of 1000 moves in a straight line at a speed of 6m per second, enters from the point (4,60,50), and leaves the area from the point (30,2,20). Other parameters are shown in Table 1.…”