Common information and secret key capacity

IEEE Transactions on Information Theory

Volumn 59, Issue 9, 2013, Pages 5627-5640

  Tyagi, Himanshu ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Common information; Common randomness; Interactive common information; Interactive communication; Secret key capacity

Indexed keywords

COMMON INFORMATION; COMMON RANDOMNESS; INTERACTIVE COMMON INFORMATION; INTERACTIVE COMMUNICATIONS; SECRET KEY CAPACITIES;

COMPUTER APPLICATIONS; INFORMATION THEORY;

COMMUNICATION;

EID: 84882989241     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2013.2264355     Document Type: Article

References (17)

1. R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography - Part I: Secret sharing," IEEE Trans. Inf. Theory, vol. 39, no. 4, pp. 1121-1132, Jul. 1993.
2. R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography - Part II: CR capacity," IEEE Trans. Inf. Theory, vol. 44, no. 1, pp. 225-240, Jan. 1998. (Pubitemid 128737891)
3. I. Csiszár, "Almost independence and secrecy capacity," Prob. Pered. Inf., vol. 32, no. 1, pp. 48-57, 1996.
4. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Channels, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 2011.
5. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, Dec. 2004.
6. I. Csiszár and P. Narayan, "Secrecy capacities for multiterminal channel models," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2437-2452, Jun. 2008.
7. K. Eswaran andM. Gastpar, "Rate loss in the CEO problem," presented at the Conf. Inf. Sci. Syst., Mar. 2005.
8. P. Gács and J. Körner, "Common information is far less than mutual information," Probl. Control Inf. Theory, vol. 2, no. 2, pp. 149-162, 1973.
9. S. Kamath and V. Ananthram, "A new dual to the Gács- Körner common information defined via the Gray-Wyner system," presented at the Conf. Commun. Control, Comput. (Allerton), Oct. 2010.
10. A. H. Kaspi, "Two-way source coding with a fidelity criterion," IEEE Trans. Inf. Theory, vol. IT-31, no. 6, pp. 735-740, Nov. 1985.
11. N. Ma and P. Ishwar, "Some results on distributed source coding for interactive function computation," IEEE Trans. Inf. Theory, vol. 57, no. 9, pp. 6180-6195, Sep. 2011.
12. M. Madiman and P. Tetali, "Information inequalities for joint distributions, with interpretations and applications," IEEE Trans. Inf. Theory, vol. 56, no. 6, pp. 2699-2713, Jun. 2010.
13. U. M. Maurer, "Secret key agreement by public discussion from common information," IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 733-742, May 1993.
14. U. M. Maurer, "The strong secret key rate of discrete random triples," Commun. Cryptogr.: Two Sides One Tapestry, vol. 276, pp. 271-285, 1994.
15. D. Slepian and J. Wolf, "Noiseless coding of correlated information source," IEEE Trans. Inf. Theory, vol. IT-19, no. 4, pp. 471-480, Jul. 1973.
16. A. D. Wyner, "The common information of two dependent random variables," IEEE Trans. Inf. Theory, vol. IT-21, no. 2, pp. 163-179, Mar. 1975.
17. G. Xu and B. Chen, "The sufficiency principle for decentralized data reduction," presented at the IEEE Int. Symp. Inf. Theory, Jul. 2012.