Publications de Vinod Malathidevi Prabhakaran

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

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

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

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

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

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

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

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

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

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

Secret message capacity of erasure broadcast channels with feedback

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

We characterize the secret message capacity of a wiretapped erasure channel where causal channel state informa- tion of the honest nodes is publicly available. In doing so, we establish an intimate connection between message secrecy and secret key generati ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

On degraded two-message set broadcast

Suhas Diggavi, Christina Fragouli, Shirin Saeedi Bidokhti, Vinod Malathidevi Prabhakaran

We consider the two message set problem, where a source broadcasts a common message W1 to an arbitrary set of receivers U and a private message W2 to a subset of the receivers P ⊆U . Transmissions occur over linear deterministic channels. For the case wher ...

2009