Secure Cooperative Regenerating Codes for Distributed Storage Systems. (arXiv:1210.3664v1 [cs.IT])

from cs.IT updates on arXiv.org http://arxiv.org/abs/1210.3664

Regenerating codes enable trading off repair bandwidth for storage in
distributed storage systems (DSS). Due to their distributed nature, these
systems are intrinsically susceptible to attacks, and they may be susceptible
to multiple node failures. This paper analyzes storage systems that employ
cooperative regenerating codes that are robust to (passive) eavesdroppers. The
analysis is divided into two parts, studying both minimum bandwidth and minimum
storage cooperative regenerating scenarios. First, the secrecy capacity of
minimum bandwidth cooperative regenerating codes is characterized. Second, for
minimum storage cooperative regenerating codes, a secure file size upper bound
and achievability results are provided. These results establish the secrecy
capacity for the minimum storage scenario for certain special cases. In all
scenarios, the achievability results correspond to exact repair, and secure
file size upper bounds are obtained using mincut analyses over a suitable
secrecy graph representation of DSS. The main achievability argument is based
on appropriate precoding of the data to eliminate the information at the
eavesdropper.

Advertisements

发表评论

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / 更改 )

Twitter picture

You are commenting using your Twitter account. Log Out / 更改 )

Facebook photo

You are commenting using your Facebook account. Log Out / 更改 )

Google+ photo

You are commenting using your Google+ account. Log Out / 更改 )

Connecting to %s