Directly extracting the exact 'd' closest peers from the routing table for Kademlia DHT disjoint paths leaves the lookup vulnerable to Sybil/Eclipse attacks. If an attacker controls the 'd' closest node IDs, they will intercept and control all query paths. Fix this by retrieving a wider pool of closest peers (e.g., `kBucketSize`) and drawing from it probabil
Explore
Rule Explorer
Search the public rule index by CVE, GHSA, CWE, language, framework, author, or rule slug. Filter by language, framework, severity, confidence, license, and validation status.
- Public rules
- 2917
- Downloads
- 3.3M
- Verified
- 2917
- Authors
- 2
Search the rule indexUse CVE, GHSA, CWE, language, framework, package, or rule slug.
CVE-2026-45783: Kademlia Dht Sybil Predictable Pathscve-2026-45783-kademlia-dht-sybil-predictable-paths
CVE-2026-45783: Kad Dht Eclipse Vulnerabilitycve-2026-45783-kad-dht-eclipse-vulnerability
Starting a DHT lookup by selecting exactly the `d` (`disjointPaths`) closest peers from the routing table makes the network vulnerable to an eclipse attack (CVE-2026-45783). An attacker controlling the `d` closest nodes will compromise all disjoint lookup paths. Instead, fetch up to a larger threshold (e.g., `kBucketSize`) of closest peers and randomly parti
All matching rules loaded.