Converses for Secret Key Agreement and Secure Computing

IEEE Transactions on Information Theory

Volumn 61, Issue 9, 2015, Pages 4809-4827

  Tyagi, Himanshu ^a   Watanabe, Shun ^b  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b TOKYO UNIVERSITY OF AGRICULTURE AND TECHNOLOGY   (Japan)

Author keywords

Hypothesis testing; secret key agreement; secure two party computation; single shot converse

Indexed keywords

INFORMATION THEORY;

BINARY HYPOTHESIS TESTING; CORRELATED OBSERVATIONS; FUNCTION COMPUTATIONS; HYPOTHESIS TESTING; PUBLIC COMMUNICATIONS; SECRET KEY AGREEMENT; SECURE TWO-PARTY COMPUTATIONS; SINGLE SHOTS;

CRYPTOGRAPHY;

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

References (83)

1. R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography. I. Secret sharing, " IEEE Trans. Inf. Theory, vol. 39, no. 4, pp. 1121-1132, Jul. 1993.
2. R. Ahlswede and I. Csiszár, "On oblivious transfer capacity, " in Information Theory, Combinatorics, and Search Theory. Berlin, Germany: Springer-Verlag, 2013, pp. 145-166.
3. D. Beaver, "Precomputing oblivious transfer, " in Advances in Cryptol-ogy. Berlin, Germany: Springer-Verlag, 1995, pp. 97-109.
4. A. Beimel, Y. Ishai, R. Kumaresan, and E. Kushilevitz, "On the cryptographic complexity of the worst functions, " in Proc. 11th TCC, 2014, pp. 317-342.
5. 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, Nov. 1995.
6. C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters, "Mixed-state entanglement and quantum error correction, " Phys. Rev. A, vol. 54, pp. 3824-3851, Nov. 1996.
7. M. Blum, "Coin flipping by telephone a protocol for solving impossible problems, " SIGACT News, vol. 15, no. 1, pp. 23-27, Jan. 1983.
8. R. Canetti, "Universally composable security: A new paradigm for cryptographic protocols, " in Proc. 42nd Symp. Found. Comput. Sci., Oct. 2001, pp. 136-145.
9. N. J. Cerf, S. Massar, and S. Schneider, "Multipartite classical and quantum secrecy monotones, " Phys. Rev. A, vol. 66, no. 4, p. 042309, Oct. 2002.
10. C. Chan and L. Zheng, "Mutual dependence for secret key agreement, " in Proc. 44th Annu. Conf. Inf. Sci. Syst. (CISS), Mar. 2010, pp. 1-6.
11. M. Christandl, A. Ekert, M. Horodecki, P. Horodecki, J. Oppenheim, and R. Renner, "Unifying classical and quantum key distillation, " in Proc. TCC, 2007, pp. 456-478.
12. C. Crépeau and J. Kilian, "Weakening security assumptions and oblivious transfer, " in Advances in Cryptology. Berlin, Germany: Springer-Verlag, 1990, pp. 2-7.
13. C. Crépeau, "Efficient cryptographic protocols based on noisy channels, " in Advances in Cryptology. Berlin, Germany: Springer-Verlag, 1997, pp. 306-317.
14. I. Csiszár, "Almost independence and secrecy capacity, " Problemy Peredachi Inf., vol. 32, no. 1, pp. 48-57, 1996.
15. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 2011.
16. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals, " IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, Dec. 2004.
17. 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.
18. N. Datta, "Min-and max-relative entropies and a new entanglement monotone, " IEEE Trans. Inf. Theory, vol. 55, no. 6, pp. 2816-2826, Jun. 2009.
19. I. Devetak and A. Winter, "Distillation of secret key and entanglement from quantum states, " Proc. Roy. Soc. London A, vol. 461, no. 2053, pp. 207-235, Jan. 2005.
20. Y. Dodis, R. Ostrovsky, L. Reyzin, and 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.
21. S. Even, O. Goldreich, and A. Lempel, "A randomized protocol for signing contracts, " Commun. ACM, vol. 28, no. 6, pp. 637-647, Jun. 1985.
22. W. Feller, An Introduction to Probability Theory and Its Applications, vol. 2, 2nd ed. Chichester, U.K.: Wiley, 1971.
23. M. Fitzi, S. Wolf, and J. Wullschleger, "Pseudo-signatures, broadcast, and multi-party computation from correlated randomness, " in Advances in Cryptology. Berlin, Germany: Springer-Verlag, 2004, pp. 562-578.
24. P. Gács and J. Körner, "Common information is far less than mutual information, " Problems Control Inf. Theory, vol. 2, no. 2, pp. 149-162, 1973.
25. Y. Gertner, S. Kannan, T. Malkin, O. Reingold, and M. Viswanathan, "The relationship between public key encryption and oblivious transfer, " in Proc. 41st Annu. Symp. Found. Comput. Sci. (FOCS), Nov. 2000, pp. 325-335.
26. 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.
27. M. Hayashi, Quantum Information: An Introduction. Berlin, Germany: Springer-Verlag, 2006.
28. 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.
29. M. Hayashi, H. Tyagi, and S. Watanabe. (2014). "Secret key agreement: General capacity and second-order asymptotics." [Online]. Available: http://arxiv.org/abs/1411.0735
30. M. Hayashi, H. Tyagi, and S. Watanabe, "Secret key agreement: General capacity and second-order asymptotics, " in Proc. IEEE Int. Symp. Inf. Theory, Jun./Jul. 2014, pp. 1136-1140.
31. M. Hayashi, H. Tyagi, and S. Watanabe, "Strong converse for a degraded wiretap channel via active hypothesis testing, " in Proc. Conf. Commun., Control, Comput. (Allerton), 2014, pp. 148-151.
32. B. Ibinson, N. Linden, and A. Winter, "Robustness of quantum Markov chains, " Commun. Math. Phys., vol. 277, no. 2, pp. 289-304, 2008.
33. H. Imai, K. Morozov, A. C. A. Nascimento, and A. Winter, "Efficient protocols achieving the commitment capacity of noisy correlations, " in Proc. IEEE Int. Symp. Inf. Theory, Jul. 2006, pp. 1432-1436.
34. R. Impagliazzo, L. A. Levin, and M. Luby, "Pseudo-random generation from one-way functions, " in Proc. 21st Annu. ACM Symp. Theory Comput. (STOC), 1989, pp. 12-24.
35. R. Impagliazzo and D. Zuckerman, "How to recycle random bits, " in Proc. 30th Annu. Symp. Found. Comput. Sci. (FOCS), 1989, pp. 248-253.
36. M. Iwamoto and J. Shikata, "Information theoretic security for encryption based on conditional Rényi entropies, " in Information Theoretic Security. New York, NY, USA: Springer-Verlag, 2014, pp. 103-121.
37. S. Kamath and V. Anantharam, "A new dual to the Gács-Körner common information defined via the Gray-Wyner system, " in Proc. 48th Annu. Conf. Commun., Control, Comput. (Allerton), 2010, pp. 1340-1346.
38. J. Katz and Y. Lindell, Introduction to Modern Cryptography: Principles and Protocols. London, U.K.: Chapman & Hall, 2007.
39. J. Kilian, "Founding crytpography on oblivious transfer, " in Proc. 20th Annu. Symp. Theory Comput. (STOC), 1988, pp. 20-31.
40. J. Kilian, "More general completeness theorems for secure two-party computation, " in Proc. 32nd Annu. Symp. Theory Comput. (STOC), 2000, pp. 316-324.
41. R. König, R. Renner, and C. Schaffner, "The operational meaning of min-and max-entropy, " IEEE Trans. Inf. Theory, vol. 55, no. 9, pp. 4337-4347, Sep. 2009.
42. R. König, S. Wehner, and J. Wullschleger, "Unconditional security from noisy quantum storage, " IEEE Trans. Inf. Theory, vol. 58, no. 3, pp. 1962-1984, Mar. 2012.
43. S. Kullback, Information Theory and Statistics. New York, NY, USA: Dover, 1968.
44. 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.
45. U. M. Maurer, "Authentication theory and hypothesis testing, " IEEE Trans. Inf. Theory, vol. 46, no. 4, pp. 1350-1356, Jul. 2000.
46. U. M. Maurer and S. Wolf, "Unconditionally secure key agreement and the intrinsic conditional information, " IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 499-514, Mar. 1999.
47. P. Narayan, H. Tyagi, and S. Watanabe, "Common randomness for secure computing, " in Proc. IEEE Int. Symp. Inf. Theory, 2015, pp. 949-953.
48. A. C. A. Nascimento and A. Winter, "On the oblivious-transfer capacity of noisy resources, " IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2572-2581, Jun. 2008.
49. T. Ogawa and H. Nagaoka, "Strong converse and Stein's lemma in quantum hypothesis testing, " IEEE Trans. Inf. Theory, vol. 46, no. 7, pp. 2428-2433, Nov. 2000.
50. A. Orlitsky and A. El Gamal, "Communication with secrecy constraints, " in Proc. 16th Annu. ACM Symp. Theory Comput. (STOC), 1984, pp. 217-224.
51. R. S. Pappu, "Physical one-way functions, " Ph.D. dissertation, Media Lab., Massachusetts Inst. Technol., Cambridge, MA, USA, 2001.
52. 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.
53. Y. Polyanskiy and S. Verdú, "Arimoto channel coding converse and Rényi divergence, " in Proc. 48th Annu. Conf. Commun., Control, Comput. (Allerton), Sep./Oct. 2010, pp. 1327-1333.
54. V. M. Prabhakaran and M. M. Prabhakaran, "Assisted common information with an application to secure two-party sampling, " IEEE Trans. Inf. Theory, vol. 60, no. 6, pp. 3413-3434, Jun. 2014.
55. M. O. Rabin. (2005). "How to exchange secrets with oblivious transfer, " Aiken Comput. Lab. Harvard Univ., Tech. Rep. TR81. [Online]. Available: http://eprint.iacr.org/
56. S. Ranellucci, A. Tapp, S. Winkler, and J. Wullschleger, "On the efficiency of bit commitment reductions, " in Proc. ASIACRYPT, 2011, pp. 520-537.
57. K. S. Rao and V. M. Prabhakaran, "A new upperbound for the oblivious transfer capacity of discrete memoryless channels, " in Proc. IEEE Inf. Theory Workshop, Nov. 2014, pp. 35-39.
58. R. Renner, "Security of quantum key distribution, " Ph.D. dissertation, Dept. Comput. Sci., ETH Zürich, Zürich, Switzerland, 2005.
59. R. Renner and S. Wolf, "New bounds in secret-key agreement: The gap between formation and secrecy extraction, " in Proc. EUROCRYPT, 2003, pp. 562-577.
60. R. Renner and S. Wolf, "Simple and tight bounds for information reconciliation and privacy amplification, " in Proc. ASIACRYPT, 2005, pp. 199-216.
61. A. Rényi, "On measures of entropy and information, " in Proc. 4th Berkeley Symp. Math. Statist. Probab., vol. 1. 1961, pp. 547-561.
62. C. E. Shannon, "Communication theory of secrecy systems, " Bell Syst. Te ch. J., vol. 28, no. 4, pp. 656-715, 1949.
63. M. Tomamichel. (2012). "A framework for non-asymptotic quantum information theory." [Online]. Available: http://arxiv.org/abs/1203.2142
64. M. Tomamichel and V. Y. F. Tan, "A tight upper bound for the third-order asymptotics for most discrete memoryless channels, " IEEE Trans. Inf. Theory, vol. 59, no. 11, pp. 7041-7051, Nov. 2013.
65. F. Topsøe, "An information theoretical identity and a problem involving capacity, " Stud. Sci. Math. Hungary, vol. 2, pp. 291-292, 1967.
66. P. Tuyls, B. Škorić, and T. Kevenaar, Eds., Security With Noisy Data: Private Biometrics, Secure Key Storage and Anti-Counterfeiting. New York, NY, USA: Springer-Verlag, 2007.
67. H. Tyagi, "Common information and secret key capacity, " IEEE Trans. Inf. Theory, vol. 59, no. 9, pp. 5627-5640, Sep. 2013.
68. 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.
69. H. Tyagi, P. Narayan, and P. Gupta, "When is a function securely computable?" IEEE Trans. Inf. Theory, vol. 57, no. 10, pp. 6337-6350, Oct. 2011.
70. H. Tyagi, S. Venkatakrishnan, P. Viswanath, and S. Watanabe. (2015). "Information complexity density and simulation of protocols." [Online]. Available: http://arxiv.org/abs/1504.05666
71. H. Tyagi, P. Viswanath, and S. Watanabe, "Interactive communication for data exchange, " in Proc. IEEE Int. Symp. Inf. Theory, Jun. 2015, pp. 1806-1810.
72. H. Tyagi and S. Watanabe, "Secret key capacity for multipleaccess channel with public feedback, " in Proc. 51st Annu. Allerton Conf. Commun., Control, Comput. (Allerton), 2013, pp. 1-7.
73. 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.
74. V. Vedral and M. B. Plenio, "Entanglement measures and purification procedures, " Phys. Rev. A, vol. 57, pp. 1619-1633, Mar. 1998.
75. L. Wang and R. Renner, "One-shot classical-quantum capacity and hypothesis testing, " Phys. Rev. Lett., vol. 108, no. 20, p. 200501, May 2012.
76. S. Watanabe and M. Hayashi, "Non-asymptotic analysis of privacy amplification via Rényi entropy and inf-spectral entropy, " in Proc. IEEE Int. Symp. Inf. Theory, Jul. 2013, pp. 2715-2719.
77. S. Watanabe and M. Hayashi. (2014). "Finite-length analysis on tail probability for Markov chain and application to simple hypothesis testing." [Online]. Available: http://arxiv.org/abs/1401.3801
78. S. Wehner, M. Curty, C. Schaffner, and H.-K. Lo, "Implementation of two-party protocols in the noisy-storage model, " Phys. Rev. A, vol. 81, no. 5, p. 052336, May 2010.
79. S. Winkler and J. Wullschleger, "On the efficiency of classical and quantum secure function evaluation, " IEEE Trans. Inf. Theory, vol. 60, no. 6, pp. 3123-3143, Jun. 2014.
80. A. Winter, A. C. A. Nascimento, and H. Imai, "Commitment capacity of discrete memoryless channels, " in Proc. Cryptogr. Coding, 2003, pp. 35-51.
81. S. Wolf and J. Wullschleger, "Oblivious transfer is symmetric, " in Proc. EUROCRYPT, 2006, pp. 222-232.
82. S. Wolf and J. Wullschleger, "New monotones and lower bounds in unconditional two-party computation, " IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2792-2797, Jun. 2008.
83. A. C. Yao, "Protocols for secure computations, " in Proc. 23rd Annu. Symp. Found. Comput. Sci. (FOCS), 1982, pp. 160-164.