P2PRIV
Encyclopedia
P2PRIV is a conceptual anonymous peer-to-peer overlay network
Overlay network
An overlay network is a computer network which is built on the top of another network. Nodes in the overlay can be thought of as being connected by virtual or logical links, each of which corresponds to a path, perhaps through many physical links, in the underlying network...

 introduced at Warsaw University of Technology
Warsaw University of Technology
The Warsaw University of Technology is one of the leading institutes of technology in Poland, and one of the largest in Central Europe. It employs 2,453 teaching faculty, with 357 professors . The student body numbers 36,156 , mostly full-time. There are 17 faculties covering almost all fields of...

. P2PRIV hides an initiator of communications by a parallelization of network nodes receiving or sending user data independently. This concept is contrary to other anonymity networks topologies. The anonymity networks employ a serial communication as a common basis and hide the initiator in a cascade of network nodes forwarding user data consecutively. The main advantage of P2PRIV is viewed as a possibility of providing high-speed anonymous data transfer while anonymous data can be sent directly and independently in the distributed network.

Description

P2PRIV separates anonymization from user data transport. Before sending data, signalization tokens are forwarded over classical anonymous cascades towards formation of so called cloning cascades (CC). The well-known anonymous techniques (i.e. Mix network
Mix network
Digital mixes were invented by David Chaum in 1981. Digital mixes create hard-to-trace communications by using a chain of proxy servers. Each message is encrypted to each proxy using public key cryptography; the resulting encryption is layered like a Russian doll with the message as the...

 and Crowds
Crowds
Crowds is a proposed anonymity network that gives probable innocence in the face of a large number of attackers. Crowds was designed by Michael K. Reiter and Aviel D. Rubin and defends against internal attackers and a corrupt receiver, but provides no anonymity against a global attacker or a local...

' Random walk
Random walk
A random walk, sometimes denoted RW, is a mathematical formalisation of a trajectory that consists of taking successive random steps. For example, the path traced by a molecule as it travels in a liquid or a gas, the search path of a foraging animal, the price of a fluctuating stock and the...

 algorithm) are utilized in hiding the initiator of the CC. Then, after a random interval of time, each CC member (i.e. group of clones and the true initiator) communicates directly and independently with destination nodes. A process of finding the true initiator among network nodes is hard to perform even for an adversary able to collude a significant part of overlay network.

Weaknesses

P2PRIV requires a fully distributed network with distributed information content to assure high-anonymous access to its resources. A utility of P2PRIV in client-server like services, e.g., World Wide Web
World Wide Web
The World Wide Web is a system of interlinked hypertext documents accessed via the Internet...

system, or in hybrid P2P topologies, is problematic in its current form.

External links

The source of this article is wikipedia, the free encyclopedia.  The text of this article is licensed under the GFDL.
 
x
OK