Jump to content

Friend-to-friend

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by GreenC bot (talk | contribs) at 02:05, 12 May 2023 (Rescued 1 archive link; reformat 1 link. Wayback Medic 2.5). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A friend-to-friend (or F2F) computer network is a type of peer-to-peer network in which users only make direct connections with people they know. Passwords or digital signatures can be used for authentication.

Unlike other kinds of private P2P, users in a friend-to-friend network cannot find out who else is participating beyond their own circle of friends, so F2F networks can grow in size without compromising their users' anonymity. Retroshare, WASTE, GNUnet, Freenet and OneSwarm are examples of software that can be used to build F2F networks, though RetroShare is the only one of these configured for friend-to-friend operation by default.

Many F2F networks support indirect anonymous or pseudonymous communication between users who do not know or trust one another. For example, a node in a friend-to-friend overlay can automatically forward a file (or a request for a file) anonymously between two friends, without telling either of them the other's name or IP address. These friends can in turn automatically forward the same file (or request) to their own friends, and so on.

Dan Bricklin coined the term "friend-to-friend network" in 2000.[1]

Potential applications of F2F

  • The Bouillon project uses a friend-to-friend network to assign trust ratings to messages.[2]

See also

References

  1. ^ D. Bricklin. Friend-to-friend Networks. Archived 2004-12-05 at the Wayback Machine August 11, 2000.
  2. ^ Grishchenko, Victor (2007). "Bouillon: A Wiki-Wiki Social Web". In Diekert, Volker; Volkov, Mikhail V.; Voronkov, Andrei (eds.). Computer Science – Theory and Applications. Lecture Notes in Computer Science. Vol. 4649. Berlin, Heidelberg: Springer. pp. 139–145. doi:10.1007/978-3-540-74510-5_16. ISBN 978-3-540-74510-5.