How many queries will resolve common randomness?

IEEE Transactions on Information Theory

Volumn 59, Issue 9, 2013, Pages 5363-5378

  Tyagi, Himanshu ^a   Narayan, Prakash ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Common randomness; Gaussian secret key capacity; Interactive communication; Query; Query exponent; Secret key capacity; Strong converse

Indexed keywords

COMMON RANDOMNESS; INTERACTIVE COMMUNICATIONS; QUERY; QUERY EXPONENT; SECRET KEY CAPACITIES; STRONG CONVERSE;

COMPUTER APPLICATIONS; INFORMATION THEORY;

COMMUNICATION;

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

References (25)

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. E. Arikan, "An inequality on guessing and its application to sequential decoding," IEEE Trans. Inf. Theory, vol. 42, no. 1, pp. 99-105, Jan. 1996. (Pubitemid 126775660)
3. E. Arikan and N.Merhav, "The Shannon cipher system with a guessing wiretapper," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 1860-1866, Sep. 1999. (Pubitemid 32077615)
4. R. B. Ash, Real Analysis and Probability. New York, NY, USA: Academic, 1972.
5. S. Bobkov and M. Madiman, "Concentration of the information in data with log-concave distributions," Ann. Probab., vol. 39, no. 4, pp. 1528-1543, 2011.
6. C. Chan, "Generating secret in a network," Ph.D. dissertation, Massachusetts Inst. Technol., Cambridge, MA, USA, 2010.
7. C. Chan and L. Zheng, "Mutual dependence for secret key agreement," in Proc. 44th Annu. Conf. Inf. Sci. Syst., 2010, pp. 1-6.
8. T. Cover and S. Pombra, "Gaussian feedback capacity," IEEE Trans. Inf. Theory, vol. 35, no. 1, pp. 37-43, Jan. 1989.
9. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, Dec. 2004.
10. 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.
11. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Channels, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 2011.
12. 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.
13. T. S. Han, Information-SpectrumMethods in Information Theory [English Translation], ser. Stochastic Modelling and Applied Probability. New York, NY, USA: Springer-Verlag, 2003, vol. 50.
14. M. K. Hanawal and R. Sundaresan, "The Shannon cipher system with a guessing wiretapper: General sources," IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 2503-2516, Apr. 2011.
15. T. S. Han and S. Verdú, "Approximation theory of output statistics," IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 752-772, May 1993.
16. G. Hardy, J. E. Littlewood, and G. Pólya, Inequalities, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 1952.
17. M. Loéve, Probability Theory, 2nd ed. New York, NY, USA: Van Nostrand, 1960.
18. M. Madiman and A. Barron, "Generalized entropy power inequalities and monotonicity properties of information," IEEE Trans. Inf. Theory, vol. 53, no. 7, pp. 2317-2329, Jul. 2007. (Pubitemid 47061898)
19. M. Madiman, A. Marcus, and P. Tetali, "Entropy and set cardinality inequalities for partition-determined functions," Random Struct. Algorithms, vol. 40, pp. 399-424, 2012.
20. 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.
21. J. L. Massey, "Guessing and entropy," presented at the IEEE Int. Symp. Inf. Theory, Trondheim, Norway, 1994.
22. S. Nitinawarat and P. Narayan, "Secret key generation for correlated Gaussian sources," IEEE Trans. Inf. Theory, vol. 58, no. 6, pp. 3373-3391, Jun. 2012.
23. A. Rényi, "On measures of entropy and information," in Proc. 4th Berkeley Symp. Math. Statist. Prob., (Univ. Calif. Press), 1961, vol. 1, pp. 547-561.
24. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., vol. 27, pp. 379-423, Oct. 1948.
25. S.Venkatesan andV.Anantharam, "The common randomness capacity of a pair of independent discrete memoryless channels," IEEE Trans. Inf. Theory, vol. 44, no. 1, pp. 215-224, Jan. 1998. (Pubitemid 128737890)