Name
Abstract | ||
|---|---|---|
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
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\ell $ </tex-math></inline-formula>
nodes. An
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$(n,k,d,\ell )$ </tex-math></inline-formula>
secure exact-repair regenerating code is an
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$(n,k,d)$ </tex-math></inline-formula>
exact-repair regenerating code that is secure under this eavesdropping model. It has been shown that for some parameters
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$(n,k,d,\ell )$ </tex-math></inline-formula>
, 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
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\hat {\ell }$ </tex-math></inline-formula>
on the number of wiretap nodes, and show that this bound is tight for the case
<inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$k = d = n-1$ </tex-math></inline-formula>
. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TIT.2019.2942315 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Maintenance engineering,Secure storage,Encoding,Decoding,Security,Bandwidth,Eavesdropping | Journal | 66 |
Issue | ISSN | Citations |
1 | 0018-9448 | 2 |
PageRank | References | Authors |
0.37 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fangwei Ye | 1 | 6 | 1.10 |
| Shiqiu Liu | 2 | 14 | 3.28 |
| Kenneth W. Shum | 3 | 544 | 56.37 |
| Raymond W. Yeung | 4 | 8 | 1.80 |