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
fDate :
July 31 2011-Aug. 5 2011
Abstract :
A subset of a set of terminals that observe correlated signals seek to compute a given function of the signals using public communication. It is required that the value of the function be kept secret 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 “aided secret key” capacity of an associated secrecy generation model, for which a single-letter characterization is provided.
Keywords :
channel capacity; correlation theory; entropy; radiocommunication; security of data; telecommunication terminals; aided secret key; correlated signals; eavesdropper; entropy; public communication; secrecy generation model; single-letter characterization; terminals; Amplitude shift keying; Computational modeling; Context modeling; Cryptography; Entropy; Frequency modulation; Information theory;
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2011.6034101
