Secret key and private key constructions for simple multiterminal source models

IEEE Transactions on Information Theory

Volumn 58, Issue 2, 2012, Pages 639-651

  Ye, Chunxuan ^a,b   Narayan, Prakash ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b INTERDIGITAL COMMUNICATIONS   (United States)

Author keywords

Binary symmetric channel; LDPC codes; Maximum likelihood decoding; Perfect secrecy; Private key capacity; Private key construction; Secret key capacity; Secret key construction; Slepian wolf data compression

Indexed keywords

BINARY SYMMETRIC CHANNEL; LDPC CODES; MAXIMUM LIKELIHOOD DECODING; PERFECT SECRECY; PRIVATE KEY; SECRET KEY; SLEPIAN-WOLF;

DATA COMPRESSION; ERROR CORRECTION;

ACCESS CONTROL;

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

References (53)

1. A. Aaron and B. Girod, "Compression with side information using turbo codes," in Proc. IEEE Data Compression Conf., Snowbird, UT, Apr. 2002, pp. 252-261.
2. 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, Jul. 1993.
3. M. Andersson, V. Rathi, R. Thobaben, J. Kliewer, and M. Skoglund, Nested polar codes for wireless and relay channels 2010 [Online]. Available: http://arxiv.org/pdf/1006.3573
4. E. Arikan, "Channel polarization: A method for constructing capacity- achieving codes for symmetric binary-input memoryless channel," IEEE Trans. Inf. Theory, vol. 55, no. 7, pp. 3051-3073, Jul. 2009.
5. E. Arikan and E. Telatar, "On the rate of channel polarization," in Proc. Int. Symp. Inf. Theory, Seoul, Korea, Jun. 2009.
6. 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.
7. M. Bloch, J. Barros, M. Rodrigues, and S. W. M. McLaughlin, "Wireless information theoretic security," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2515-2534, Jun. 2008.
8. T. P. Coleman, A. H. Lee, M. Médard, and M. Effros, "On some new approaches to practical Slepian-Wolf compression inspired by channel coding," in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 2004, pp. 282-291.
9. I. Csiszár, "Linear codes for sources and source networks: Error exponents, universal coding," IEEE Trans. Inf. Theory, vol. 28, no. 4, pp. 585-592, Jul. 1982.
10. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1982.
11. I. Csiszár and P. Narayan, "Common randomness and secret key generation with a helper," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 344-366, Mar. 2000.
12. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, Dec. 2004.
13. 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.
14. P. Elias, "Coding for noisy channels," IRE Convention Rec., pt. 4, pp. 37-46, 1955.
15. E. M. Gabidulin, "Bounds for the probability of decoding error when using linear codes over memoryless channels," Prob. Pered. Inf., vol. 3, pp. 55-62, 1967.
16. J. Garcia-Frias and Y. Zhao, "Compression of correlated binary sources using turbo codes," IEEE Commun. Lett., vol. 5, no. 11, pp. 417-419, Oct. 2001.
17. J. Garcia-Frias and W. Zhong, "LDPC codes for compression of multi-terminal sources with hidden Markov correlation," IEEE Commun. Lett., vol. 7, no. 3, pp. 115-117, Mar. 2003.
18. H. O. Georgii, Gobbs Measures and Phase Transitions. Berlin, Germany: De Gruyter, 1988.
19. 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.
20. D.-K. He and E.-H. Yang, "On the duality between Slepian-Wolf coding and channel coding," in Proc. Int. Symp. Inf. Theory, Seattle, WA, Jul. 2006, pp. 2546-2550.
21. R. Hu, R. Viswanathan, and J. Li, "A new coding scheme for the noisychannel Slepian-Wolf problem: Separate design and joint decoding," in Proc. Global Commun. Conf., Dallas, TX, 2004.
22. O. O. Koyluoglu and H. E. Gamal, Polar coding for secure transmission and key agreement 2010 [Online]. Available: http://arxiv.org/pdf/1003. 1422
23. C. Lan, A. Liveris, K. Narayanan, Z. Xiong, and C. N. Georghiades, "Slepian-Wolf coding of multiple M-ary sources using LDPC code," in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 2004, p. 549.
24. J. Li, Z. Tu, and R. Blum, "Slepian-Wolf coding for nonuniform sources using turbo codes," in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 2004, pp. 312-321.
25. Y. Liang, H. V. Poor, and S. Shamai, "Information theoretic security," Found. rends Commun. Inf. Theory, vol. 5, no. 4-5, pp. 355-580, 2008.
26. A. D. Liveris, Z. Xiong, and C. N. Georghiades, "Compression of binary sources with side information at the decoding using LDPC codes," IEEE Commun. Lett., vol. 6, no. 10, pp. 440-442, Oct. 2002.
27. A. D. Liveris, C. Lan, K. R. Narayanan, Z. Xiong, and C. N. Georghiades, "Slepian-Wolf coding of three binary sources using LDPC codes," in Proc. Int. Symp. Turbo Codes and Related Topics, Brest, France, Sep. 2003.
28. D. J. C. Mackay, "Good error correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
29. H. Mahdavifar and A. Vardy, Achieving the secrecy capacity of wiretap channels using polar codes 2010 [Online]. Available: http://arxiv.org/abs/1001. 0210
30. G. A. Margulis, "Probabilistic characteristics of graphs with large connectivity," Probl. Inf. Trans., vol. 10, pp. 174-179, Apr. 1974.
31. 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.
32. P. Mitran and J. Bajcsy, "Turbo source coding: A noise-robust approach to data compression," in IEEE Data Compression Conf., Snowbird, UT, Apr. 2002, p. 465.
33. J. Muramatsu, "Secret key agreement from correlated source outputs using LDPC matrices," IEICE Trans. Fundamentals, vol. E89-A, pp. 2036-2046, Jul. 2006.
34. S. Nitinawarat, "Secret key generation for correlated Gaussian sources," in Proc. Allerton Conf. Commun., Control, and Computing, Monticello, IL, Sep. 2007, pp. 1054-1058.
35. S. Nitinawarat and P. Narayan, "Secret key generation for correlated Gaussian sources," IEEE Trans. Inf. Theory, 2011, to be published.
36. W. W. Peterson and E. J. Weldon, Error-Correcting Codes, 2nd ed. Cambridge, MA: MIT Press, 1972.
37. S. S. Pradhan and K. Ramchandran, "Distributed source coding using syndromes (DISCUS): Design and construction," IEEE Trans. Inf. Theory, vol. 49, no. 3, pp. 626-643, Mar. 2003.
38. R. Renner and S. Wolf, "New bounds in secret-key agreement: The gap between formation and secrecy extraction," in Proc. EUROCRYPT, 2003, vol. 2656, Lecture Notes in Computer Science, pp. 562-577.
39. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
40. T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge, U.K.: Cambridge Univ. Press, 2008.
41. S. Roman, Introduction to Coding and Information Theory. New York: Springer, 1996.
42. R. M. Roth, Introduction to Coding Theory. Cambridge, U.K.: Cambridge Univ. Press, 2006.
43. D. Schonberg, K. Ramchandran, and S. S. Pradhan, "Distributed code constructions for the entire Slepian-Wolf rate region for arbitrarily correlated sources," in Proc. IEEE Data Compression Conf., Snowbird, UT, Mar. 2004, pp. 292-301.
44. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. 27, no. 5, pp. 533-547, Sep. 1981.
45. A. Thangaraj, S. Dihidar, A. R. Calderbank, S. McLaughlin, and J. M. Merolla, "Capacity achieving codes for the wiretap channel with applications to quantum key distribution," e-print cs. IT/0411003, 2004.
46. A. Thangaraj, S. Dihidar, A. R. Calderbank, S. McLaughlin, and J. M. Merolla, "Applications of LDPC codes to the wiretap channel," IEEE Trans. Inf. Theory, vol. 53, no. 8, pp. 2933-2945, Aug. 2007.
47. R. Wilson, D. Tse, and R. Scholtz, "Channel identification: Secret sharing using reciprocity in ultrawideband channels," IEEE Trans. Inf. Foren. Secur., vol. 2, no. 3, pp. 364-375, Sep. 2007.
48. A. D. Wyner, "Recent results in the Shannon theory," IEEE Trans. Inf. Theory, vol. 20, no. 1, pp. 2-10, Jan. 1974.
49. C. Ye and P. Narayan, "Secret key and private key constructions for simple multiterminal source models," in Proc. IEEE Int. Symp. Inf. Theory, Adelaide, Australia, Sep. 2005, pp. 2133-2137.
50. C. Ye and P. Narayan, "Secret key constructions for simple multiterminal source models," in Proc. Inf. Theory and ApplicationsWorkshop, San Diego, CA, Feb. 2006.
51. C. Ye, A. Reznik, and Y. Shah, "Extracting secrecy from jointly Gaussian random variables," in Proc. Int. Symp. Inf. Theory, Jul. 2006, pp. 2593-2597.
52. C. Ye, S. Mathur, A. Reznik, Y. Shah, W. Trappe, and N. Mandayam, "Information-theoretically secret key generation for fading wireless channels," IEEE Trans. Inf. Foren. Secur., vol. 5, no. 2, pp. 240-254, Jun. 2010.
53. R. W. Yeung, Information Theory and Network Coding. New York: Springer, 2008.