On Secure Exact-Repair Regenerating Codes With a Single Pareto Optimal Point
IEEE Transactions on Information Theory(2020)
摘要
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$
.
更多查看译文
关键词
Maintenance engineering,Secure storage,Encoding,Decoding,Security,Bandwidth,Eavesdropping
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要