Uh oh! I have another idea for this! Another weakness with this attack is the assumption that is made about what constitutes a nearby key. Right now all nodes arrange their estimator keyspace internally in the same manner. Why? The keys are encrypted so they are essentially random and therefore they have no relationship to each other based on their content. My proposal is to randomly scramble the estimator keyspace using a function with a 1:1 mapping between the normal ordering and the new ordering scheme (I have no idea what function would be best for this). Now an attacker has no idea what key would be "near" the target key because every node would have it's own secret ordering for the estimator keyspace. Two keys may be near each other on one node but very far apart on another. Please keep in mind I'm talking about the estimator keyspace only.
----- Original Message ----- From: "Toad" <[EMAIL PROTECTED]> To: "Discussion of development issues" <[EMAIL PROTECTED]> Sent: Tuesday, October 28, 2003 5:22 PM Subject: Re: [freenet-dev] Re: Frost and Routing - solution ? I have a better attack. You are targetting a particular area of the keyspace. Request a long stream of random keys very close to the target key. They will all DNF, and reduce the pDNF in that area of each node the node routes the request to, until the estimator is so low that it tries a different node. Keep on requesting and you can effectively eliminate the node's ability to route requests in that region... I have no idea how to fight this attack :(. Anyone have any reason why it wouldn't work? -- Matthew J Toseland - [EMAIL PROTECTED] Freenet Project Official Codemonkey - http://freenetproject.org/ ICTHUS - Nothing is impossible. Our Boss says so. __________________________________ Do you Yahoo!? Exclusive Video Premiere - Britney Spears http://launch.yahoo.com/promos/britneyspears/ _______________________________________________ Devl mailing list [EMAIL PROTECTED] http://dodo.freenetproject.org/cgi-bin/mailman/listinfo/devl
