Ian, I've actually made a commitment to do this and will have to complete this task to graduate from college ;)
That means I'll be done before May and will start in about 2 weeks. Of course I can start sooner than that, but something else is gripping my attention at the moment. Mike On Dec 25, 2011 3:21 AM, "Ian Clarke" <ian at freenetproject.org> wrote: > 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: ian at freenetproject.org > _______________________________________________ > Devl mailing list > Devl at freenetproject.org > http://freenetproject.org/cgi-bin/mailman/listinfo/devl > -------------- next part -------------- An HTML attachment was scrubbed... URL: <https://emu.freenetproject.org/pipermail/devl/attachments/20111225/04a481ef/attachment.html>
