4 ms·

Not a crypto, DHT, or any expert, but this sounds interesting very to me. It definitely sounds like there are some potential security concerns with DHT: https:

Not a crypto, DHT, or any expert, but this sounds interesting very to me. It definitely sounds like there are some potential security concerns with DHT: https://en.wikipedia.org/wiki/Distributed_hash_table#Security https://en.wikipedia.org/wiki/Distributed_hash_table#Securit... A new implementation called Tonika is mentioned that sounds promising to defend against the sybil attack but I don't see much activity on the project post-2012. As you mentioned, nodeID becomes the URI (You can CNAME a domain to that) and protects from node spoofing, but it seems like a if someone could affect the DHT, they could cause a DOS. I supposed that'd be analagous to BGP spoofing routes? If the only way to falsely modify the DHT is a mount a sybil attack (I have no idea), then it could actually be an improvement over the current state with BGP. The other concern of course, is if the DHT implementation is intergalactic-internet scale.

auxten 8y ago
I refer to S/Kademlia's idea to define the number of consecutive 0s in front of the NodeID as difficulty and to impose a minimum limit on the difficulty of the NodeID allowed to be stored on the DHT. As the S/Kademlia paper said, they just use the PoW NodeID way to obviate Eclipse Attack(Make Kademlia Network Fork), Sybil Attack(Fake Nodes), Churn Attack(Frequently Join & Leave), Adversarial Routing(Spread Bad Route). Adversarial Routing is a bit related to DOS Attack you described. As the DHT is a gossip protocol organized network, maybe some Peer Rating stuff with PoW NodeId will work out an intergalactic-internet scale DHT. Just a well behaved proper difficulty NodeID will be trusted to spread more NodeID routing info.
- dustindecker 8y ago
  Okay, I'll do a bit more reading on it. I found the paper you referenced here: http://www.spovnet.de/files/publications/SKademlia2007.pdf http://www.spovnet.de/files/publications/SKademlia2007.pdf Also found your overview here: https://github.com/CovenantSQL/research/wiki/Secure-Kademlia https://github.com/CovenantSQL/research/wiki/Secure-Kademlia Thanks for sharing.

auxten 8y ago

I refer to S/Kademlia's idea to define the number of consecutive 0s in front of the NodeID as difficulty and to impose a minimum limit on the difficulty of the NodeID allowed to be stored on the DHT. As the S/Kademlia paper said, they just use the PoW NodeID way to obviate Eclipse Attack(Make Kademlia Network Fork), Sybil Attack(Fake Nodes), Churn Attack(Frequently Join & Leave), Adversarial Routing(Spread Bad Route). Adversarial Routing is a bit related to DOS Attack you described. As the DHT is a gossip protocol organized network, maybe some Peer Rating stuff with PoW NodeId will work out an intergalactic-internet scale DHT. Just a well behaved proper difficulty NodeID will be trusted to spread more NodeID routing info.

dustindecker 8y ago
Okay, I'll do a bit more reading on it. I found the paper you referenced here: http://www.spovnet.de/files/publications/SKademlia2007.pdf http://www.spovnet.de/files/publications/SKademlia2007.pdf Also found your overview here: https://github.com/CovenantSQL/research/wiki/Secure-Kademlia https://github.com/CovenantSQL/research/wiki/Secure-Kademlia Thanks for sharing.