Key-based routing (KBR) is a lookup method used in conjunction with
distributed hash table
A distributed hash table (DHT) is a Distributed computing, distributed system that provides a lookup service similar to a hash table. Key–value pairs are stored in a DHT, and any participating node (networking), node can efficiently retrieve the ...
s (DHTs) and certain other
overlay networks. While DHTs provide a method to find a host responsible for a certain piece of data, KBR provides a method to find the ''closest'' host for that data, according to some defined
metric. This may not necessarily be defined as physical distance, but rather the number of network hops.
Key-based routing networks
*
Freenet
Hyphanet (until mid-2023: Freenet) is a peer-to-peer platform for censorship-resistant, Anonymity application, anonymous communication. It uses a decentralized distributed data store to keep and deliver information, and has a suite of free soft ...
*
GNUnet
*
Kademlia
Kademlia is a distributed hash table for decentralized peer-to-peer computer networks designed by Petar Maymounkov and David Mazières in 2002. It specifies the structure of the network and the exchange of information through node (networking), no ...
*
Onion routing
Onion routing is a technique for anonymous communication over a computer network. In an onion network, messages are encapsulated in layers of encryption, analogous to the layers of an onion. The encrypted data is transmitted through a series o ...
*
Garlic routing
See also
*
Public-key cryptography
Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Each key pair consists of a public key and a corresponding private key. Key pairs are generated with cryptographic alg ...
*
Distributed Hash Table - Overlay Network
*
Anonymous P2P
References
Anonymity networks
Routing
File sharing networks
Distributed data storage
Network architecture
Cryptographic protocols
Key-based routing
{{Compu-network-stub