Greedy Embedding, Routing and Content Addressing for Darknets

Abstract

To achieve anonymous and censorship-resistant overlay communication, darknets restrict overlay links to trusted parties. Efficient data retrieval in such a restricted topology requires a decentralized addressing scheme. We propose a greedy embedding algorithm, which is used to realize efficient routing and content addressing for darknets. The embedding guarantees success of greedy routing using compact address representations. Evaluation on trust graphs obtained from PGP's web of trust shows that our embedding enables much more efficient routing than existing dark net embeddings. Though, content addressing based on the embedding exhibits unbalanced load.