Walking Onions is a set of novel protocols and algorithms to reduce the amount of data clients must maintain in onion-routing anonymity networks from linear to constant relative to the number of relays.

In Walking Onions, clients obliviously choose random paths through the network without prior knowledge about the network’s membership or topology, yet can verify the correctness of their paths after they are constructed.

This website contains the code to measure the bandwidth cost of Walking Onions relative to an idealized version fo the Tor network, as well as scripts to measure the amoutn of data used by a real Tor client and relay. For further details, check out our papers: