distributed hash table

nodes

k/v store

scaling

routing table

XOR metric

long-lived nodes

RPC protocol

S/Kademlina

var

used by projects:

p2p libp2p attacks

Sybil Attacks - https://docs.libp2p.io/concepts/security-considerations/#sybil-attacks
- one operator spins up a large number of DHT peers with distinct identities to flood the network
- By controlling a large number of Sybil nodes (in proportion to the size of the network), a bad actor increases the probability of being in the lookup path for queries. - routing table posining - To target a specific key, they could improve their chances of being in the lookup path further by generating IDs that are “close” to the target key according the DHT’s distance metric
- Applications can guard against modification of data by:
- detect if the data has been tampered with
- signing values that are stored in the DHT
- using content addressing, where a cryptographic hash of the stored value is used as the key, as in IPFS

Eclipse attacks - uses a large number of controlled nodes - targeted at a specific peer with the goal of distorting their “view” of the network