Secret Key Agreement: General Capacity and Second-Order Asymptotics

IEEE Transactions on Information Theory

Volumn 62, Issue 7, 2016, Pages 3796-3810

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

^a NAGOYA UNIVERSITY   (Japan)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c INDIAN INSTITUTE OF SCIENCE   (India)

^d TOKYO UNIVERSITY OF AGRICULTURE AND TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC ANALYSIS;

ASYMPTOTIC RESULTS; INTERACTIVE COMMUNICATIONS; LOWER AND UPPER BOUNDS; PUBLIC COMMUNICATIONS; SECOND ORDERS; SECRET KEY AGREEMENT; SECRET KEY CAPACITIES; SINGLE SHOTS;

CRYPTOGRAPHY;

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

References (35)

1. R. Ahlswede and I. Csiszià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. Csiszià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.
3. C. H. Bennett, G. Brassard, C. Crépeau, U. M. Maurer, "Generalized privacy amplification," IEEE Trans. Inf. Theory, vol. 41, no. 6, pp. 1915-1923, Nov. 1995.
4. I. Csisziàr and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, Dec. 2004.
5. I. Csisziàr and P. Narayan, "Secrecy capacities for multiterminal channel models," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2437-2452, Jun. 2008.
6. Y. Dodis, R. Ostrovsky, L. Reyzin, A. Smith, "Fuzzy extractors: How to generate strong keys from biometrics and other noisy data," SIAM J. Comput., vol. 38, no. 1, pp. 97-139, 2008.
7. W. Feller, An Introduction to Probability Theory and Its Applications, vol. 2, 2nd ed. London, U.K.: Wiley, 1971.
8. B. Fuller, A. D. Smith, L. Reyzin, "When are fuzzy extractors possible?" IACR Cryptol. ePrint Arch., vol. 2014, p. 961, 2014.
9. A. A. Gohari and V. Anantharam, "Information-theoretic key agreement of multiple terminals-Part I," IEEE Trans. Inf. Theory, vol. 56, no. 8, pp. 3973-3996, Aug. 2010.
10. T. S. Han, Information-Spectrum Methods in Information Theory (Stochastic Modelling and Applied Probability), vol. 50. Berlin, Germany: Springer, 2003.
11. T. S. Han and S. Verdú, "Approximation theory of output statistics," IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 752-772, May 1993.
12. M. Hayashi, Quantum Information: An Introduction. Berlin, Germany: Springer, 2006.
13. 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.
14. M. Hayashi, "Information spectrum approach to second-order coding rate in channel coding," IEEE Trans. Inf. Theory, vol. 55, no. 11, pp. 4947-4966, Nov. 2009.
15. M. Hayashi and H. Nagaoka, "General formulas for capacity of classical-quantum channels," IEEE Trans. Inf. Theory, vol. 49, no. 7, pp. 1753-1768, Jul. 2003.
16. M. Hayashi, H. Tyagi, S. Watanabe, "Secret key agreement: General capacity and second-order asymptotics," in Proc. IEEE Int. Symp. Inf. Theory, Nov. 2014, pp. 1136-1140.
17. R. Impagliazzo, L. A. Levin, M. Luby, "Pseudo-random generation from one-way functions," in Proc. 21st Annu. ACM Symp. Theory Comput. (STOC), 1989, pp. 12-24.
18. S. Kuzuoka, "On the redundancy of variable-rate Slepian-Wolf coding," in Proc. Int. Symp. Inf. Theory Appl. (ISITA), 2012, pp. 155-159.
19. 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.
20. S. Miyake and F. Kanaya, "Coding theorems on correlated general sources," IEICE Trans. Fundam., vols. E78-A, no. 9, pp. 1063-1070, 1995.
21. H. Nagaoka, "Strong converse theorems in the quantum information theory," in Proc. ERATO Workshop Quantum Inf. Sci., Tokyo, Japan, Sep. 2001, p. 33.
22. Y. Polyanskiy, "Channel coding: Non-asymptotic fundamental limits," Ph.D. dissertation, Dept. Electr. Eng., Princeton Univ., Princeton, NJ, USA, 2010.
23. Y. Polyanskiy, H. V. Poor, S. Verdú, "Channel coding rate in the finite blocklength regime," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2307-2359, May 2010.
24. R. Renner, "Security of quantum key distribution," Ph.D. dissertation, Dept. Phys., ETH Zurich Univ., Zürich, Switzerland, 2005.
25. R. Renner and S. Wolf, "Simple and tight bounds for information reconciliation and privacy amplification," in Proc. ASIACRYPT, 2005, pp. 199-216.
26. I. Shevtsova, "On the absolute constants in the Berry-Esseen type inequalities for identically distributed summands," CoRR, 2011.
27. D. Slepian and J. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inf. Theory, vol. 19, no. 4, pp. 471-480, Jul. 1973.
28. V. Strassen, "Asymptotische abschätzungen in Shannon's informationstheorie," in Proc. Third Prague Conf. Inf. Theory, 1962, pp. 689-723. [Online]. Available: http://www.math.cornell.edu/?pmlut/strassen.pdf
29. V. Strassen, "The existence of probability measures with given marginals," Ann. Math. Statist., vol. 36, no. 2, pp. 423-439, 1965.
30. H. Tyagi, "Common randomness principles of secrecy," Ph.D. dissertation, Dept. Electr. Comput. Eng., Univ. Maryland, College Park, MD, USA, 2013.
31. H. Tyagi and P. Narayan, "How many queries will resolve common randomness?" IEEE Trans. Inf. Theory, vol. 59, no. 9, pp. 5363-5378, Sep. 2013.
32. H. Tyagi and S. Watanabe, "Converses for secret key agreement and secure computing," IEEE Trans. Inf. Theory, vol. 61, no. 9, pp. 4809-4827, Sep. 2015.
33. H. Tyagi and S. Watanabe, "A bound for multiparty secret key agreement and implications for a problem of secure computing," in Proc. EUROCRYPT, 2014, pp. 369-386.
34. L. Wang and R. Renner, "One-shot classical-quantum capacity and hypothesis testing," Phys. Rev. Lett., vol. 108, no. 20, p. 200501, May 2012.
35. S. Watanabe, R. Matsumoto, T. Uyematsu, Y. Kawano, "Key rate of quantum key distribution with hashed two-way classical communication," Phys. Rev. A, vol. 76, no. 3, p. 032312, Sep. 2007.