Publications by Suhas Diggavi | EPFL Graph Search

Community-Aware Group Testing

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

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

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

Dominique Florian Tschopp, Matthias Grossglauser, Suhas Diggavi

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

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

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

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

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

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

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

Interference Channels with Bursty Traffic and Delayed Feedback

Suhas Diggavi, I-Hsiang Wang

In this paper we study interference management in wireless networks with bursty user traffic. In each time slot, whether a user is on or off for transmission is governed by its own Bernoulli random state. At each transmitter, the states of activities of ot ...

Ieee2013

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

On Degrees of Freedom of Layered Two Unicast Networks with Delayed CSIT

Suhas Diggavi, I-Hsiang Wang

In this paper we study the two unicast information flow problem over layered Gaussian networks with arbitrary number of nodes and connectivity, under the model of delayed channel state information (CSI) at transmitters and instantaneous CSI at receivers. W ...

Ieee2012

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

On multicasting nested message sets over combination networks

Suhas Diggavi, Shirin Saeedi Bidokhti, Vinod Malathidevi Prabhakaran

In this paper, we study delivery of two nested message sets over combination networks with an arbitrary number of receivers, where a subset of receivers (public receivers) demand only the lower priority message and a subset of receivers (private receivers) ...

Ieee2012

Is non-unique decoding necessary?

Suhas Diggavi, Shirin Saeedi Bidokhti, Vinod Malathidevi Prabhakaran

In multi-terminal communication systems, signals carrying messages meant for different destinations are often observed together at any given destination receiver. Han and Kobayashi (1981) proposed a receiving strategy which performs a joint unique decoding ...

Ieee2012

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

Approximate Capacity of a Class of Gaussian Interference-Relay Networks

Suhas Diggavi, Christina Fragouli, Soheil Mohajerzefreh

In this paper, we study a Gaussian relay-interference network, in which relay (helper) nodes are to facilitate competing information flows between different source-destination pairs. We focus on two-stage relay-interference networks where there are weak cr ...

Institute of Electrical and Electronics Engineers2011