When is a function securely computable?

IEEE Transactions on Information Theory

Volumn 57, Issue 10, 2011, Pages 6337-6350

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

^a UNIVERSITY OF MARYLAND   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Aided secret key; balanced coloring lemma; function computation; maximum common function; omniscience; secret key capacity; secure computability

Indexed keywords

BALANCED COLORING LEMMA; MAXIMUM COMMON FUNCTION; OMNISCIENCE; SECRET KEY; SECURE COMPUTABILITY;

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

References (24)

1. R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography-Part I: Secret sharing," IEEE Trans. Inf. Theory, vol. 39, pp. 1121-1132, 1993.
2. R. Ahlswede and I. Csiszár, "On the oblivious transfer capacity," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), 2007, pp. 2061-2064.
3. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Channels, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press., 2011.
4. I. Csiszár, "Almost independence and secrecy capacity," Prob. Pered. Inf. , 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. Inf. Theory, vol. 46, no. 2, pp. 344-366, 2000.
6. I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, 2004.
7. I. Csiszár and P. Narayan, "Secrecy capacities for multiterminal channel models," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2437-2452, 2008.
8. P. Gács and J. Körner, "Common information is far less than mutual information," Probl. Contr. Inf. Theory, vol. 2, no. 2, pp. 149-162, 1973.
9. R. G. Gallager, "Finding parity in a simple broadcast network," IEEE Trans. Inf. Theory, vol. 34, no. 2, pp. 176-180, 1988.
10. 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, 2010.
11. A. Giridhar and P. Kumar, "Computing and communicating functions over sensor networks," IEEE J. Sel. Areas Commun., vol. 23, no. 4, pp. 755-764, 2005.
12. J. Korner and K. Marton, "How to encode the modulo-two sum of binary sources," IEEE Trans. Inf. Theory, vol. 25, no. 2, pp. 219-221, 1979.
13. M. Loeve, Probability Theory. New York: Van Nostrand, 1955, pp. 157, 28-42.
14. N. Ma, P. Ishwar, and P.Gupta, "Information-theoretic bounds formultiround function computation in collocated networks," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), 2009, pp. 2306-2310.
15. U. M. Maurer, "Secret key agreement by public discussion from common information," IEEE Trans. Inf. Theory, vol. 39, pp. 733-742, 1993.
16. U. M. Maurer, Communications and Cryptography: Two Sides of One Tapestry, R. E.Blahut,Ed. et al. Norwell, MA: Kluwer, 1994, ch. 26, pp. 271-285.
17. A. Nascimento and A. Winter, "On the oblivious transfer capacity of noisy correlations," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), 2009, pp. 1871-1875.
18. A. Orlitsky and A. El Gamal, "Communication with secrecy constraints," in Proc. ACM Symp. Theory of Comput. (STOC), 1984, pp. 217-224.
19. A. Orlitsky and J. R. Roche, "Coding for computing," IEEE Trans. Inf. Theory, vol. 47, no. 3, pp. 903-917, 2001.
20. A. D. Wyner, "Recent results in the Shannon theory," IEEE Trans. Inf. Theory, vol. 20, pp. 2-10, 1974.
21. A. C. Yao, "Some complexity questions related to distributive computing," in Proc. ACM Symp. on Theory of Comput. (STOC), 1979, pp. 209-213.
22. C. Ye, "Information Theoretic Generation of Multiple Secret Keys," Ph.D. thesis, Dept. Elect. and Comput. Eng., Univ. Maryland, College Park, 2005.
23. C. Ye and P. Narayan, "Secret key and private key constructions for simple multiterminal source models," in Proc. Int. Symp. Inf. Theory, 2005, pp. 2133-2137.
24. C. Ye and P. Narayan, "Secret key and private constructions for simple multiterminal source models," IEEE Trans. Inf. Theory, accepted for publication.