When Is a Function Securely Computable?

IEEE Transactions on Information Theory(2011)

引用 62|浏览1
暂无评分
摘要
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.
更多
查看译文
关键词
single-letter characterization,new secrecy generation model,correlated signal,function computation,public communication,secure computability.,function securely computable,omniscience,secret key capacity,maximum common function,balanced coloring lemma,index terms aided secret key,secure computation,channel capacity,entropy
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要