Recherche

Afficher tous les résultats pour

Accueil

Personne

Christina Fragouli

Cette personne n’est plus à l’EPFL

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (117)

Securing Broadcast Against Dishonest Receivers

Suhas Diggavi, Christina Fragouli, László Czap, Vinod Malathidevi Prabhakaran

Consider a sender, Alice, who wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. In [1], we assumed that Bob and Calvin provide honest feedba ...

IEEE2013

System and method for cooperative data streaming

Lorenzo Keller, Christina Fragouli

A system and method for cooperative data streaming are disclosed. According to one embodiment, a system for cooperative data streaming comprises a group of devices comprising at least two devices, which are interested in obtaining the same content from the ...

2013

Real-time delay with network coding and feedback

Lorenzo Keller, Christina Fragouli

2013

Function computation via subspace coding

Lorenzo Keller, Christina Fragouli, Nikhil Karamchandani

This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for comput- ing functions, that r ...

2013

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

Christina Fragouli, Ayan Sengupta, I-Hsiang Wang

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 ...

Ieee2013

Active topology inference using network coding

Christina Fragouli

Our goal, in this paper, is to infer the topology of a network when (i) we can send probes between sources and receivers at the edge of the network and (ii) intermediate nodes can perform simple network coding operations, i.e., additions. Our key intuition ...

2013

Secure Network Coding with Erasures and Feedback

Suhas Diggavi, Christina Fragouli, László Czap, Vinod Malathidevi Prabhakaran

Secure network coding assumes that the underlying network links are lossless, thus it can be applied over lossy networks after channel error correction. Yet it is well known that channel losses, such as packet erasures, can be constructively used for secre ...

2013

SenseCode: Network Coding for Reliable Sensor Networks

Lorenzo Keller, Christina Fragouli, Aikaterini Argyraki, Emre Atsan

Designing a communication protocol for sensor networks often involves obtaining the right trade-off between energy efficiency and end-to-end packet error rate. In this article, we show that network coding provides a means to elegantly balance these two goa ...

Assoc Computing Machinery2013

Low cost security for sensor networks

Lorenzo Keller, Christina Fragouli, Emre Atsan, Iris Safaka

We design and evaluate a lightweight encryption protocol suitable for sensor networks, that enables weak security in the presence of passive eavesdroppers. At every communication round, our protocol creates a key between each sensor node and the sink, by a ...

Institute of Electrical and Electronics Engineers Inc.2013

Subspace properties of network coding and their applications

Suhas Diggavi, Christina Fragouli, Mahdi Jafari Siavoshani

Systems that employ network coding for content distribution convey to the receivers linear combinations of the source packets. If we assume randomized network coding, during this process the network nodes collect random subspaces of the space spanned by th ...

2012

Broadcasting Private Messages Securely

Suhas Diggavi, Christina Fragouli, László Czap, Vinod Malathidevi Prabhakaran

Consider a source, Alice, broadcasting private messages to multiple receivers through a broadcast erasure channel; users send back to Alice public feedback that she causally uses to decide the coding strategy for her following transmissions. Recently, the ...

IEEE2012

Towards integrating Quantize-Map-Forward relaying into LTE

Suhas Diggavi, Christina Fragouli, Emre Atsan

We present a method to integrate the Quantize-Map-Forward (QMF) relaying scheme [1] into the standard LTE operation, for a two-relay diamond network configuration. Our approach implements QMF using mainly existing LTE modules and functionalities, and resul ...

Ieee2012

Simple Relaying Strategies for Half-duplex Networks

Christina Fragouli, Ayfer Özgür Aydin, Siddhartha Brahma

We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Using simple outer bounds on the capacity of the network, we show that simple relaying strategies having exactly two states and a ...

2012

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

Christina Fragouli, Ayan Sengupta, I-Hsiang Wang

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 ...

Ieee2012

MicroCast: Cooperative Video Streaming on Smartphones

Lorenzo Keller, Christina Fragouli

Video streaming is one of the increasingly popular, as well as de- manding, applications on smartphones today. In this paper, we con- sider a group of smartphone users, within proximity of each other, who are interested in watching the same video from the ...

2012

MicroPlay: A Networking Framework for Local Multiplayer Games

Lorenzo Keller, Christina Fragouli

Smartphones are an ideal platform for local multiplayer games, thanks to their computational and networking ca- pabilities as well as their popularity and portability. How- ever, existing game engines do not exploit the locality of players to improve game ...

2012

Pliable Index Coding

Christina Fragouli, Siddhartha Brahma

We propose a new formulation of the index coding problem, where instead of demanding a specific message, clients are “pliable” and are happy to receive any one message they do not have. We prove that with this relaxation, although some instances of this pr ...

Ieee2012

Untrusting network coding

Christina Fragouli, Ghid Maatouk, Vinod Malathidevi Prabhakaran, Yasin Buyukalp

In networks that perform linear network coding, an intermediate network node may receive a much larger number of linear equations of the source symbols than the number of messages it needs to send. For networks constructed by untrusted nodes, we propose a ...

2012

Multi-terminal Secrecy in a Linear Non-coherent Packetized Networks

Christina Fragouli, Mahdi Jafari Siavoshani

We consider a group of m+1 trusted nodes that aim to create a shared secret key K over a network in the presence of a passive eavesdropper, Eve. We assume a linear non-coherent network coding broadcast channel (over a ﬁnite ﬁeld F_q ) from one of the hones ...

2012

Creating Shared Secrets out of Thin Air

Suhas Diggavi, Christina Fragouli, Aikaterini Argyraki, Iris Safaka

Current security systems typically rely on the adversary's computational limitations (e.g., the fact that it cannot invert a hash function or perform large-integer factorization). Wireless networks offer the opportunity for a different, complementary kind ...

Assoc Computing Machinery2012

Page 2 sur 6