Secure computing

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 2612-2616

  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

PUBLIC COMMUNICATIONS; SECRET KEY; SECURE COMPUTATION; SUFFICIENT CONDITIONS;

CRYPTOGRAPHY;

INFORMATION THEORY;

EID: 77955694833     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513720     Document Type: Conference Paper

References (18)

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. R. Ahlswede and I. Csiszár, "On the oblivious transfer capacity," ISIT, Proceedings of the IEEE International Symposium on Information Theory, pp. 2061-2064, June 2007.
3. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Channels. Academic Press, 1981.
4. I. Csiszár, "Almost independence and secrecy capacity," Prob. Pered. Inform., vol. 32, no. 1, pp. 48-57, 1996.
5. 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.
6. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inform. Theory, vol. 50, no. 12, pp. 3047-3061, 2004.
7. -, "Secrecy capacities for multiterminal channel models," IEEE Trans. Inform. Theory, vol. 54, no. 6, pp. 2437-2452, 2008.
8. R. G. Gallager, "Finding parity in a simple broadcast nework," IEEE Trans. Inform. Theory, vol. 34, no. 2, pp. 176-180, 1988.
9. A. Giridhar and P. Kumar, "Computing and communicating functions over sensor networks," IEEE Journ. on Select. Areas in Commun., vol. 23, no. 4, pp. 755-764, 2005.
10. J. Körner and K. Marton, "How to encode the modulo-two sum of binary sources," IEEE Trans. Inform. Theory, vol. 25, no. 2, pp. 219-221, 1979.
11. N. Ma, P. Ishwar and P. Gupta, "Information-theoretic bounds for multi-round function computation in collocated networks," IEEE International Symposium on Information Theory, Coex, Seoul, Korea, June - July 2009.
12. U. M. Maurer, "Secret key agreement by public discussion from common information," IEEE Trans. Inform. Theory, vol. 39, pp. 733-742, May 1993.
13. U. M. Maurer, Communications and Cryptography: Two sides of One Tapestry, R.E. Blahut et al., Eds. Norwell, MA: Kluwer, 1994, ch. 26, pp. 271-285.
14. A. Nascimento and A. Winter, "On the oblivious transfer capacity of noisy correlations," IEEE International Symposium on Information Theory, pp. 1871-1875, July 2009.
15. A. Orlitsky and A. E. Gamal, "Communication with secrecy constraints," STOC, pp. 217-224, 1984.
16. A. Orlitsky and J. R. Roche, "Coding for computing," IEEE Trans. Inform. Theory, vol. 47, no. 3, pp. 903 - 917, 2001.
17. H. Tyagi, P. Narayan and P. Gupta, "Secure Computing," IEEE Trans. Inform. Theory, to be submitted.
18. A. C. Yao, "Some complexity questions related to distributive computing," Proc. 11th Ann. Symp. on Theory of Computing, pp. 209-213, May 1979.