History The origin of Freenet can be traced to Ian Clarke's student project at the University of Edinburgh, which he completed as a graduation requirement in the Summer of 1999. Ian Clarke's resulting unpublished report "A distributed decentralized information storage and retrieval system" (1999) provided foundation for the seminal paper written in collaboration with other researchers, "Freenet: A Distributed Anonymous Information Storage and Retrieval System" (2001). According to CiteSeer, it became one of the most frequently cited computer science articles in 2002. The distributed data store of Freenet is used by many third-party programs and plugins to provide microblogging and media sharing, anonymous, decentralised version tracking, blogging, a generic web of trust for decentralized spam resistance, Shoeshop for using Freenet over Sneakernet, and many more. Features and user interface of the Freenet Content Network Frost
The Freenet Project - /faqAdditional information sources General / Philosophical questions Technical questions Publisher questions Contribution questions Security questions Philosophical answers What is Freenet? How is Freenet different to Tor? Freenet is a self-contained network, while Tor allows accessing the web anonymously, as well as using "hidden services" (anonymous web servers). Freenet is a distributed datastore, so once content is uploaded to Freenet, it will remain on Freenet forever, as long as it remains popular, without fear of censorship or denial of service attacks, and without needing to run your own web server and keep it online constantly. The other big difference is that Freenet has the "darknet" or Friend to Friend mode, where your Freenet node (software on your computer) only connects to the Freenet nodes run by your friends, i.e. people you know (and maybe to their friends, to speed things up). Freenet has many unsolved problems, and is still experimental. Summary: Tor (or I2P): Freenet in general:
Mix networkSimple decryption mix net. Messages are encrypted under a sequence of public keys. Each mix node removes a layer of encryption using its own private key. Mix networks are routing protocols that create hard-to-trace communications by using a chain of proxy servers known as mixes which take in messages from multiple senders, shuffle them, and send them back out in random order to the next destination (possibly another mix node). Each message is encrypted to each proxy using public key cryptography; the resulting encryption is layered like a Russian doll (except that each "doll" is of the same size) with the message as the innermost layer. How it works Participant A prepares a message for delivery to participant B by appending a random value R to the message, sealing it with the addressee's public key , appending B’s address, and then sealing the result with the mix's public key . to B. Message format To accomplish this, the sender takes the mix’s public key ( ) is discarded. . .
The Freenet Project - /indexPreuve à divulgation nulle de connaissanceUn article de Wikipédia, l'encyclopédie libre. Une preuve à divulgation nulle de connaissance est un concept utilisé en cryptologie dans le cadre de l'authentification et de l'identification. Cette expression désigne un protocole sécurisé dans lequel une entité nommée « fournisseur de preuve », prouve mathématiquement à une autre entité, le « vérificateur », qu'une proposition est vraie sans toutefois révéler une autre information que la véracité de la proposition. En pratique, ce schéma se présente souvent sous la forme d'un protocole de type « stimulation/réponse » (challenge-response). Les anglophones utilisent l'abréviation ZKIP pour Zero Knowledge Interactive proof. Propriétés[modifier | modifier le code] Trois propriétés doivent être satisfaites : Les deux premières propriétés sont les mêmes qui servent à définir un système de preuve interactive, qui est un concept plus général. Preuves calculatoires et parfaites[modifier | modifier le code] Exemple[modifier | modifier le code]
FreenetDa Wikipedia, l'enciclopedia libera. Freenet è una rete decentralizzata, creata per resistere alla censura, che sfrutta le risorse (banda passante, spazio su disco) dei suoi utenti per permettere la pubblicazione e la fruizione di qualsiasi tipo di informazione. Freenet è stata costruita pensando ad anonimato e sicurezza, non alla velocità di trasmissione. Questa caratteristica la rende poco indicata per lo scambio di file di grosse dimensioni (come filmati e file audio). Freenet è software libero distribuito con GNU General Public License; essendo scritto in Java può funzionare su Microsoft Windows, GNU/Linux, Mac OS X e su tutti i sistemi operativi dotati di Java Virtual Machine. Sebbene molte nazioni censurino le comunicazioni per motivi diversi, hanno tutte una caratteristica comune: qualcuno deve decidere cosa tagliare e cosa mantenere, cosa considerare offensivo e cosa no. All'interno di Freenet è possibile utilizzare servizi simili al Web e alle BBS. Ian Clarke et al.
Zero-Knowledge bags anonymity serviceHigh performance access to file storage Zero-Knowledge Systems' Freedom Network, an Internet privacy service that many believed would make on-line eavesdropping all but impossible, will cease to exist 22 October, the company announced Thursday. The Montreal-based privacy and security company notified its subscribers of the change in a curt support notice on the Freedom Web site. The sudden suspension may have come as a shock, but not a surprise. "I get only a few hits from ZKS, but I get only a few hits from anonymizers of any kind," said John Young, a New York City architect who operates Cryptome, a site dedicated to airing documents that deal with the world intelligence community. ZKS co-founder Austin Hill conceded that Freedom never really took off. "This was purely a business decision," Hill said. Hill declined to disclose subscriber numbers. ZKS made a huge splash in the world of privacy-aware Netizens when it announced Freedom in 1998. Product had cypherpunk credibility
HyperlinkCrowdsCrowds 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 eavesdropper (see "Crowds: Anonymity For Web Transactions"). How crowds works Each user joins a crowd of other users by registering himself at the blender which is a single server responsible for membership management. Definitions Crowds uses and defines the following terms: Sender The initiator of a message Receiver The final recipient of a message Probable Innocence The attacker is unable to have greater than 50% confidence that any node initiated the message (a node appears equally likely to have initiated the message as to not have - each user is more likely innocent than not.) Local Eavesdropper Corrupt Node The number of corrupt nodes The number of nodes ( is the number of good nodes) .