Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Freenet

Publications associées (20)

Altruism, reciprocity, and tokens to reward forwarding data: Is that fair?

Verónica del Carmen Estrada Galiñanes

Decentralized storage networks offer services with intriguing possibilities to reduce inequalities in an extremely centralized market. Fair distribution of rewards, however, is still a persistent problem in the current generation of decentralized applicati ...

2024

Moby: A Blackout-Resistant Anonymity Network for Mobile Devices

Bryan Alexander Ford, Antoine Rault

Internet blackouts are challenging environments for anonymity and censorship resistance. Existing popular anonymity networks (e.g., Freenet, I2P, Tor) rely on Internet connectivity to function, making them impracticable during such blackouts. In such a set ...

2022

Smaller, Faster & Lighter KNN Graph Constructions

Rachid Guerraoui, Anne-Marie Kermarrec

We propose GoldFinger, a new compact and fast-to-compute binary representation of datasets to approximate Jaccard’s index. We illustrate the effectiveness of GoldFinger on the emblematic big data problem of K-Nearest-Neighbor (KNN) graph construction and s ...

2020

Systems and method for anonymous, low-latencey, tracking-resistant communications in a networked environment

Jean-Pierre Hubaux, Bryan Alexander Ford, Ludovic Barman, Italo Ivan Dacosta Petrocelli

Exemplary embodiments of the present disclosure provide cryptographically-strong tracking protection with unnoticeable "single-hop" network latencies by leveraging a client-relay- server architecture, in which the clients, relays (trusted or untrusted), an ...

2018

Formal Analysis of Distance Bounding with Secure Hardware

Serge Vaudenay, Handan Kilinç Alper

A distance bounding (DB) protocol is a two-party authentication protocol between a prover and a verifier which is based on the distance between the prover and the verifier. It aims to defeat threats by malicious provers who try to convince that they are cl ...

2018

Trustworthy Cloud Storage

Maxime Augier

The Cloud trend is an attempt to leverage economics of scale in the domain of computing resources. Unfortunately, this often means losing control of the lower levels of a computer system, and exposing users to new threat vectors. These threats may be signi ...

EPFL2016

Mitigating Anonymity Challenges in Automated Testing and Debugging Systems

George Candea, Silviu Andrica

Modern software often provides automated testing and bug reporting facilities that enable developers to improve the software after release. Alas, this comes at the cost of user anonymity: reported execution traces may identify users. We present a way to mi ...

2013

Trust-aware peer sampling: Performance and privacy tradeoffs

Anne-Marie Kermarrec, Julien Michel Stainer

The ability to identify people that share one's own interests is one of the most interesting promises of the Web 2.0 driving user-centric applications such as recommendation systems or collaborative marketplaces. To be truly useful, however, information ab ...

Elsevier Science Bv2013

Dissent in Numbers: Making Strong Anonymity Scale

Bryan Alexander Ford, Henry Nathaniel Corrigan-Gibbs

Current anonymous communication systems make a trade-off between weak anonymity among many nodes, via onion routing, and strong anonymity among few nodes, via DC-nets. We develop novel techniques in Dissent, a practical group anonymity system, to increase ...

2012

Network coding node placement for delay minimization in streaming overlays

Pascal Frossard, Nikolaos Thomos

Network coding has been proposed recently as an efficient method to increase network throughput by allowing network nodes to combine packets instead of simply forwarding them. However, packet combinations in the network may increase delay, complexity and e ...

2010

Scalable Peer-to-Peer Web Retrieval with Highly Discriminative Keys

Karl Aberer, Martin Rajman, Vinh Toan Luu, Fabius Klemm

The suitability of peer-to-peer (P2P) approaches for full-text Web retrieval has recently been questioned because of the claimed unacceptable bandwidth consumption induced by retrieval from very large document collections. In this contribution we formalize ...

IEEE2007

Query-load balancing in structured overlays

Karl Aberer, Anwitaman Datta

Query-load (forwarding and answering) balancing in structured overlays is one of the most critical and least studied problems. It has been assumed that caching heuristics can take care of it. We expose that caching, while necessary, is not in itself suffic ...

2007

Message Passing in Semantic Peer-to-Peer Overlay Networks

Karl Aberer, Philippe Cudré-Mauroux

Peer-to-Peer (P2P) systems rely on machine-to-machine ad-hoc communications to offer services to a community. Contrary to the classical client-server architecture, P2P systems consider all peers, i.e., all nodes participating in the network, as being equal ...

2007

Efficient Distributed Subtyping Tests

Rachid Guerraoui, Patrick Eugster

Subtyping tests are essential in typed publish/subscribe infrastructures, especially when the underlying programming language supports subtype conformance, as in Java or C#. These tests are particularly challenging when the publish/subscribe infrastructure ...

2007

Emergent semantics : rethinking interoperability for large scale decentralized information systems

Philippe Cudré-Mauroux

In the past, the problem of semantic interoperability in information systems was mostly solved by means of centralization, both at a system and at a logical level. This approach has been successful to a certain extent, but offers limited scalability and fl ...

EPFL2007

Peer-to-Peer Applications Beyond File Sharing: Overlay Network Requirements and Solutions

In this paper we analyze the functional and non-functional requirements of peer-to-peer (P2P) systems that go beyond the needs of the well explored file-sharing P2P systems. Four basic subcategories are suggested to classify the non-functional requirements ...

2006

Self-organizing structured peer-to-peer overlay networks

A peer-to-peer overlay network is a logical network, built on top of a physical network. In contrast to classical client-server distributed architectures, peer-to-peer overlay networks allow location of resources without centralized control. Existing overl ...

EPFL2006

SoS: self-organizing substrates

Anwitaman Datta

Large-scale networked systems often, both by design or chance exhibit self-organizing properties. Understanding self-organization using tools from cybernetics, particularly modeling them as Markov processes is a first step towards a formal framework which ...

EPFL2006

Semantic Overlay Networks

Karl Aberer, Philippe Cudré-Mauroux

In a handful of years only, Peer-to-Peer (P2P) systems have become an integral part of the Internet. After a few key successes related to music-sharing (e.g., Napster or Gnutella), they rapidly developed and are nowadays firmly established in various conte ...

2005

Denial-of-service resilience in peer-to-peer file sharing systems

Willy Zwaenepoel, Dan Mihai Dumitriu

Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. These properties alone are not sufficient, however, to render p2p networks immun ...

2005