论文标题
具有不同安全条件的网络功能计算
Network Function Computation With Different Secure Conditions
论文作者
论文摘要
在本文中，我们在不同的安全条件下在具有多个源节点的网络和一个单个接收器节点上调查了功能计算问题，该网络渴望所有源消息的函数而不会出错。 Viretapper可以访问网络的某些边缘。根据不同的实际要求，我们将两个安全条件分别称为安全和用户安全。这里有关的主要参数是计算率，这是目标函数的平均时间，可以安全地计算或用户安全地计算而无需一次使用网络。在安全的情况下，一个比上一个的新上限更紧密的算术和算法函数和任意网络。此外，我们表明，对于树状网络，改进的上限严格紧密。在用户安全案例中，我们为存在用户安全网络代码的存在提供了足够和必要的条件，并为计算能力获得了上限。
In this paper, we investigate function computation problems under different secure conditions over a network with multiple source nodes and a single sink node which desires a function of all source messages without error. A wiretapper has access to some edges of the network. Based on different practical requirements, we consider two secure conditions named as secure and user secure respectively. The main parameter concerned here is the computing rate, which is the average times of the target function that can be computed securely or user securely without error for one use of the network. In the secure case, a new upper bound which is tighter than the previous one is provided for arithmetic sum functions and arbitrary networks. Moreover, we show that the improved upper bound is strictly tight for tree-like networks. In the user secure case, we give a sufficient and necessary condition for the existence of user secure network codes and obtain an upper bound for the computation capacity.
