pith. sign in

arxiv: 1702.07498 · v1 · pith:UZMCJ5DCnew · submitted 2017-02-24 · 💻 cs.IT · math.IT

Secure Clustered Distributed Storage Against Eavesdroppers

classification 💻 cs.IT math.IT
keywords modelstorageclustersnodesdistributedeavesdroppernode-restrictedaccess
0
0 comments X
read the original abstract

This paper considers the security issue of practical distributed storage systems (DSSs) which consist of multiple clusters of storage nodes. Noticing that actual storage nodes constituting a DSS are distributed in multiple clusters, two novel eavesdropper models - the node-restricted model and the cluster-restricted model - are suggested which reflect the clustered nature of DSSs. In the node-restricted model, an eavesdropper cannot access the individual nodes, but can eavesdrop incoming/outgoing data for $L_c$ compromised clusters. In the cluster-restricted model, an eavesdropper can access a total of $l$ individual nodes but the number of accessible clusters is limited to $L_c$. We provide an upper bound on the securely storable data for each model, while a specific network coding scheme which achieves the upper bound is obtained for the node-restricted model, given some mild condition on the node storage size.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.