> How many bits from the key are required for the > "specialisation"? If this > number is not too high, it is possible that the data > could be padded in order > to generate different keys. Then when all the keys > fit a certain > specialisation (hash to values that start with the > same bits), the data can > be inserted and automatically have a reasonably > narrow specialisation. > > I suspect, however, that this wouldn't work because > the specialisation would > require rather a lot of matching bits, as this would > otherwise open the door > for rather nasty flood-type DoS attack on specific > nodes or specific parts of > the key space. Plus, if it were possible, it is > especially this type of > deliberately specialised node and it's neighbours > that would be worst > affected. Hey we just had a discussion about that: http://www.mail-archive.com/[EMAIL PROTECTED]/msg10333.html
Conclusion: Maybe such an attack is possible. The amount of work to generate the junk data is O(N*m) (nodes * specializations). It maybe that the network adapts itself to couter the attack, because more nodes will take over for that area of hash space. It makes me a little bit nervous, but it probably won't be an issue any time soon. __________________________________________________________________ Gesendet von Yahoo! Mail - http://mail.yahoo.de Logos und Klingelt�ne f�rs Handy bei http://sms.yahoo.de _______________________________________________ Devl mailing list [EMAIL PROTECTED] http://dodo.freenetproject.org/cgi-bin/mailman/listinfo/devl
