Multiterminal secrecy by public discussion

Foundations and Trends in Communications and Information Theory

Volumn 13, Issue 2-3, 2016, Pages 129-275

  Narayan, Prakash ^a   Tyagi, Himanshu ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; RANDOM PROCESSES; TREES (MATHEMATICS);

COMBINATORIAL PROBLEM; COMMON RANDOMNESS; CORRELATED OBSERVATIONS; PARTIAL KNOWLEDGE; SECRET KEY CAPACITIES; SOURCE MODELING; STRUCTURE PARTS; TECHNICAL TOOLS;

DATA COMPRESSION;

EID: 84989922308     PISSN: 15672190     EISSN: 15672328     Source Type: Journal    
DOI: 10.1561/0100000072     Document Type: Article

References (104)

1. R. Ahlswede and I. Csiszár. Common randomness in information theory and cryptography-Part I: Secret sharing. IEEE Trans. Inf. Theory, 39(4):1121-1132, July 1993.
2. R. Ahlswede and I. Csiszár. Common randomness in information theory and cryptography-Part II: CR capacity. IEEE Trans. Inf. Theory, 44(1):225-240, January 1998.
3. R. Ahlswede and I. Csiszár. On oblivious transfer capacity. Information Theory, Combinatorics, and Search Theory, pages 145-166, 2013.
4. K. Audenaert. A sharp Fannes-Type inequality for the von Neumann entropy. Physical Review A, 40:8127-8136, 2007. arXiv:quant-ph/0610146.
5. M. Bellare, S. Tessaro, and A. Vardy. Semantic Security for the Wiretap Channel, pages 294-311. Springer Berlin Heidelberg, Berlin, Heidelberg, 2012.
6. C. H. Bennett, G. Brassard, C. Crépeau, and U. M. Maurer. Generalized privacy amplification. IEEE Trans. Inf. Theory, 41(6):1915-1923, November 1995.
7. C. H. Bennett, G. Brassard, and J.-M. Robert. Privacy amplification by public discussion. SIAM J. Comput., 17(2):210-229, 1988.
8. M. Braverman. Coding for interactive computation: progress and challenges. Proc. Conference on Communication, Control, and Computing (Allerton), pages 1914-1921, October 2012.
9. N.J. Cerf, S. Massar, and S. Schneider. Multipartite classical and quantum secrecy monotones. Physical Review A, 66(4):042309, October 2002.
10. C. Chan. Generating secret in a network. Ph. D. Dissertation, Massachussetts Institute of Technology, 2010.
11. C. Chan. Linear perfect secret key agreement. In Proc. Information Theory Workshop (ITW), pages 723-726, October 2011.
12. C. Chan. Agreement of a restricted secret key. Proc. IEEE International Symposium on Information Theory, pages 1782-1786, July 2012.
13. C. Chan and L. Zheng. Mutual dependence for secret key agreement. Proc. Annual Conference on Information Sciences and Systems (CISS), March 2010.
14. T.A. Courtade and T.R. Halford. Coded cooperative data exchange for a secret key. IEEE Trans. Inf. Theory, 62(7):3785-3795, July 2016.
15. C. Crépeau and J. Kilian. Weakening Security Assumptions and Oblivious Transfer, pages 2-7. Springer New York, New York, NY, 1990.
16. I. Csiszár. Almost independence and secrecy capacity. Prob. Pered. Inform., 32(1):48-57, 1996.
17. I Csiszár and J. Körner. Broadcast channels with confidential messages. IEEE Trans. Inf. Theory, 24(3):339-348, May 1978.
18. I. Csiszár and J. Körner. Towards a general theory of source networks. IEEE Trans. Inf. Theory, 26(2):155-165, March 1980.
19. I. Csiszár and J. Körner. Information theory: Coding theorems for discrete memoryless channels. 2nd edition. Cambridge University Press, 2011.
20. I. Csiszár and P. Narayan. Common randomness and secret key generation with a helper. IEEE Trans. Inf. Theory, 46(2):344-366, March 2000.
21. I. Csiszár and P. Narayan. Secrecy capacities for multiple terminals. IEEE Trans. Inf. Theory, 50(12):3047-3061, December 2004.
22. I. Csiszár and P. Narayan. Secrecy capacities for multiterminal channel models. IEEE Trans. Inf. Theory, 54(6):2437-2452, June 2008.
23. I. Csiszár and P. Narayan. Secrecy generation for multiaccess channel models. IEEE Trans. Inf. Theory, 59(1):17-31, January 2013.
24. S. Fehr and S. Berens. On the conditional Rényi entropy. IEEE Trans. Inf. Theory, 60(11):6801-6810, November 2014.
25. M. Fitzi, S. Wolf, and J. Wullschleger. Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness, pages 562-578. Springer Berlin Heidelberg, Berlin, Heidelberg, 2004.
26. A. El Gamal and A. Orlitsky. Interactive data compression. In Proc. Annual Symposium on Foundations of Computer Science, pages 100-108, October 1984.
27. A. Gohari, M.H. Yassaee, and M.R. Aref. Secure channel simulation. In Information Theory Workshop (ITW), pages 406-410, September 2012.
28. A. A. Gohari and V. Anantharam. Information-Theoretic key agreement of multiple terminals-Part I. IEEE Trans. Inf. Theory, 56(8):3973-3996, August 2010.
29. A. A. Gohari and V. Anantharam. Information-Theoretic key agreement of multiple terminals-Part II: Channel model. IEEE Trans. Inf. Theory, 56(8):3997-4010, August 2010.
30. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28(2):270-299, 1984.
31. D. Gunduz, E. Erkip, and H.V. Poor. Lossless compression with security constraints. Proc. IEEE International Symposium on Information Theory, pages 111-115, July 2008.
32. Y. Liang H. Zhang, L. lai and H. Wang. The capacity region of the source-Type model for secret key and private key generation. IEEE Trans. Inf. Theory, 60(10):6389-6398, October 2014.
33. T. S. Han. Information-Spectrum Methods in Information Theory [English Translation]. Series: Stochastic Modelling and Applied Probability, Vol. 50, Springer, 2003.
34. T. S. Han and K. Kobayashi. A unified achievable rate region for a general class of multiterminal source coding systems. IEEE Trans. Inf. Theory, 26(3):277-288, May 1980.
35. T. S. Han and S. Verdú. Approximation theory of output statistics. IEEE Trans. Inf. Theory, 39(3):752-772, May 1993.
36. J. Hastad, R. Impagliazzo, L. A. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM Journal on Computing, 28:12-24, 1999.
37. M. Hayashi. Exponential decreasing rate of leaked information in universal random privacy amplification. IEEE Trans. Inf. Theory, 57(6):3989-4001, June 2011.
38. M. Hayashi, H. Tyagi, and S. Watanabe. Secret key agreement: General capacity and second-order asymptotics. Proc. IEEE International Symposium on Information Theory, pages 1136-1140, July 2014.
39. M. Hayashi, H. Tyagi, and S. Watanabe. Secret key agreement: General capacity and second-order asymptotics. IEEE Trans. Inf. Theory, 62(7), May 2016.
40. H. Imai, K. Morozov, A. C. Nascimento, and A. Winter. Efficient protocols achieving the commitment capacity of noisy correlations. Proc. IEEE International Symposium on Information Theory, pages 1432-1436, 2006.
41. R. Impagliazzo, L. A. Levin, and M. Luby. Pseudo-random generation from one-way functions. In Proc. ACM Symposium on Theory of Computing, pages 12-24, 1989.
42. R. Impagliazzo and D. Zuckerman. How to recycle random bits. In Proc. Annual Symposium on Foundations of Computer Science, pages 248-253, November 1989.
43. M. Iwamoto and K. Ohta. Security notions for information theoretically secure encryptions. Proc. IEEE International Symposium on Information Theory, pages 1777-1781, July 2011.
44. A. H. Kaspi. Two-way source coding with a fidelity criterion. IEEE Trans. Inf. Theory, 31(6):735-740, November 1985.
45. J. Katz and Y. Lindell. Introduction to Modern Cryptography. Chapman & Hall/CRC, 2007.
46. J. Kilian. Founding crpytography on oblivious transfer. In Proc. Symposium on Theory of Computing, pages 20-31, 1988.
47. R. Konig, R. Renner, and C. Schaffner. The operational meaning of min-And max-entropy. IEEE Trans. Inf. Theory, 55(9):4337-4347, September 2009.
48. S. K. Leung-Yan-Cheong. Multi-user and wiretap channels including feedback. Ph. D. Dissertation, Stanford University, 1976.
49. Y. Liang, H. V. Poor, and S. Shamai (Shitz). Information theoretic security. Found. Trends Commun. Inf. Theory, 5(4-5):355-580, April 2009.
50. J. Liu, P. Cuff, and S. Verdú. Common randomness and key generation with limited interaction. CoRR, abs/1601.00899v2, 2016.
51. M. Madiman and P. Tetali. Information inequalities for joint distributions, with interpretations and applications. IEEE Trans. Inf. Theory, 56(6):2699-2713, June 2010.
52. J. L. Massey. An introduction to contemporary cryptology. Proc.The IEEE, 76(5):533-549, 1988.
53. U. M. Maurer. Provably secure key distribution based on independent channels. IEEE Information Theory Workshop (ITW), pages 49-71, June 1990.
54. U. M. Maurer. Secret key agreement by public discussion from common information. IEEE Trans. Inf. Theory, 39(3):733-742, May 1993.
55. M. Mukherjee, C. Chan, N. Kashyap, and Q. Zhou. Bounds on the communication rate needed to achieve SK capacity in the hypergraphical source model. CoRR, arXiv:1601.05377v2, 2016.
56. M. Mukherjee and N. Kashyap. On the communication complexity of secret key generation in the multiterminal source model. Proc. IEEE Symposium on Information Theory, June 2014.
57. M. Mukherjee, N. Kashyap, and Y. Sankarasubramaniam. On the public communication needed to achieve SK capacity in the multiterminal source model. CoRR, abs/1507.02874, 2015.
58. A.C.A. Nascimento and A. Winter. On the oblivious transfer capacity of noisy correlations. Proc. IEEE International Symposium on Information Theory, pages 1871-1875, July 2009.
59. S. Nitinawarat and P. Narayan. Perfect omniscience, perfect secrecy, and Steiner tree packing. IEEE Trans. Inform. Theory, 56(12):6490-6500, December 2010.
60. S. Nitinawarat and P. Narayan. Secret key generation for correlated Gaussian sources. IEEE Trans. Inf. Theory, 58(6):3373-3391, June 2012.
61. S. Nitinawarat, C. Ye, A. Barg, P. Narayan, and A. Reznik. Secret key generation for a pairwise independent network model. IEEE Trans. Inform. Theory, 56(12):6482-6489, December 2010.
62. A. Orlitsky. Worst-case interactive communication I: Two messages are almost optimal. IEEE Trans. Inf. Theory, 36(5):1111-1126, September 1990.
63. A. Orlitsky and A. El Gamal. Communication with secrecy constraints. In Proc. ACM Symposium on Theory of Computing, pages 217-224, October 1984.
64. V. Prabhakaran and K. Ramchandran. On secure distributed source coding. In IEEE Information Theory Workshop (ITW), pages 442-447, September 2007.
65. P. A. Regalia, A. Khisti, Y. Liang, and S. Tomasin (editors). Secure communications via physical-layer and information-Theoretic techniques. Proc.The IEEE, 103(10), October 2015.
66. R. Renner. Security of quantum key distribution. Ph. D. Dissertation, ETH Zurich, 2005.
67. R. Renner and S. Wolf. New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction, pages 562-577. Springer Berlin Heidelberg, Berlin, Heidelberg, 2003.
68. R. Renner and S. Wolf. Smooth Rényi entropy and applications. Proc. IEEE International Symposium on Information Theory, page 233, June 2004.
69. R. Renner and S. Wolf. Simple and Tight Bounds for Information Reconciliation and Privacy Amplification, pages 199-216. Springer Berlin Heidelberg, Berlin, Heidelberg, 2005.
70. M. Santha and U. V. Vazirani. Generating quasi-random sequences from slightly-random sources. In Proc. Annual Symposium on Foundations of Computer Science, pages 434-440, October 1984.
71. M. Santha and U. V. Vazirani. Generating quasi-random sequences from semi-random sources. Journal of Computer and System Sciences, 33(1):75-87, 1986.
72. C. E. Shannon. Communication theory of secrecy systems. Bell System Technical Journal, 28:656-715, October 1949.
73. R. Tandon, S. Ulukus, and K. Ramchandran. Secure source coding with a helper. Proc. Conference on Communication, Control, and Computing (Allerton), pages 1061-1068, October 2009.
74. H. Tyagi. Distributed computing with privacy. Proc. IEEE International Symposium on Information Theory, pages 1157-1161, July 2012.
75. H. Tyagi. Common information and secret key capacity. IEEE Trans. Inf. Theory, 59(9):5627-5640, September 2013.
76. H. Tyagi. Common randomness principles of secrecy. Ph. D. Dissertation, Univeristy of Maryland, College Park, 2013.
77. H. Tyagi. Distributed function computation with confidentiality. IEEE Journal on Selected Areas in Communications, 31(4):691-701, April 2013.
78. H. Tyagi, N. Kashyap, Y. Sankarasubramaniam, and K. Viswanathan. Fault-Tolerant secret key generation. Proc. IEEE International Symposium on Information Theory, pages 1787-1791, July 2012.
79. H. Tyagi and P. Narayan. How many queries will resolve common randomness? IEEE Trans. Inf. Theory, 59(9):5363-5378, September 2013
80. H. Tyagi and P. Narayan. How many queries will resolve common randomness? Proc. IEEE International Symposium on Information Theory, pages 3165-3169, July 2013.
81. H. Tyagi, P. Narayan, and P. Gupta. Secure computing. Proc. IEEE International Symposium on Information Theory, pages 2612-2616, June 2010.
82. H. Tyagi, P. Narayan, and P. Gupta. When is a function securely computable? Proc. IEEE International Symposium on Information Theory, pages 2876-2880, August 2011.
83. H. Tyagi, P. Narayan, and P. Gupta. When is a function securely computable? IEEE Trans. Inf. Theory, 57(10):6337-6350, October 2011.
84. H. Tyagi and S. Watanabe. Secret key capacity for multiple access channel with public feedback. Proc. Conference on Communication, Control, and Computing (Allerton), pages 1-7, October 2013.
85. H. Tyagi and S. Watanabe. A Bound for Multiparty Secret Key Agreement and Implications for a Problem of Secure Computing, pages 369-386. Springer Berlin Heidelberg, Berlin, Heidelberg, 2014.
86. H. Tyagi and S. Watanabe. Unpublished notes. 2014.
87. H. Tyagi and S. Watanabe. Converses for secret key agreement and secure computing. IEEE Trans. Inf. Theory, 61:4809-4827, September 2015.
88. S. P. Vadhan. Pseudorandomness. Foundations and Trends in Theoretical Computer Science, 7:1-336, 2012.
89. S. Vembu and S. Verdú. Generating random bits from an arbitrary source: Fundamental limits. IEEE Trans. Inf. Theory, 41(5):1322-1332, Sep. 1995.
90. J. von Neumann. Various techniques used in connection with random digits. 1963.
91. Y. Wang and P. Ishwar. On unconditionally secure multi-party sampling from scratch. Proc. IEEE Symposium on Information Theory (ISIT), pages 1782-1786, July 2011.
92. S. Watanabe and Y. Oohama. Secret key agreement from vector Gaussian sources by rate limited public communication. Information Forensics and Security, IEEE Transactions on, 6(3):541-550, September 2011.
93. S. Winkler and J. Wullschleger. On the Eciency of Classical and Quantum Oblivious Transfer Reductions, pages 707-723. Springer Berlin Heidelberg, Berlin, Heidelberg, 2010.
94. S. Winkler and J. Wullschleger. On the efficiency of classical and quantum secure function evaluation. IEEE Trans. Inf. Theory, 60(6):3123-3143, June 2014.
95. A. Winter, A.C.A. Nascimento, and H. Imai. Commitment Capacity of Discrete Memoryless Channels, pages 35-51. Springer Berlin Heidelberg, Berlin, Heidelberg, 2003.
96. S. Wolf and J. Wullschleger. New monotones and lower bounds in unconditional two-party computation. IEEE Trans. Inf. Theory, 54(6):2792-2797, June 2008.
97. A. D. Wyner. Recent results in the Shannon theory. IEEE Trans. Inf. Theory, 20(1):2-10, January 1974.
98. A. D. Wyner. The wiretap channel. Bell System Technical Journal, 54(8):1355-1367, October 1975.
99. A. D. Wyner, J. K. Wolf, and F. M. J. Willems. Communicating via a processing broadcast satellite. IEEE Trans. Inf. Theory, 48(6):1243-1249, June 2002.
100. A. C. Yao. Some complexity questions related to distributive computing. Proc. Annual Symposium on Theory of Computing, pages 209-213, 1979.
101. C. Ye and P. Narayan. The secret key-private key capacity region for three terminals. Proc. IEEE International Symposium on Information Theory, pages 2142-2146, September 2005.
102. C. Ye and P. Narayan. Secret key and private key constructions for simple multiterminal source models. IEEE Trans. Inf. Theory, 58(2):639-651, February 2012.
103. C. Ye and A. Reznik. Group secret key generation algorithms. Proc. IEEE International Symposium on Information Theory, pages 2596-2600, June 2007.
104. Z. Zhang. Estimating mutual information via Kolmogorov distance. IEEE Trans. Inf. Theory, 53(9):3280-3282, September 2007