activity
20102015
most citedCritical Database Size for Effective Caching

22 citations · 37 across the 6 of their papers we have counts for

collaborators
Showing cs.ITShow all

5 papers · 1 filter

cs.IT201522 cited

Critical Database Size for Effective Caching

Ajaykrishnan N., Navya S. Prem, Vinod M. Prabhakaran +1

Replicating or caching popular content in memories distributed across the network is a technique to reduce peak network loads. Conventionally, the performance gain of caching was t…

cs.IT20142 cited

Secret Communication over Broadcast Erasure Channels with State-feedback

László Czap, Vinod M. Prabhakaran, Christina Fragouli +1

We consider a 1-to- communication scenario, where a source transmits private messages to receivers through a broadcast erasure channel, and the receivers feed back strictly…

cs.IT2014

A New Upperbound for the Oblivious Transfer Capacity of Discrete Memoryless Channels

K. Sankeerth Rao, Vinod M. Prabhakaran

We derive a new upper bound on the string oblivious transfer capacity of discrete memoryless channels. The main tool we use is the tension region of a pair of random variables intr…

cs.IT2014

Correlated Jamming in a Joint Source Channel Communication System

Amitalok J. Budkuley, Bikash Kumar Dey, Vinod M. Prabhakaran

We study correlated jamming in joint source-channel communication systems. An i.i.d. source is to be communicated over a memoryless channel in the presence of a correlated jammer w…

cs.IT20109 cited

Assisted Common Information with Applications to Secure Two-Party Computation

Vinod Prabhakaran, Manoj Prabhakaran

Secure multi-party computation is a central problem in modern cryptography. An important sub-class of this are problems of the following form: Alice and Bob desire to produce sampl…