Changes between Version 68 and Version 69 of NetDB/NextBackend


Ignore:
Timestamp:
Jun 4, 2013 8:13:38 AM (6 years ago)
Author:
hottuna
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • NetDB/NextBackend

    v68 v69  
    7979Kademlia is preferable to !Chord/Pastry due to being as fast or faster and more resilient against Eclipse attacks.
    8080
    81 UCSB !FloodFill-takeover attack is fixed by making everyone a node.
     81UCSB !FloodFill-takeover attack is fixed by making everyone a node [9].
    8282
    8383Eclipse attacks can be somewhat relieved by aggressive STORE replication factors and Random Recursive lookups.
     
    160160
    161161== ''Key''-rotation ==
    162 ''Key''-rotation might be an interesting idea in the form of hash(dest+low_res_timestamp). It may help out against eclipse attacks if the results of the (unpublished) UCSB paper holds up. This will have to verified before any implementation of it is meaningful.
     162''Key''-rotation might be an interesting idea in the form of hash(dest+low_res_timestamp). It may help out against eclipse attacks if the results of the UCSB paper [9] holds up. This will have to verified before any implementation of it is meaningful.
    163163
    164164It is only interesting if the time it takes for malicious Eclipse-nodes to integrate into the DHT is significant.
    165165nodes_needed_for_eclipse = (60/key_rot_interval)*eclipse_integration_time*attackers_per_eclipse[[BR]]
    166 nodes_needed_for_eclipse = (60/10)*24*20 = 2880. A key rotation interval of 10 minutes is chosen, the time it takes to integrate a new malicious node into the DHT is guessed to be 24hrs and finally 20 attackers per destination is what was used in the UCSB paper to Eclipse a ''key''.[[BR]]
     166nodes_needed_for_eclipse = (60/10)*24*20 = 2880. A key rotation interval of 10 minutes is chosen, the time it takes to integrate a new malicious node into the DHT is guessed to be 24hrs and finally 20 attackers per destination is what was used in the UCSB paper [9] to Eclipse a ''key''.[[BR]]
    167167
    168168== How ==
     
    223223[7] Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems [http://research.microsoft.com/en-us/um/people/antr/PAST/pastry.pdf _] [[BR]]
    224224[8] Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications [http://pdos.csail.mit.edu/papers/chord:sigcomm01/chord_sigcomm.pdf _]
    225 
     225[9] Practical Attacks Against The I2P Network. By Christoph Egger. Unpublished as of 13-06-02. Accepted for RAID.
     226
     227