Prakash Narayan

IEEE Trans. Inf. Theory, March, 2023

List Privacy Under Function Recoverability.

[BibT_eX]

[DOI]

CoRR, 2023

Shared Information for the Cliqueylon Graph.

[BibT_eX]

[DOI]

Sagnik Bhattacharya

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Distribution Privacy Under Function Recoverability.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Shared Information for a Markov Chain on a Tree.

[BibT_eX]

[DOI]

Sagnik Bhattacharya

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Distribution Privacy Under Function $\rho$ -Recoverability.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Universal Single-Shot Sampling Rate Distortion.

[BibT_eX]

[DOI]

Sagnik Bhattacharya

Proceedings of the IEEE International Symposium on Information Theory, 2021

2019

Data Privacy for a $\rho$ -Recoverable Function.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Predicate Privacy and List Privacy for a ρ-Recoverable Function.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Universal Sampling Rate Distortion.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Data Privacy for a ρ-Recoverable Function.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Sampling Rate Distortion.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

2016

Multiterminal Secrecy by Public Discussion.

[BibT_eX]

[DOI]

Found. Trends Commun. Inf. Theory, 2016

Independent and memoryless sampling rate distortion.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Common randomness for secure computing.

[BibT_eX]

[DOI]

Shun Watanabe

Proceedings of the IEEE International Symposium on Information Theory, 2015

Memoryless sampling rate distortion.

[BibT_eX]

[DOI]

Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2013

How Many Queries Will Resolve Common Randomness?

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Secrecy Generation for Multiaccess Channel Models.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

2012

Secret Key and Private Key Constructions for Simple Multiterminal Source Models.

[BibT_eX]

[DOI]

Chunxuan Ye

IEEE Trans. Inf. Theory, 2012

Secret Key Generation for Correlated Gaussian Sources.

[BibT_eX]

[DOI]

Sirin Nitinawarat

IEEE Trans. Inf. Theory, 2012

2011

When Is a Function Securely Computable?

[BibT_eX]

[DOI]

Piyush Gupta

IEEE Trans. Inf. Theory, 2011

2010

Secret Key Generation for a Pairwise Independent Network Model.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Perfect Omniscience, Perfect Secrecy, and Steiner Tree Packing.

[BibT_eX]

[DOI]

Sirin Nitinawarat

IEEE Trans. Inf. Theory, 2010

Secure computing.

[BibT_eX]

[DOI]

Piyush Gupta

Proceedings of the IEEE International Symposium on Information Theory, 2010

Perfect secrecy and combinatorial tree packing.

[BibT_eX]

[DOI]

Sirin Nitinawarat

Proceedings of the IEEE International Symposium on Information Theory, 2010

Capacity of a shared secret key.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

Multiterminal secrecy generation.

[BibT_eX]

[DOI]

Proceedings of the 2009 IEEE Information Theory Workshop, 2009

The Gelfand-Pinsker channel: Strong converse and upper bound for the reliability function.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Perfect secrecy, perfect omniscience and steiner tree packing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Secrecy generation for multiple input multiple output channel models.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Multiterminal Secrecy Generation and Tree Packing.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security, 4th International Conference, 2009

2008

Secrecy Capacities for Multiterminal Channel Models.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Common Randomness, Multiuser Secrecy and Tree Packing.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2007

The Poisson Fading Channel.

[BibT_eX]

[DOI]

Kaushik Chakraborty

IEEE Trans. Inf. Theory, 2007

Full Life-Cycle Support for End-to-End Processes.

[BibT_eX]

[DOI]

Bernhard Steffen

Computer, 2007

Active pointing control for short range free-space optical communication.

[BibT_eX]

[DOI]

Arash Komaee

P. S. Krishnaprasad

Commun. Inf. Syst., 2007

On Multiterminal Secrecy Capacities.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Stochastic control for long range cooperative optical beam tracking.

[BibT_eX]

[DOI]

Arash Komaee

P. S. Krishnaprasad

Proceedings of the 46th IEEE Conference on Decision and Control, 2007

2006

Reliable Communication over an Optical Fading Channel.

[BibT_eX]

[DOI]

Kaushik Chakraborty

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

2005

The secret key~private key capacity region for three terminals.

[BibT_eX]

[DOI]

Chunxuan Ye

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

Secrecy capacities for multiple terminals.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

The private key capacity region for three terminals.

[BibT_eX]

[DOI]

Chunxuan Ye

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2002

Order estimation for a special class of hidden Markov sources and binary renewal processes.

[BibT_eX]

[DOI]

Sanjeev Khudanpur

IEEE Trans. Inf. Theory, 2002

Capacities of time-varying multiple-access channels with side information.

[BibT_eX]

[DOI]

Arnab Das

IEEE Trans. Inf. Theory, 2002

The secret key capacity for multiple terminals.

[BibT_eX]

[DOI]

Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2000

Common randomness and secret key generation with a helper.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

1998

Reliable Communication Under Channel Uncertainty.

[BibT_eX]

[DOI]

Amos Lapidoth

IEEE Trans. Inf. Theory, 1998

Multithreaded performance analysis with Sun WorkShop thread event analyzer.

[BibT_eX]

[DOI]

Po-Ting Wu

Proceedings of the SIGMETRICS Symposium on Parallel and Distributed Tools, 1998

1996

Error exponents for successive refinement by partitioning.

[BibT_eX]

[DOI]

A. Kanlis

IEEE Trans. Inf. Theory, 1996

The optimal error exponent for Markov order estimation.

[BibT_eX]

[DOI]

Lorenzo Finesso

Chuang-Chun Liu

IEEE Trans. Inf. Theory, 1996

1995

Channel capacity for a given decoding metric.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

1994

Order estimation and sequential universal data compression of a hidden Markov source by the method of mixtures.

[BibT_eX]

[DOI]

Chuang-Chun Liu

IEEE Trans. Inf. Theory, 1994

1991

Capacity of the Gaussian arbitrarily varying channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

1989

Capacity and decoding rules for classes of arbitrarily varying channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

1988

The capacity of a vector Gaussian arbitrarily varying channel.

[BibT_eX]

[DOI]

Brian L. Hughes

IEEE Trans. Inf. Theory, 1988

The capacity of the arbitrarily varying channel revisited: Positivity, constraints.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1988

Arbitrarily varying channels with constrained inputs and states.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1988

1987

Signal set design for band-limited memoryless multiple-access channels with soft decision demodulation.

[BibT_eX]

[DOI]

Donald L. Snyder

IEEE Trans. Inf. Theory, 1987

Gaussian arbitrarily varying channels.

[BibT_eX]

[DOI]

Brian L. Hughes

IEEE Trans. Inf. Theory, 1987

1982

The cutoff-rate region for multiple-access communication systems (D.Sc. Thesis abstr.).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1982

1981

The two-user cutoff rate for an asynchronous and a synchronous multiple-access channel are the same.

[BibT_eX]

[DOI]