Distributed function computation with confidentiality

IEEE Journal on Selected Areas in Communications

Volumn 31, Issue 4, 2013, Pages 691-701

  Tyagi, Himanshu ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

Balanced coloring lemma; distributed computing; function computation; omniscience; secure computation

Indexed keywords

BALANCED COLORING LEMMA; CONDITIONAL ENTROPY; DISTRIBUTED FUNCTION; FUNCTION COMPUTATIONS; INTERACTIVE COMMUNICATIONS; OMNISCIENCE; PUBLIC COMMUNICATIONS; SECURE COMPUTATION;

DISTRIBUTED COMPUTER SYSTEMS;

COMMUNICATION;

EID: 84875585656     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2013.130407     Document Type: Article

References (21)

1. R. Ahlswede and I. Csisźar, "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. Csisźar, "Common randomness in information theory and cryptography-part ii: CR capacity," IEEE Trans. Inf. Theory, vol. 44, pp. 225-240, 1998. (Pubitemid 128737891)
3. C. Chan, "Multiterminal secure source coding for a common secret source," in Proc.f 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 188-195, 2011.
4. I. Csisźar, "Almost independence and secrecy capacity," Prob. Pered. Inform., vol. 32, no. 1, pp. 48-57, 1996.
5. I. Csisźar and J. K̈orner, Information theory: Coding Theorems for Discrete Memoryless Channels. 2nd Edition. Cambridge University Press, 2011.
6. I. Csisźar and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, 2004.
7. I. Csisźar and P. Narayan, "Secrecy capacities for multiterminal channel models," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2437-2452, 2008.
8. R. G. Gallager, "Finding parity in a simple broadcast nework," IEEE Trans. Inf. Theory, vol. 34, no. 2, pp. 176-180, 1988.
9. 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. (Pubitemid 40519630)
10. E. Kushilevitz and N. Nisan, Communication complexity. Cambridge University Press, 1997.
11. N. Ma, P. Ishwar, and P. Gupta, "Information-theoretic bounds for multiround function computation in collocated networks," IEEE International Symposium on Information Theory (ISIT), pp. 2306-2310, 2009.
12. M. Madiman and P. Tetali, "Information inequalities for joint distributions, with interpretations and applications," IEEE Trans. Inf. Theory, vol. 56, pp. 2699-2713, 2010.
13. U. M. Maurer, "Secret key agreement by public discussion from common information," IEEE Trans. Inf. Theory, vol. 39, pp. 733-742, 1993.
14. Communications and Cryptography: Two sides of One Tapestry, R.E. Blahut et al., Eds. ed. Norwell, MA: Kluwer, ch. 26, pp. 271-285, 1994.
15. A. Orlitsky and A. E. Gamal, "Communication with secrecy constraints," Proc. 16th Ann. Symp. on Theory of Computing, pp. 217-224, 1984.
16. A. Orlitsky and J. R. Roche, "Coding for computing," IEEE Trans. Inf. Theory, vol. 47, no. 3, pp. 903-917, 2001. (Pubitemid 32425425)
17. D. Slepian and J. Wolf, "Noiseless coding of correlated information source," IEEE Trans. Inf. Theory, vol. 19, no. 4, pp. 471-480, 1973.
18. H. Tyagi, P. Narayan, and P. Gupta, "Secure computing," Proc. Int. Symp. Inform. Theory, pp. 2612-2616, June 2010.
19. H. Tyagi, P. Narayan, and P. Gupta, "When is a function securely computable?" IEEE Trans. Inf. Theory, vol. 57, no. 10, 2011.
20. A. C. Yao, "Some complexity questions related to distributive computing," Proc. 11th Ann. Symp. on Theory of Computing, pp. 209-213, 1979.
21. A. C. Yao, "Protocols for secure computations," Proc. 23rd Ann. Symp. on Foundations of Computer Science, pp. 160-164, 1982.