Publications de Christina Fragouli

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Group testing is a technique that can reduce the number of tests needed to identify infected members in a population, by pooling together multiple diagnostic samples. Despite the variety and importance of prior results, traditional work on group testing ha ...

This paper contributes to the design and analysis of Quantize-Map-and-Forward (QMF) relaying by optimizing its performance for small relay networks. QMF was proved to achieve the capacity of arbitrary networks within a bounded gap, as well as the optimal d ...

The performance of peer-to-peer (P2P) networks depends critically on the good connectivity of the overlay topology. In this paper we study P2P networks for content distribution (such as Avalanche) that use randomized network coding techniques. The basic id ...

The placement of replicas across storage nodes in a replication-based storage system is known to affect rebuild times and therefore system reliability. Earlier work has shown that, for a replication factor of two, the reliability is essentially unaffected ...

We consider the problem of broadcasting in an ad hoc wireless network, where all nodes of the network are sources that want to transmit information to all other nodes. Our figure of merit is energy efficiency, a critical design parameter for wireless net- ...

We consider Gaussian diamond networks with n half-duplex relays. At any point of time, a relay can either be in a listening (L) or transmitting (T) state. The capacity of such networks can be approximated to within a constant gap (independent of channel SN ...

We present protocols for creating pairwise secrets between nodes in a wireless network, so that these secrets are secure from an eavesdropper, Eve, with unbounded computational and memory capabilities, but with limited network presence. We first present a ...

We consider communication through a cascade of discrete memoryless channels (DMCs). The source and destination node of this cascade are allowed to use coding schemes of arbi- trary complexity, but the intermediate relay nodes are restricted to process only ...

In this paper, we combine network coding and tomographic techniques for topology inference. Our goal is to infer the topology of a network by sending probes between a given set of multiple sources and multiple receivers and by having intermediate nodes per ...

The famous min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the flow of the min-cut separating the source and the sink. Recently it has been shown that by linear re-encoding ...

We characterize the secret message capacity of the triangle network, that consists of a source, a relay and a destination connected through orthogonal erasure channels. A passive eavesdropper, Eve, wiretaps any one of the three channels. The source and the ...

Quantize-Map-and-Forward (QMF) relaying has been shown to achieve the optimal diversity-multiplexing trade-off (DMT) for the slow fading single-antenna relay channel, regardless of whether the relay is full-duplex or half-duplex. A key reason for the DMT o ...

We consider a source that would like to communicate with a destination over a layered Gaussian relay network. We present a computationally efficient method that enables to select a near-optimal (in terms of throughput) subnetwork of a given size connecting ...

We consider the problem of finding the minimum number of transmissions in an ad-hoc network for all-to-all broadcasting using network coding. This work generalizes previous results for canonical topologies such as the circle and the wrap around grid to the ...

Network tomography aims at inferring internal network characteristics based on measurements at the edge of the network. In loss tomography, in particular, the characteristic of interest is the loss rate of individual links. There is a signiﬁcant body of wo ...

Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary ca ...

We consider the scenario where a group of wireless nodes want to exchange a secret key, such that no eavesdropper can guess the key. Today, this can be achieved using publickey cryptography, e.g., the Diffie-Hellman or the RSA keyexchange algorithms. Howev ...

We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian N-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset uppe ...

End-to-end active network monitoring infers network characteristics by sending and collecting probe packets from the network edge, while probes traverse the network through multicast trees or a mesh of unicast paths. Most reported methods consider given so ...

We investigate the problem of exchanging a se- cret key within a group of wireless devices. In particular, we are interested in information theoretically secure key exchange schemes that enable honest nodes of a multi-hop network to establish a secret grou ...

Christina Fragouli

Chattez avec Graph Search

Community-Aware Group Testing

Cooperative Relaying at Finite SNR-Role of Quantize-Map-and-Forward

Bottleneck Discovery and Overlay Management in Network Coded Peer-to-Peer Systems

Reliability of clustered vs. declustered replica placement in data storage systems

Efficient Broadcasting Using Network Coding

Structure of optimal schedules in diamond networks

Creating Secrets Out Of Packet Erasures

On capacity of line networks

Multiple source multiple destination topology inference using network coding

Information Flow Decomposition for Network Coding

Triangle Network Secrecy

Optimizing Quantize-Map-and-Forward in Slow Fading Relay Networks

Efficient Subnetwork Selection in Relay Networks

Network-Coded Broadcast: from Canonical Networks to Random Topologies

A Network Coding Approach to Network Tomography

Creating Secrets out of Erasures

Erased Secrets: Practical Information-Theoretic Group Secrecy

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Network Monitoring: it depends on your points of view

Secure key exchange in wireless networks