When is a Function Securely Computable - Computer Science > Information TheoryReportar como inadecuado




When is a Function Securely Computable - Computer Science > Information Theory - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: A subset of a set of terminals that observe correlated signals seek tocompute a given function of the signals using public communication. It isrequired that the value of the function be kept secret from an eavesdropperwith access to the communication. We show that the function is securelycomputable if and only if its entropy is less than the -aided secret key-capacity of an associated secrecy generation model, for which a single-lettercharacterization is provided.



Autor: Himanshu Tyagi, Prakash Narayan, Piyush Gupta

Fuente: https://arxiv.org/







Documentos relacionados