Secret key agreement: General capacity and second-order asymptotics

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2014, Pages 1136-1140

  Hayashi, Masahito ^a,d   Tyagi, Himanshu ^b   Watanabe, Shun ^c,e  

^a NAGOYA UNIVERSITY   (Japan)

^b University of California at San Diego   (United States)

^c UNIVERSITY OF TOKUSHIMA   (Japan)

^d NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^e UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTICS; PUBLIC COMMUNICATIONS; SECOND ORDERS; SECRET KEY; SECRET KEY AGREEMENT; SECRET KEY CAPACITIES; UPPER BOUND;

INFORMATION THEORY;

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

References (22)

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. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals, " IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, December 2004.
3. Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith, "Fuzzy extractors: How to generate strong keys from biometrics and other noisy data, " SIAM Journal on Computing, vol. 38, no. 1, pp. 97-139, 2008.
4. W. Feller, An Introduction to Probability Theory and its Applications, Volume II. 2nd edition. John Wiley & Sons Inc., UK, 1971.
5. A. A. Gohari and V. Anantharam, "Information-theoretic key agreement of multiple terminalspart i, " IEEE Trans. Inf. Theory, vol. 56, no. 8, pp. 3973 - 3996, August 2010.
6. T. S. Han, Information-Spectrum Methods in Information Theory [English Translation]. Series: Stochastic Modelling and Applied Probability, Vol. 50, Springer, 2003.
7. T. S. Han and S. Verdú, "Approximation theory of output statistics, " IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 752-772, May 1993.
8. M. Hayashi and H. Nagaoka, "General formulas for capacity of classicalquantum channels, " IEEE Trans. Inf. Theory, vol. 49, no. 7, pp. 1753- 1768, July 2003.
9. 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.
10. 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.
11. S. Kuzuoka, "On the redundancy of variable-rate slepian-wolf coding, " Proc. International Symposium on Information Theory and its Applications (ISITA), pp. 155-159, 2012.
12. 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.
13. S. Miyake and F. Kanaya, "Coding theorems on correlated general sources, " IIEICE Trans. Fundamental, vol. E78-A, no. 9, pp. 1063- 1070, September 1995.
14. Y. Polyanskiy, "Channel coding: non-asymptotic fundamental limits, " Ph. D. Dissertation, Princeton University, 2010.
15. 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.
16. R. Renner, "Security of quantum key distribution, " Ph. D. Dissertation, ETH Zurich, 2005.
17. R. Renner and S. Wolf, "New bounds in secret-key agreement: The gap between formation and secrecy extraction, " EUROCRYPT, LNCS, vol. 2656, pp. 562-577, 2003.
18. R. Renner and S. Wolf, "Simple and tight bounds for information reconciliation and privacy amplification, " ASIACRYPT, LNCS, vol. 3788, pp. 199-216, 2005.
19. V. Strassen, "Asymptotische abschatzungen in Shannon's informationstheorie, " Third Prague Conf. Inf. Theory, pp. 689-723, 1962, English translation: http://www.math.cornell.edu/pmlut/strassen.pdf.
20. H. Tyagi and P. Narayan, "How many queries will resolve common randomness?" IEEE Trans. Inf. Theory, vol. 59, no. 9, pp. 5363-5378, September 2013.
21. H. Tyagi and S. Watanabe, "A bound for multiparty secret key agreement and implications for a problem of secure computing, " Accepted, EUROCRYPT, 2014, preprint available at http://eprint.iacr.org.
22. L. Wang and R. Renner, "One-shot classical-quantum capacity and hypothesis testing, " Phys. Rev. Lett., vol. 108, no. 20, p. 200501, May 2012.