The problem of exact-repair regenerating codes against eavesdropping attack is studied. The eavesdropping model we consider is that the eavesdropper has the capability to observe the data involved in the repair of a subset of $\ell $ nodes. An $(n,k,d,\ell )$ secure exact-repair regenerating code is an $(n,k,d)$ exact-repair regenerating code that is secure under this eavesdropping model. It has been shown that for some parameters $(n,k,d,\ell )$ , the associated optimal storage-bandwidth tradeoff curve, which has one corner point, can be determined. The focus of this paper is on characterizing such parameters. We establish a lower bound $\hat {\ell }$ on the number of wiretap nodes, and show that this bound is tight for the case $k = d = n-1$ .

中文翻译：

---

具有单一帕累托最优点的安全精确修复再生码

研究了针对窃听攻击的精确修复再生码问题。我们考虑的窃听模型是窃听者有能力观察修复一个子集所涉及的数据。 $\ell $ 节点。一个 $(n,k,d,\ell )$ 安全精确修复再生代码是一个 $(n,k,d)$ 精确修复重新生成在此窃听模型下安全的代码。已经证明，对于某些参数 $(n,k,d,\ell )$ ，可以确定具有一个角点的相关最佳存储带宽权衡曲线。本文的重点是表征这些参数。我们建立一个下界 $\hat {\ell }$ 在窃听节点的数量上，并表明这个界限对于这种情况是严格的 $k = d = n-1$ .