Vinod M. Prabhakaran

Orcid: 0000-0001-7505-5303

According to our database1, Vinod M. Prabhakaran authored at least 127 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Byzantine Multiple Access Channels - Part I: Reliable Communication.
IEEE Trans. Inf. Theory, April, 2024

2023
Complete Characterization of Broadcast and Pseudo-Signatures from Correlations.
IACR Cryptol. ePrint Arch., 2023

Byzantine Multiple Access Channels - Part II: Communication With Adversary Identification.
CoRR, 2023

Hypothesis Testing for Adversarial Channels: Chernoff-Stein Exponents.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Randomness Requirements for Three-Secret Sharing.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Private Index Coding.
IEEE Trans. Inf. Theory, 2022

Multiple Access Channel Simulation.
IEEE Trans. Inf. Theory, 2022

Secure Non-Interactive Reduction and Spectral Analysis of Correlations.
IACR Cryptol. ePrint Arch., 2022

Consensus Capacity of Noisy Broadcast Channels.
CoRR, 2022

Byzantine Consensus Over Broadcast Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
On the Capacity Enlargement of Gaussian Broadcast Channels With Passive Noisy Feedback.
IEEE Trans. Inf. Theory, 2021

Coordination Through Shared Randomness.
IEEE Trans. Inf. Theory, 2021

Optimal Communication Rates and Combinatorial Properties for Common Randomness Generation.
IEEE Trans. Inf. Theory, 2021

Rényi Divergence Based Bounds on Generalization Error.
Proceedings of the IEEE Information Theory Workshop, 2021

Communication With Adversary Identification in Byzantine Multiple Access Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2021

On the Capacity Region of Gaussian Broadcast Channels under Two-Sided Noisy Feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Compound Arbitrarily Varying Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Interactive Secure Function Computation.
IEEE Trans. Inf. Theory, 2020

Zero-Communication Reductions.
IACR Cryptol. ePrint Arch., 2020

When does Partial Noisy Feedback Enlarge the Capacity of a Gaussian Broadcast Channel?
Proceedings of the IEEE International Symposium on Information Theory, 2020

Strong Coordination with Side Information.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Private Two-Terminal Hypothesis Testing.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Secure Computation to Hide Functions of Inputs.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Cryptography from One-Way Communication: On Completeness of Finite Channels.
Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019
Joint State Estimation and Communication Over a State-Dependent Gaussian Multiple Access Channel.
IEEE Trans. Commun., 2019

Byzantine Multiple Access.
CoRR, 2019

Optimal Communication Rates for Zero-Error Distributed Simulation under Blackboard Communication Protocols.
CoRR, 2019

Channels with Action Dependent States and Common Reconstructions.
Proceedings of the National Conference on Communications, 2019

Multiple Access Channels with Byzantine Users.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Coordination via Shared Randomness.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Multiple Access Channels with Adversarial Users.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Message and State Communication over Channels with Action Dependent States.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Optimality of a Protocol by Feige-Kilian-Naor for Three-Party Secure Computation.
Proceedings of the Progress in Cryptology - INDOCRYPT 2019, 2019

2018
Plausible Deniability Over Broadcast Channels.
IEEE Trans. Inf. Theory, 2018

Private Coded Caching.
IEEE Trans. Inf. Forensics Secur., 2018

Oblivious Transfer in Incomplete Networks.
IACR Cryptol. ePrint Arch., 2018

Arbitrarily Varying Remote Sources.
CoRR, 2018

Degraded Relay Channel with Non-causal State Information at the Source and Relay.
Proceedings of the 2018 International Conference on Signal Processing and Communications (SPCOM), 2018

On the Rate Distortion Function of Arbitrarily Varying Remote Sources.
Proceedings of the IEEE Information Theory Workshop, 2018

State-Dependent Gaussian Broadcast Channel with Common State Reconstructions.
Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Coordination Using Individually Shared Randomness.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

The Role of Interaction and Common Randomness in Two-User Secure Computation.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Wiretapped Oblivious Transfer.
IEEE Trans. Inf. Theory, 2017

Communication in the Presence of a State-Aware Adversary.
IEEE Trans. Inf. Theory, 2017

Secure computation of randomized functions: Further results.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Coding for arbitrarily varying remote sources.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Communication and Randomness Lower Bounds for Secure Computation.
IEEE Trans. Inf. Theory, 2016

An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback.
IEEE Trans. Inf. Theory, 2016

Capacity Results for Multicasting Nested Message Sets Over Combination Networks.
IEEE Trans. Inf. Theory, 2016

Lower Bounds for Interactive Function Computation via Wyner Common Information.
CoRR, 2016

Lower bounds and optimal protocols for three-party secure computation.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Fundamental limits of secretive coded caching.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Rényi Information Complexity and an Information Theoretic Characterization of the Partition Bound.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Secret Communication Over Broadcast Erasure Channels With State-Feedback.
IEEE Trans. Inf. Theory, 2015

Secure Network Coding With Erasures and Feedback.
IEEE Trans. Inf. Theory, 2015

Wireless Network Security: Building on Erasures.
Proc. IEEE, 2015

On the Communication Complexity of Secure Computation.
IACR Cryptol. ePrint Arch., 2015

Critical database size for effective caching.
Proceedings of the Twenty First National Conference on Communications, 2015

On the noisy feedback capacity of Gaussian broadcast channels.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Dirty paper arbitrarily varying channel with a state-aware adversary.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Private data transfer over a broadcast channel.
Proceedings of the IEEE International Symposium on Information Theory, 2015

