Publications de Suhas Diggavi | EPFL Graph Search

Community-Aware Group Testing

Pavlos Nikolopoulos, Christina Fragouli, Suhas Diggavi, Sundara Rajan Srinivasavaradhan

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

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Group testing for connected communities

Pavlos Nikolopoulos, Christina Fragouli, Suhas Diggavi, Sundara Rajan Srinivasavaradhan

In this paper, we propose algorithms that leverage a known community structure to make group testing more efficient. We consider a population organized in disjoint communities: each individual participates in a community, and its infection probability depe ...

MICROTOME PUBLISHING2021

An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback

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

This paper presents exact capacity characterizations for the case, when a principal, Alice, wants to securely send a message to another principal, Bob, over three network configurations: the parallel edges network, the V-network, and the triangle network. ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Hierarchical Routing Over Dynamic Wireless Networks

Matthias Grossglauser, Suhas Diggavi, Dominique Florian Tschopp

The topology of a mobile wireless network changes over time. Maintaining routes between all nodes requires the continuous transmission of control information, which consumes precious power and bandwidth resources. Many routing protocols have been developed ...

Wiley-Blackwell2015

Secure Network Coding With Erasures and Feedback

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

Secure network coding assumes that the underlying network channels are error-free; thus, if our channels introduce errors, we need to first apply a channel code to correct them, and then build security on top of the resulting error-free network. In this pa ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Secret Communication Over Broadcast Erasure Channels With State-Feedback

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

We consider a 1-to-K communication scenario, where a source transmits private messages to K receivers through a broadcast erasure channel, and the receivers feedback strictly, causally, and publicly their channel states after each transmission. We explore ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Triangle Network Secrecy

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

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

2014

Creating Secrets out of Erasures

Aikaterini Argyraki, Christina Fragouli, Suhas Diggavi, Panagiotis Kostopoulos

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

2013

Securing Broadcast Against Dishonest Receivers

Christina Fragouli, Suhas Diggavi, 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

Exploiting Common Randomness: a Resource for Network Secrecy

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

We investigate the problem of secure communication in a simple network with three communicating parties, two distributed sources who communicate over orthogonal channels to one destination node. The cooperation between the sources is restricted to a rate l ...

2013