On Wed, Oct 15, 2003 at 06:14:21PM -0700, Martin Stone Davis wrote:<snip>
Say that over a long period of time, node A requests keys K1-K1000 from node B. K1-K100 were requested by the operator of node A, while K101-K1000 were requested by nodes connected to node A. Also, K1-K100 are all related to documents describing plans to overthrow the evil government of AAIR (it's a tropical country which depends mostly on tourism). Node B is run by (you guessed it) the AAIR. At the same time, the AAIR is running another node C, which mounts a timing attack on node A to see whether it has keys K1-K1000. Under either solution #1 or #2, node C would see that node A takes longer to find keys K101-1000 than it does to find keys K1-K100. But since the AAIR know that node A requested all of the keys, it also knows that the operator of node A requested keys K1-K100 and is trying to hide that fact.
Hrm, you could claim pcaching, if you turned on pcaching 100% of the time rather than just at 75% or whenever it gets turned on.
Wouldn't that lead to huge amounts of data not being stored on the network? Wouldn't it be terrible if everyone decided to strengthen their anonymity by lowering the threshold for pcacheing from 90% to 0%?
-Martin
_______________________________________________ Devl mailing list [EMAIL PROTECTED] http://dodo.freenetproject.org/cgi-bin/mailman/listinfo/devl