On the oblivious transfer capacity of the degraded wiretapped binary erasure channel.
Proceedings of the IEEE International Symposium on Information Theory, 2015

On coding for secure computing.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Interference Channels With Half-Duplex Source Cooperation.
IEEE Trans. Inf. Theory, 2014

Assisted Common Information With an Application to Secure Two-Party Sampling.
IEEE Trans. Inf. Theory, 2014

Is Non-Unique Decoding Necessary?
IEEE Trans. Inf. Theory, 2014

Tension Bounds for Information Complexity.
CoRR, 2014

A new upperbound for the oblivious transfer capacity of discrete memoryless channels.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

On the oblivious transfer capacity region of the binary erasure broadcast channel.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

How to securely compute the modulo-two sum of binary sources.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

The oblivious transfer capacity of the wiretapped binary erasure channel.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Triangle network secrecy.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Correlated jamming in a Joint Source Channel Communication system.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Writing on a dirty paper in the presence of jamming.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

The Gaussian CEO competitive pricing game.
Proceedings of the Sixth International Conference on Communication Systems and Networks, 2014

2013
Securing broadcast against dishonest receivers.
Proceedings of the International Symposium on Network Coding, 2013

Exploiting common randomness: A resource for network secrecy.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Assisted sampling of correlated sources.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Using feedback for secrecy over graphs.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

A block Markov encoding scheme for broadcasting nested message sets.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Estimation of bandlimited signals from the signs of noisy samples.
Proceedings of the IEEE International Conference on Acoustics, 2013

Communication requirements for secure computation.
Proceedings of the 51st Annual Allerton Conference on Communication, 2013

2012
Secrecy via Sources and Channels.
IEEE Trans. Inf. Theory, 2012

Estimation of Bandlimited Signals in Additive Gaussian Noise: a "Precision Indifference" Principle
CoRR, 2012

Untrusting network coding.
Proceedings of the International Symposium on Network Coding, 2012

On secure multiparty sampling for more than two parties.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

On multicasting nested message sets over combination networks.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Broadcasting private messages securely.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Is non-unique decoding necessary?
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

On interactive secrecy over erasure networks.
Proceedings of the 5th International Symposium on Communications, 2012

2011
Interference Channels With Destination Cooperation.
IEEE Trans. Inf. Theory, 2011

Interference Channels With Source Cooperation.
IEEE Trans. Inf. Theory, 2011

Hybrid Digital-Analog Codes for Source-Channel Broadcast of Gaussian Sources Over Gaussian Channels.
IEEE Trans. Inf. Theory, 2011

Secure Capacity Region for Erasure Broadcast Channels with Feedback
CoRR, 2011

Secret message capacity of erasure broadcast channels with feedback.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Assisted common information: Further results.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Assisted Common Information with Applications to Secure Two-Party Computation
CoRR, 2010

Interference channels with half duplex source cooperation.
Proceedings of the IEEE International Symposium on Information Theory, 2010

Secure distributive storage of decentralized source data: Can interaction help?
Proceedings of the IEEE International Symposium on Information Theory, 2010

Assisted common information.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
The two-user compound interference channel.
IEEE Trans. Inf. Theory, 2009

Reciprocity in linear deterministic networks under linear coding.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Harnessing bursty interference.
Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Interference management through cooperation.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Communication by sleeping: Optimizing a relay channel under wake and transmit power costs.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Opportunistic interference management.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Colored Gaussian Source-Channel Broadcast for Heterogeneous (Analog/Digital) Receivers.
IEEE Trans. Inf. Theory, 2008

Secrecy via Sources and Channels -- A Secret Key - Secret Message Rate Trade-off Region
CoRR, 2008

Bounds on the capacity region of a class of compound interference channels
CoRR, 2008

The two user Gaussian compound interference channel.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Secrecy via sources and channels - A secret key - Secret message rate tradeoff region.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

The secrecy capacity of a class of parallel Gaussian compound wiretap channels.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Interference channels with source/destination cooperation.
Proceedings of the 42nd Asilomar Conference on Signals, Systems and Computers, 2008

Secret communication using sources and channels.
Proceedings of the 42nd Asilomar Conference on Signals, Systems and Computers, 2008

2007
Channel coding with strictly casual colored side-information at transmitter.
Proceedings of the IEEE International Symposium on Information Theory, 2007

On the Role of Helpers in Peer-to-Peer File Download Systems: Design, Analysis and Simulation.
Proceedings of the 6th International workshop on Peer-To-Peer Systems, 2007

2006
Decentralized erasure codes for distributed networked storage.
IEEE Trans. Inf. Theory, 2006

On Source Encoding with Side-information Under Ambiguous State of Nature.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Syndrome-Based Robust Video Transmission Over Networks with Bursty Losses.
Proceedings of the International Conference on Image Processing, 2006

Distributed Fountain Codes for Networked Storage.
Proceedings of the 2006 IEEE International Conference on Acoustics Speech and Signal Processing, 2006

2005
Ubiquitous access to distributed data in large-scale sensor networks through decentralized erasure codes.
Proceedings of the Fourth International Symposium on Information Processing in Sensor Networks, 2005

An Analysis of Empirical PMF Based Tests for Least Significant Bit Image Steganography.
Proceedings of the Information Hiding, 7th International Workshop, 2005

2004
On compressing encrypted data.
IEEE Trans. Signal Process., 2004

Rate region of the quadratic Gaussian CEO problem.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Compressing encrypted sources using side-information coding.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Towards a theory for video coding using distributed compression principles.
Proceedings of the 2003 International Conference on Image Processing, 2003


  Loading...