> The paper > leaves open the question of Sybil resistance for multiple-hop routes in a > decentralized system.
If your users belong to a social network, SybilGuard might be interesting : http://portal.acm.org/citation.cfm?id=1159945 The idea is that Sybil users will form a big cluster of identities that trust each other while having a small number of "trust relation" with honest peers. SybilGuard detects these "attack edges" thanks to "verifiable random walks". Before accepting a peer, the "verifier" performs to a random walk while the "suspect" do the same. The walk of the verifier will, with high probability, stay in the honest region of the web of trust, hence if both walks intersect that means that the suspect is honest, with high probability. If there are several Sybil peers connected to the honest nodes by only one trust edge, then all Sybil peers' walks will have to go through this single attack edge, anyway. Therefore, the verifier detects this anomaly and considers all these peers as a single one. Hope this help, -- Pierre-Evariste Dagand _______________________________________________ p2p-hackers mailing list [email protected] http://lists.zooko.com/mailman/listinfo/p2p-hackers
