Title :
When Is a Function Securely Computable?
Author :
Tyagi, Himanshu ; Narayan, Prakash ; Gupta, Piyush
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Maryland, College Park, MD, USA
Abstract :
A subset of a set of terminals that observe correlated signals seek to compute a function of the signals using public communication. It is required that the value of the function be concealed from an eavesdropper with access to the communication. We show that the function is securely computable if and only if its entropy is less than the capacity of a new secrecy generation model, for which a single-letter characterization is provided.
Keywords :
correlation methods; signal processing; telecommunication security; correlated signal; public communication; secrecy generation model; single-letter characterization; Amplitude shift keying; Computational modeling; Context modeling; Entropy; Information theory; Materials; Protocols; Aided secret key; balanced coloring lemma; function computation; maximum common function; omniscience; secret key capacity; secure computability;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2011.2165807
