-
Formalising the Optimised Link State Routing Protocol
Routing protocol specifications are traditionally written in plain Engli...
read it
-
Formal Models of the OSPF Routing Protocol
We present three formal models of the OSPF routing protocol. The first t...
read it
-
ACR: a cluster-based routing protocol for VANET
Clustering is a technique used in network routing to enhance the perform...
read it
-
HELPER: Heterogeneous Efficient Low Power Radio for Enabling Ad Hoc Emergency Public Safety Networks
Natural and man-made disasters have been causing destruction and distres...
read it
-
Coordinator Location Effects in AODV Routing Protocol in ZigBee Mesh Network
ZigBee mesh network is very important research field in computer network...
read it
-
Spores: Stateless Predictive Onion Routing for E-Squads
Mass surveillance of the population by state agencies and corporate part...
read it
-
Towards a Methodology for the Development of Routing Algorithms in Opportunistic Networks
This paper introduces a methodology for the development of routing algor...
read it
On the Complexity of Anonymous Communication Through Public Networks
Anonymous channels allow users to connect to websites or communicate with one another privately. Assume that either Alice or Allison is communicating with (a possibly corrupt) Bob. To protect the sender, we seek a protocol that provably guarantees that these two scenarios are indistinguishable to an adversary that can monitor the traffic on all channels of the network and control the internal operations in a constant fraction of the nodes. Onion routing is the method of choice for achieving anonymous communication, used for example by Tor. In an onion routing protocol, messages travel through several intermediaries before arriving at their destinations; they are wrapped in layers of encryption (hence they are called "onions"). In this paper, we give the first rigorous characterization of the complexity of onion routing protocols for anonymous communication through public networks. We show that in order to provide anonymity, an onion routing scheme requires each participant to transmit, on average, a superlogarithmic number of onions. We match these negative results with a protocol in which every participant creates a polylogarithmic number of onions and participates in a polylogarithmic number of transmissions.
READ FULL TEXT
Comments
There are no comments yet.