论文标题
保护分布式存储系统的安全决定量代码
Secure Determinant Codes for Distributed Storage Systems
论文作者
论文摘要
本文研究了带有参数$（n，k = d，d，\ ell）$的分布式存储系统（DSSS）的信息理论的安全精确修复代码（DSSS）。我们考虑具有$ n $节点的分布式存储系统，其中可以从$ k = D $节点的任何子集中恢复原始数据，并且可以从任何$ d $ helper节点的内容中检索任何节点的内容。此外，我们考虑了两种保密的约束，即I型，在其中，该消息仍然安全地与窃听者相抵触，可访问最多$ \ ell $ nodes和type-ii的任何子集的内容，在该内容中，该信息仍然可以安全地与窃听的窃听者，他们可以从所有可能的nodes中观察到固定的node node node node node unde use $ seell $ seeld $ sepl und $ sepl und的窃听数据。提出了针对I型和II型保密约束的两类安全决定符代码。每个提出的代码都可以为任何系统参数设计用于一系列每节点存储容量和修复带宽。对于I型和II类安全性，它们导致了两个可实现的保密权衡。
The information-theoretic secure exact-repair regenerating codes for distributed storage systems (DSSs) with parameters $(n,k=d,d,\ell)$ are studied in this paper. We consider distributed storage systems with $n$ nodes, in which the original data can be recovered from any subset of $k=d$ nodes, and the content of any node can be retrieved from those of any $d$ helper nodes. Moreover, we consider two secrecy constraints, namely, Type-I, where the message remains secure against an eavesdropper with access to the content of any subset of up to $\ell$ nodes, and Type-II, in which the message remains secure against an eavesdropper who can observe the incoming repair data from all possible nodes to a fixed but unknown subset of up to $\ell$ compromised nodes. Two classes of secure determinant codes are proposed for Type-I and Type-II secrecy constraints. Each proposed code can be designed for a range of per-node storage capacity and repair bandwidth for any system parameters. They lead to two achievable secrecy trade-offs, for Type-I and Type-II security.
