What is the latest status of addressing the "Pitch Black" attack described here: http://grothoff.org/christian/pitchblack.pdf ?
I understand that the basic idea is to counteract the clustering by periodically randomizing node locations, and Oskar's refinement to this is to pick a key randomly, route for it with a special query that returns the nearest node identifier to the key found. If the closest you can get is much further than your distance to your neighbors, give up your current position for the random one. Is this the latest thinking on this? There was talk of working on a paper which describes this solution and validates it. Is anyone doing this? Is anyone interested in doing this? Unfortunately at the moment the attack remains unanswered in the academic literature, and it has already caused at least one of our papers to be rejected. Ian. -- Ian Clarke Founder, The Freenet Project Email: i...@freenetproject.org _______________________________________________ Devl mailing list Devl@freenetproject.org http://freenetproject.org/cgi-bin/mailman/listinfo/devl
