On Friday 04 January 2008 02:07, Michael Rogers wrote: > Matthew Toseland wrote: > > Well, is it possible for each node to choose which nodes it trusts and still > > be secure? Last I looked you'd get a lot of oscillation problems, statistical > > attacks (proportion of requests - correlate with how many nodes are within > > the target's horizon etc). > > Yeah, it seems like there might be cases where, given a set of exit > nodes of linkable tunnels, an attacker could narrow down the number of > initiators who would trust all those exit nodes. All the required > information is common knowledge because the neighbour lists are broadcast.
Right, even if each node has the same number of exit nodes. And then you've got the effects of nodes going down or going up on the set of exit nodes for each node. You need to have a lot of inertia here, or that'll give away a lot of information. Hence my coming up with the idea of cells. The question is, is it workable? > > Cheers, > Michael -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 189 bytes Desc: not available URL: <https://emu.freenetproject.org/pipermail/devl/attachments/20080104/4448f20f/attachment.pgp>
