Secret key agreement by reliability information of signals in Gaussian Maurer's Model

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 727-731

  Naito, Masashi ^a   Watanabe, Shun ^b   Matsumoto, Ryutaroh ^b   Uyematsu, Tomohiko ^b  

^a NAGOYA UNIVERSITY   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GAUSSIAN; GAUSSIAN CHANNELS; INTERNATIONAL SYMPOSIUM; LOWER BOUNDS; RECEIVED SIGNALS; RELIABILITY INFORMATION; SECRET KEY AGREEMENT; SECRET KEYS;

CONTROL THEORY; CYBERNETICS; INFORMATION THEORY; TECHNICAL PRESENTATIONS; TRELLIS CODES;

LAWS AND LEGISLATION;

EID: 52349105079     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595082     Document Type: Conference Paper

References (14)

1. A. D. Wyner, "The wire-tap channel," Bell Syst. Tech. J., vol. 54, no. 8, pp. 1355-1387, 1975.
2. S. K. Leung-Yan-Cheong, "Multi-user and wire-tap channels including feedback," Ph.D. dissertation, Stanford University, 1976.
3. S. K. Leung-Yan-Cheong and M. E. Hellman, "The gaussian wire-tap channel," IEEE Trans. Inform. Theory, vol. 24, no. 4, pp. 451-456, July 1978.
4. I. Csiszár and J. Körner, "Broadcast channels with confidential messages," IEEE Trans. Inform. Theory, vol. 24, no. 3, pp. 339-348, May 1979.
5. U. Maurer, "Secret key agreement by public discussion from common information," IEEE Trans. Inform. Theory, vol. 39, no. 3, pp. 733-742, May 1993.
6. R. Ahlswede and I. Csiszar, "Common randomness in information theory and cryptography-part 1: Secret sharing," IEEE Trans. Inform. Theory, vol. 39, no. 4, pp. 1121-1132, 1993.
7. M. Naito, S. Watanabe, R. Watanabe, and T. Uyematsu, "Secret key agreement by soft-decision of signals in gaussian maurer's model," arXive:0804.2940v1.
8. J. L. Carter and M. N. Wegman, "Universal classes of hash functions," Journal of Computer and System Sciences, vol. 18, pp. 143-154, 1979.
9. D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Trans. Inform. Theory, vol. 19, no. 4, pp. 471-480, July 1973.
10. C. H. Bennett, G. Brassard, and J. M. Robert, "Privacy amplification by public discussion," SIAM Journal on Computing, vol. 17, no. 2, pp. 210-229, Apr. 1988.
11. R. Impagliazzo, L. A. Levin, and M. Luby, "Pseudo-random generation from one-way function," in Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC'89). ACM press, 1989, pp. 12-24.
12. C. H. Bennett, G. Brassard, C. Crepeau, and U. Maurer, "Generalized privacy amplification," IEEE Trans. on Inform. Theory, vol. 41, no. 6, pp. 1915-1923, Nov. 1995.
13. J. Muramatsu, T. Uyematsu, and T. Wadayama, "Low-density paritycheck matrices for coding of correlated sources," IEEE Trans. Inform. Theory, vol. 51, no. 10, pp. 3645-3654, October 2005.
14. T. P. Coleman, A. H. Lee, M. Medard, and M. Effros, "Low-complexity approaches to Slepian & Wolf near-lossless distributed data compression," IEEE Trans. Inform. Theory, vol. 52, no. 8, pp. 3546-3561, August 2006.