posted Jul 6,
2012 5:45 PM by Rebecca Navarre [ updated Jul 6,
2012 5:47 PM ]
|
July 6, 2012
After we received the Persea code,
Mahdi explained more attacks
such as sybil, insertion and
reflection attacks.
Persea starts with bootstrap nodes
and a basic level of security
based on a trusted network of friends
that expands only to
other nodes that must be trusted by
one node in the network.
This requirement to be invited
differentiates Persea from a regular
Kademlia network where no mechanism
checks for trusted/honest nodes.
Another level of success in Persea
that enables effecient lookups is Persea's
Replication process. Within a
network, a key/value pair is saved
in more than one location equally
spaced within the network so
if a lookup encounters an attacker
node it still leaves a chance of success
from the other nodes in the network
that also hold that key/value information.
Last week, we ran lookups of 10000
and measured the success of the lookups without
initializing the Persea system or
more complex attackers.
This week on Monday, Michael and I
were assigned parameters that would
not only enable the Persea system but
also initialize sybil attacks, and in my
simulations Node insertion and
Reflection attacks. Based on our data, we can
compare how successful our lookups
are with Persea on the defense as well as
how well it holds up against more
complex attacks.
|
No comments:
Post a Comment