Create an adversary that is randomly distributed in the graph and always wins if it has at least 2 nodes on an arm of a TOR tunnel. In the other cases, it cannot say anything about the message originator.
The first version of OnionRoutingAdversary was implemented. Remaining tasks:
[x] Finish debugging
[x] Write a few more tests
The implementation currently supports one encrypted channel. It is easy to enabled multiple channels but the adversary needs to be modified accordingly that could be a little tricky.
Create an adversary that is randomly distributed in the graph and always wins if it has at least 2 nodes on an arm of a TOR tunnel. In the other cases, it cannot say anything about the message originator.