Notes on Reading Private Communication Through a Network of Trusted Connections: The Dark Freenet (click for pdf)

I learned that data encryption within a Freenet (not necessarily dark) is often restricted to two types: CHKs and SSKs (6). As a basic measure against profiling and traffic analysis, documents are relegated to set sizes — 32kb for CHKs (Content Hash Key, a type of symmetric cryptographic key generation in which the data includes the means of generating the key) and 1kb for SSKs (Signed Subspace Key, i.e. ain information publisher has an asymmetric key-pair used to sign documents within a free(/dark)net subspace. Any larger documents are split up into smaller ones to maintain this size imperative. Also, as anyone who has used any type of P2P net has experienced, search functions within the network are limited, but I just learned the reason why: directories aren’t plaintext, but are (usually) MD5 hashes of locations. So, unless you know the precise location of the document or information you’re trying to access, and thus can generate the matching MD5 hash, you can’t even discover that the directory is there. Kind of like how you can’t access an .onion site unless you already know the address. This was making my brain itch a little bit, but I’m good now.

Fuzzy Logic Operations within Computerized Social Networks applied to Darknet Operations:

“Instead [of Stanley Milgram’s small-world model], we use a method which draws off the small world models of Jon Kleinberg. The routing we perform is purely greedy: at each step, the desirability of the neighbors is ordered by the proximity of their identities to the route key K (seen as floating point number between 0 and 1 with periodic boundary). The question then becomes one of trying affect the randomized assignment of identities such that this becomes an efficient way of routing. For routing to be efficient Kleinberg’s results show that certain relation between the frequency of connections of different lengths (with respect to the identities) must be present, so our goal is to, to the degree that it is possible, assign identities so that this holds. The method we have chosen for doing this is a development of that described in [“Distributed routing in small-world networks” by O. Sandberg].” (7)

Basically, the propinquity of your friend Miss X to her friend Sir Y’s node which contains the data you’re attempting to access, this proximity is systematized via a fuzzy logic operator which outputs between a range of [0,1], 0 representing no connections to the desired node, and 1 representing the desired node. Thus, an informational subgraph is overlayed onto the subgraph of the world’s social network which contains the portion of your social network connected to the darknet.

caption id=”” align=”alignleft” width=”450” caption=”Fuzzy Logic Explained!”[/caption]

Sorry for the fuzzy logic geek out…I thought it was a cool application in informational network analysis.

“In our implementation nodes …

read more