Secure distributive storage of decentralized source data: Can interaction help?

We consider the problem of securing a distributed storage system with decentralized data, where some of the nodes are compromised by an eavesdropper. The system is formed of n storage nodes among which k nodes (k > n) have information sources. The system is required to have the “MDS property”, i.e., to allow any user to recover all the sources by contacting any k nodes. To achieve this goal, the source nodes need to disseminate their data to the other nodes in the system while revealing no information to the eavesdropper. We investigate the role of interaction between the sources in reducing the total required bandwidth. When the sources are independent, we show that interaction does not help and that there always exists an optimal non-interactive scheme.

[1]  Lawrence H. Ozarow,et al.  Wire-tap channel II , 1984, AT&T Bell Lab. Tech. J..

[2]  Ben Y. Zhao,et al.  Maintenance-Free Global Data Storage , 2001, IEEE Internet Comput..

[3]  R. Yeung,et al.  Secure network coding , 2002, Proceedings IEEE International Symposium on Information Theory,.

[4]  Robert Tappan Morris,et al.  Designing a DHT for Low Latency and High Throughput , 2004, NSDI.

[5]  Stefan Savage,et al.  Total Recall: System Support for Automated Availability Management , 2004, NSDI.

[6]  R. Yeung,et al.  Network coding theory , 2006 .

[7]  Vinod M. Prabhakaran,et al.  Decentralized erasure codes for distributed networked storage , 2006, IEEE Transactions on Information Theory.

[8]  Emina Soljanin,et al.  On Wiretap Networks II , 2007, 2007 IEEE International Symposium on Information Theory.

[9]  Emina Soljanin,et al.  Secure Network Coding for Wiretap Networks of Type II , 2009, IEEE Transactions on Information Theory.