When is a function securely computable?

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 2876-2880

  Tyagi, Himanshu ^a   Narayan, Prakash ^a   Gupta, Piyush ^b  

^a UNIVERSITY OF MARYLAND   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CORRELATED SIGNALS; PUBLIC COMMUNICATIONS; SECRET KEY;

INFORMATION THEORY;

EID: 80054822091     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6034101     Document Type: Conference Paper

References (10)

1. R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography-part i: Secret sharing", IEEE Trans. Inform. Theory, vol. 39, pp. 1121-1132, 1993.
2. I. Csiszár, "Almost independence and secrecy capacity", Prob. Pered. Inform., vol. 32, no. 1, pp. 48-57, 1996.
3. I. Csiszár and J. Körner, Information theory: coding theorems for discrete memoryless channels. Academic Press, 1981.
4. I. Csiszár and P. Narayan, "Common randomness and secret key generation with a helper", IEEE Trans. Inform. Theory, vol. 46, pp. 344-366, March 2000.
5. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals", IEEE Trans. Inform. Theory, vol. 50, no. 12, pp. 3047-3061, 2004.
6. -, "Secrecy capacities for multiterminal channel models", IEEE Trans. Inform. Theory, vol. 54, no. 6, pp. 2437-2452, 2008.
7. U. M. Maurer, "Secret key agreement by public discussion from common information", IEEE Trans. Inform. Theory, vol. 39, pp. 733-742, May 1993.
8. U. M. Maurer, Communications and Cryptography: Two sides of One Tapestry, R. E. Blahut et al., Eds. ed. Norwell, MA: Kluwer, 1994, ch. 26, pp. 271-285.
9. H. Tyagi, P. Narayan, and P. Gupta, "Secure computing", Proc. Int. Symp. Inform. Theory, pp. 2612-2616, June 2010.
10. H. Tyagi, P. Narayan, and P. Gupta, "When is a function securely computable?" IEEE Trans. Inform. Theory, submitted, 2010; arXiv:1007.2945v1 [cs. IT].