Skip to content
Category

Hash-based data structures

page 1
Tor
daemon and utilities for an anonymizing network
hash table
associates data values with key values - a lookup table
I2P
The Invisible Internet Project (I2P) is an anonymous network layer (implemented as a mix network) that allows for censorship-resistant, peer-to-peer communication. Anonymous connections are achieved by encrypting the user's traffic (by using end-to-end encryption), and sending it through a volunteer-run network of roughly 55,000 computers distributed around the world. Given the high number of possible paths the traffic can transit, a third party watching a full connection is unlikely. The software that implements this layer is called an "I2P router", and a computer running I2P is called an "I2
Gnutella
Gnutella is a peer-to-peer network protocol. Founded in 2000, it was the first decentralized peer-to-peer network of its kind, leading to other, later networks adopting the model.
InterPlanetary File System
content-addressable, peer-to-peer hypermedia distribution protocol
distributed hash table
decentralized distributed system that provides a lookup service similar to a hash table
rainbow table
precomputed table for reversing cryptographic hash functions
Bloom filter
hashing-based data structure for maintaining a set of items in limited memory, allowing false positives but no false negatives
Kademlia
<!-- see User_talk:Kinema. I User:Bpringlemeir had ask what additional material needs cited here. The entire article is a synopsis of the original paper by Maymounkov and Mazières. If people wish more references, please give a clue as to what in article does not have adequate references on the talk page.
Content addressable network
distributed, decentralized P2P infrastructure