Max Inden 9dd2d662e9

protocols/kad: Implement S-Kademlia's lookup over disjoint paths v2 (#1473) ...

The extension paper S-Kademlia includes a proposal for lookups over
disjoint paths. Within vanilla Kademlia, queries keep track of the
closest nodes in a single bucket. Any adversary along the path can thus
influence all future paths, in case they can come up with the
next-closest (not overall closest) hops. S-Kademlia tries to solve the
attack above by querying over disjoint paths using multiple buckets.

To adjust the libp2p Kademlia implementation accordingly this change-set
introduces an additional peers iterator: `ClosestDisjointPeersIter`.
This new iterator wraps around a set of `ClosestPeersIter`
`ClosestDisjointPeersIter` enforces that each of the `ClosestPeersIter`
explore disjoint paths by having each peer instantly return that was
queried by a different iterator before.

2020-06-19 12:22:26 +02:00

..

chat.rs

Simplify trait bounds on NetworkBehaviour (#1405)

2020-02-07 16:29:30 +01:00

distributed-key-value-store.rs

protocols/kad: Implement S-Kademlia's lookup over disjoint paths v2 (#1473)

2020-06-19 12:22:26 +02:00

gossipsub-chat.rs

Update gossipsub-chat example docstring (#1419)

2020-02-04 11:45:06 +01:00

ipfs-kad.rs

More insight into Kademlia queries. (#1567)

2020-05-16 10:43:09 +02:00

ipfs-private.rs

Ipfs private swarms interop example (#1420)

2020-02-10 18:35:51 +01:00

mdns-passive-discovery.rs

misc/mdns: Make MdnsService::new sync by using std::net::UdpSocket::bind (#1382)

2020-01-15 13:43:09 +01:00

ping.rs

Fix examples and update core-derive. (#1317)

2019-11-25 10:45:04 +01:00