geektoni/whanau-sybil-proof-dht

Implementation of Whanau, a Sybil-proof Distributed Hash Table, using Peersim.

whanau-sybil-proof-dht's Issues

Check efficacy of cluster attack

Implement an Observer that extracts the distribution of the keys in the different layers, in order to assert whether the current implementation of the clustering attack is actually effective and realistic.

List of experiments which needs to be done

This is the list of experiments which needs to be done in order to evaluate the algorithm:

Number of Lookup messages used decreases as table size increase (we assume to use just 3 layers)
(Table size, number of nodes, percentage attack edges)

• (10, 10000, 0.01)
• (50, 10000, 0.01)
• (100, 10000, 0.01)
• (500, 10000, 0.01)
• (1000, 10000, 0.01)
• (2000, 10000, 0.01)
• (10, 10000, 0.1)
• (50, 10000, 0.1)
• (100, 10000, 0.1)
• (500, 10000, 0.1)
• (1000, 10000, 0.1)
• (2000, 10000, 0.1)
• (10, 10000, 0.15)
• (50, 10000, 0.15)
• (100, 10000, 0.15)
• (500, 10000, 0.15)
• (1000, 10000, 0.15)
• (2000, 10000, 0.15)

Number of lookup message used varying the percentage of attack edges (we assume to just use 3 layers and to fix the tables size to the optimal value for the network)
(Percentage of attack edges, table size, network size)

• 0.0, 100, 10000
• 0.01, 100, 10000
• 0.1, 100, 10000
• 0.15, 100, 10000
• 0.20, 100, 10000
• 0.25, 100, 10000
• 0.0, 320, 100000
• 0.01, 320, 100000
• 0.10, 320, 100000
• 0.15, 320, 100000
• 0.20, 320, 100000
• 0.25, 320, 100000

Number of lookup message is constant if there is no attack (the number of layers is fixed to 3)
(Network size, table size)

• 5000, 70
• 10000, 100
• 100000, 320
• 200000, 447

Number of layer improves quality
(attack edges, table size, network size, layer size)

• 0.0, 100, 10000, 1
• 0.1, 100, 10000, 1
• 0.15, 100, 10000, 1
• 0.20, 100, 10000, 1
• 0.25, 100, 10000, 1
• 0.0, 100, 10000, 5
• 0.1, 100, 10000, 5
• 0.15, 100, 10000, 5
• 0.20, 100, 10000, 5
• 0.25, 100, 10000, 5
• 0.0, 100, 10000, 7
• 0.1, 100, 10000, 7
• 0.15, 100, 10000, 7
• 0.20, 100, 10000, 7
• 0.25, 100, 10000, 7

Fix the usage of LookupResult

Now there's only one integer accumulating the number of tries and the number of messages sent around. Doesn't it make sense to insert a new counter?
NOTE: the writer on file needs the counter of tries to be 'clean' in order to work properly

Should I fix it?

Build Network Topology from a Real Social Network Graph.

Should sybil nodes forward query messages?

I think that sybil nodes should just make the query fail, simulating a 'missing_key' error in the query.
As written in the paper (end of paragraph 5.1)

Then, honest nodes might have to send many useless query messages to Sybil nodes before eventually querying an honest node

To implement this we should tweak the function randomWalk() in order to stop the walk when a sybil node is encountered. Right now, sybil nodes just don't reply if they are asked for the value, but I think is a behaviour too gentle and not realistic

Implement whanau's lookup() procedure.

Change from Watts–Strogatz to Barabási–Albert model.

This will enable us to generate more realistic social network datasets.

Improve WhanauLookup in order to record some metrics.

The WhanauLookup control needs to be updated in order to record certain parameters for each
execution. It should be able to:

• Log how many times lookup() had to retry in order to find a key;

Issue with show_keys.py

@andreazampieri When I try to run it using python3 I get this message:

Traceback (most recent call last):
  File "show_keys.py", line 52, in <module>
    mng.window.showMaximized()
  File "/usr/lib/python3.5/tkinter/__init__.py", line 1952, in __getattr__
    return getattr(self.tk, attr)
AttributeError: '_tkinter.tkapp' object has no attribute 'showMaximized'

Apparently, it seems to be a problem related to the backend used to show the plot. See this answer
on Stackoverflow for a solution. https://stackoverflow.com/questions/12439588/how-to-maximize-a-plt-show-window-using-python/22418354#22418354

Build Control that turns some nodes into Sybils.

Sybil node should be able to:

• Given a key, they have to select their ids of a layer all around that key (clustering attack);
• When asked for a value, they will answer null by design;

Keys are not circular.