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

Concept

BitTorrent

Publications associées (22)

First Demonstration of Erbium -Doped Waveguide Amplifier Enabled Multi-Tb/s (16x1.6T) Coherent Transmission

Tobias Kippenberg, Zheru Qiu, Xinru Ji, Xi Chen

We demonstrate the first EDWA-enabled Terabit-class coherent optical communication with 1.6-Tb/s net bit rate per channel and 16 -channel WDM transmission over 81 -km fiber, proving the potential of such on-chip amplification for future coherent applicatio ...

IEEE2023

Anonymous Tokens with Stronger Metadata Bit Hiding from Algebraic MACs

Serge Vaudenay, Fatma Betül Durak

On the one hand, the web needs to be secured from malicious activities such as bots or DoS attacks; on the other hand, such needs ideally should not justify services tracking people's activities on the web. Anonymous tokens provide a nice tradeoff between ...

2023

The Universal Gossip Fighter

Rachid Guerraoui, Anne-Marie Kermarrec, Rafaël Benjamin Pinot, Anastasiia Kucherenko

The notion of adversary is a staple of distributed computing. An adversary typically models “hostile” assumptions about the underlying distributed environment, e.g., a network that can drop messages, an operating system that can delay processes or an attac ...

IEEE2022

Oracular Byzantine Reliable Broadcast

Rachid Guerraoui, Manuel José Ribeiro Vidigueira, Matteo Monti, Martina Camaioni

Byzantine Reliable Broadcast (BRB) is a fundamental distributed computing primitive, with applications ranging from notifications to asynchronous payment systems. Motivated by practical consideration, we study Client-Server Byzantine Reliable Broadcast (CS ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022

Single-server Multi-message Private Information Retrieval with Side Information: the General Cases

Michael Christoph Gastpar, Su Li

The single-server multi-message private information retrieval with side information problem is studied for general cases. In this problem, K independent messages are stored at a single server. One user initially has M messages as side information and wants ...

IEEE2020

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

Network Neutrality Inference using Network Tomography

Ovidiu Sebastian Mara

Our work studies network neutrality, a property of communication networks which means that they treat all traffic the same, regardless of application, content provider or communication protocol. This is an important problem, because sometimes users suspect ...

EPFL2018

Distributed watermarking for secure control of microgrids under replay attacks

Giancarlo Ferrari Trecate, Mustafa Sahin Turan

The problem of replay attacks in the communication network between Distributed Generation Units (DGUs) of a DC microgrid is examined. The DGUs are regulated through a hierarchical control architecture, and are networked to achieve secondary control objecti ...

Elsevier2018

Information-Theoretic Caching: The Multi-User Case

Michael Christoph Gastpar, Chien-Yi Wang, Sung Hoon Lim

In this paper, we consider a cache aided network in which each user is assumed to have individual caches, while upon users’ requests, an update message is sent through a common link to all users. First, we formulate a general information theoretic setting ...

Institute of Electrical and Electronics Engineers2017

PriFi: A Low-Latency and Tracking-Resistant Protocol for Local-Area Anonymous Communication

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

Popular anonymity mechanisms such as Tor provide low communication latency but are vulnerable to traffic analysis attacks that can de-anonymize users. Moreover, known traffic-analysis-resistant techniques such as Dissent are impractical for use in latency- ...

ACM2016

The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks

Serge Vaudenay, Aikaterini Mitrokotsa, Asli Bay, Ioana Cristina Carlson, Iosif-Daniel Spulber

The communication between an honest prover and an honest verifier can be intercepted by a malicious man-in-the-middle (MiM), without the legitimate interlocutors noticing the intrusion. The attacker can simply relay messages from one party to another, even ...

Springer2012

Signaling and Reciprocity : Robust Decentralized Information Flows in Social, Communication, and Computer Networks

Wojciech Galuba

Complex networks exist for a number of purposes. The neural, metabolic and food networks ensure our survival, while the social, economic, transportation and communication networks allow us to prosper. Independently of the purposes and particularities of th ...

EPFL2011

Effective Usage of Computational Trust Models in Rational Environments

Karl Aberer

Computational reputation-based trust models using statistical learning have been intensively studied for distributed systems where peers behave maliciously. However practical applications of such models in environments with both malicious and rational beha ...

2011

Bandwidth Adaptation in Streaming Overlays

Dejan Kostic, Nedeljko Vasic, Simon Schubert

A major challenge for real-time streaming overlays is to distribute high bit-rate streams with uninterrupted playback. Hosts usually have sufficient inbound bandwidth to support streaming, but due to the prevalence of asymmetric links in broadband networks ...

2010

Live Streaming with Gossip

Maxime Monod

Peer-to-peer (P2P) architectures have emerged as a popular paradigm to support the dynamic and scalable nature of distributed systems. This is particularly relevant today, given the tremendous increase in the intensity of information exchanged over the Int ...

EPFL2010

Theory and applications of Raptor codes

Mohammad Amin Shokrollahi

Digital media have become an integral part of modern lives. Whether surfing the web, making a wireless phone call, watching satellite TV, or listening to digital music, a large part of our professional and leisure time is filled with all things digital. Th ...

Springer-Verlag Italia, Milan, Italy2009

Concurrency and dynamic protocol update for group communication middleware

Olivier Rütti

The last three decades have seen computers invading our society: computers are now present at work to improve productivity and at home to enlarge the scope of our hobbies and to communicate. Furthermore, computers have been involved in many critical system ...

EPFL2009

How robust are gossip-based communication protocols?

Rachid Guerraoui

Gossip-based communication protocols are often touted as being robust. Not surprisingly, such a claim relies on assumptions under which gossip protocols are supposed to operate. In this paper, we discuss and in some cases expose some of these assumptions a ...

2007

UniStore: Querying a DHT-based Universal Storage

Manfred Hauswirth

The idea of collecting and combining large public data sets and services became more and more popular. The special characteristics of such systems and the requirements of the participants demand for strictly decentralized solutions. However, this comes alo ...

2007

Scalable peer-to-peer Web search using highly discriminative keys

Vinh Toan Luu

Standard general-purpose Web retrieval relies on centralized search engines that do not realistically scale when applied to the exponentially growing number of documents available on the Web. By taking advantage of the resource sharing principle, Peer-to-P ...

EPFL2007