Interactive communication for data exchange

IEEE International Symposium on Information Theory - Proceedings

Volumn 2015-June, Issue , 2015, Pages 1806-1810

  Tyagi, Himanshu ^a   Viswanath, Pramod ^b   Watanabe, Shun ^c  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b University of Illinois at Urbana Champaign   (United States)

^c TOKYO UNIVERSITY OF AGRICULTURE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; RANDOM VARIABLES;

DISCRETE RANDOM VARIABLES; EXCHANGE PROBLEMS; INTERACTIVE COMMUNICATIONS; INTERACTIVE PROTOCOLS; OPTIMAL COMMUNICATION; PROBABILITY OF ERRORS; SECRET KEY AGREEMENT; UPPER AND LOWER BOUNDS;

ELECTRONIC DATA INTERCHANGE;

EID: 84969771402     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2015.7282767     Document Type: Conference Paper

References (26)

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, July 1993.
2. Y. Altug and A. B. Wagner, "Feedback can improve the second-order coding performance in discrete memoryless channels, " ISIT, 2014.
3. C. H. Bennett, G. Brassard, C. Crépeau, and U. M. Maurer, "Generalized privacy amplification, " IEEE Trans. Inf. Theory, vol. 41, no. 6, pp. 1915-1923, November 1995.
4. M. Braverman and A. Rao, "Information equals amortized communication, " in FOCS, 2011, pp. 748-757.
5. T. M. Cover and J. A. Thomas, Elements of Information Theory. 2nd edition. John Wiley & Sons Inc., 2006.
6. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals, " IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, December 2004.
7. M. Feder and N. Shulman, "Source broadcasting with unknown amount of receiver side information, " in ITW, Oct 2002, pp. 127-130.
8. T. S. Han, Information-Spectrum Methods in Information Theory [English Translation]. Springer, 2003.
9. T. S. Han and S. Verdú, "Approximation theory of output statistics, " IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 752-772, May 1993.
10. M. Hayashi, "Second-order asymptotics in fixed-length source coding and intrinsic randomness, " IEEE Trans. Inf. Theory, vol. 54, no. 10, pp. 4619-4637, Oct 2008.
11. M. Hayashi, H. Tyagi, and S. Watanabe, "Secret key agreement: General capacity and second-order asymptotics, " arXiv: 1411. 0735, 2014.
12. -, "Secret key agreement: General capacity and second-order asymptotics, " ISIT, 2014.
13. M. Hayashi, "Information spectrum approach to second-order coding rate in channel coding, " IEEE Trans. Inf. Theory, vol. 55, no. 11, pp. 4947-4966, Novemeber 2009.
14. R. Impagliazzo, L. A. Levin, and M. Luby, "Pseudo-random generation from one-way functions, " Proc. Annual Symposium on Theory of Computing, pp. 12-24, 1989.
15. 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.
16. S. Miyake and F. Kanaya, "Coding theorems on correlated general sources, " IIEICE Trans. Fundamental, vol. E78-A, no. 9, pp. 1063-1070, September 1995.
17. A. Orlitsky and A. El Gamal, "Communication with secrecy constraints, " STOC, pp. 217-224, 1984.
18. A. Orlitsky, "Worst-case interactive communication i: Two messages are almost optimal, " IEEE Trans. Inf. Theory, vol. 36, no. 5, pp. 1111-1126, 1990.
19. Y. Polyanskiy, H. V. Poor, and S. Verdú, "Channel coding rate in the finite blocklength regime, " IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2307-2359, May 2010.
20. R. Renner, "Security of quantum key distribution, " Ph. D. Dissertation, ETH Zurich, 2005.
21. R. Renner and S. Wolf, "Simple and tight bounds for information reconciliation and privacy amplification, " in ASIACRYPT, 2005, pp. 199-216.
22. D. Slepian and J. Wolf, "Noiseless coding of correlated information source, " IEEE Trans. Inf. Theory, vol. 19, no. 4, pp. 471-480, July 1973.
23. V. Strassen, "Asymptotische abschätzungen in Shannon's informationstheorie, " Third Prague Conf. Inf. Theory, pp. 689-723, 1962, English translation: http: //www. math. cornell. edu/ pmlut/strassen. pdf.
24. H. Tyagi and S. Watanabe, "A bound for multiparty secret key agreement and implications for a problem of secure computing, " in EUROCRYPT, 2014, pp. 369-386.
25. -, "Converses for secret key agreement and secure computing, " CoRR, vol. abs/1404. 5715, 2014.
26. E.-H. Yang and D.-K. He, "Interactive encoding and decoding for one way learning: Near lossless recovery with side information at the decoder, " Information Theory, IEEE Transactions on, vol. 56, no. 4, pp. 1808-1824, April 2010.