Publications related to Tor (network)

Simple schedules for half-duplex networks

We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Deriving a simple approximation to the capacity of the network, we show that simple schedules having exactly two states and avoid ...

Ieee2012

Wordless Sounds: Robust Speaker Diarization using Privacy-Preserving Audio Representations

Hervé Bourlard, Daniel Gatica-Perez, Sree Hari Krishnan Parthasarathi

This paper investigates robust privacy-sensitive audio features for speaker diarization in multiparty conversations: ie., a set of audio features having low linguistic information for speaker diarization in a single and multiple distant microphone scenario ...

Idiap2012

On the Privacy of Anonymized Networks

Matthias Grossglauser, Pedram Pedarsani

The proliferation of online social networks, and the concomitant accumulation of user data, give rise to hotly debated issues of privacy, security, and control. One specific challenge is the sharing or public release of anonymized data without accidentally ...

2011

P2P Video Streaming with Inter-session Network Coding

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze, Jonnahtan Eduardo Saltarin De Arco

We present a novel receiver-driven p2p system for delivery of multiple concurrent time constrained data streams in overlay networks. We propose an effective combination of rateless coding with intra- and inter-session network coding to efficiently exploit ...

2011

Degraded two-message multicast over graphs

Christina Fragouli, Shirin Saeedi Bidokhti

In this work we consider a graph G where a common source sends two messages W1 and W2 to several receivers D1, D2, . . . , DK. The first two receivers D1 and D2 would like to receive message W1, while receivers D3, . . . , DK would like to receive both mes ...

2011

Wireless network simplification: the Gaussian N-relay diamond network

Christina Fragouli, Ayfer Özgür Aydin

We consider the Gaussian N-relay diamond net- work, where a source wants to communicate to a destination node through a layer of N-relay nodes. We investigate the following question: What fraction of the capacity can we maintain by using only k out of the ...

2011

A Note on a Privacy-Preserving Distance-Bounding Protocol

Aikaterini Mitrokotsa, Jean-Philippe Aumasson

Distance bounding protocols enable a device to establish an upper bound on the physical distance to a communication partner so as to prevent location spoofing, as exploited by relay attacks. Recently, Rasmussen and Cˇapkun (ACM-CCS’08) observed that these ...

Springer2011

Scalable Video Dissemination with Prioritized Network Coding

Pascal Frossard, Nikolaos Thomos, Eymen Kurdoglu

In this paper, we present a pull-based dissemination protocol for efficient distribution of scalable video content in overlay peer-to-peer networks with mesh structures. The proposed protocol employs prioritized network coding, where the network coded pack ...

2011

Degraded two-message multicast over graphs

Christina Fragouli, Shirin Saeedi Bidokhti

We consider communication of two degraded mes- sage sets over graphs where a common source sends two prioritized messages (a common and a private message) to several receivers. All receivers require the common message and a subset of the receivers require ...

2011

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Tor (network)

Simple schedules for half-duplex networks

Wordless Sounds: Robust Speaker Diarization using Privacy-Preserving Audio Representations

On the Privacy of Anonymized Networks

P2P Video Streaming with Inter-session Network Coding

Degraded two-message multicast over graphs

Wireless network simplification: the Gaussian N-relay diamond network

A Note on a Privacy-Preserving Distance-Bounding Protocol

Scalable Video Dissemination with Prioritized Network Coding

Degraded two-message multicast over graphs

Multi-robot olfactory search in structured environments

Graph Chatbot

Chat with Graph Search

On the Privacy of Anonymized Networks

Degraded two-message multicast over graphs

Wordless Sounds: Robust Speaker Diarization using Privacy-Preserving Audio Representations

Simple schedules for half-duplex networks

P2P Video Streaming with Inter-session Network Coding

A Note on a Privacy-Preserving Distance-Bounding Protocol

Multi-robot olfactory search in structured environments

Wireless network simplification: the Gaussian N-relay diamond network

Scalable Video Dissemination with Prioritized Network Coding

Degraded two-message multicast over graphs