Secure distributed storage: rate-privacy trade-off and XOR-based coding scheme

No Thumbnail Available
Issue Date
2020-06
Authors
Chou, Rémi
Kliewer, Jorg
Advisor
Citation

R. A. Chou and J. Kliewer, "Secure Distributed Storage: Rate-Privacy Trade-Off and XOR-Based Coding Scheme," 2020 IEEE International Symposium on Information Theory (ISIT), Los Angeles, CA, USA, 2020, pp. 605-610

Abstract

We consider the problem of storing data in a distributed manner over T servers. We require the data (i) to be recoverable from the T servers, and (ii) to remain private from any T -1 colluding servers, where privacy is quantified in terms of mutual information between the data and all the information available at the T -1 colluding servers. For this model, we determine (i) the fundamental trade-off between storage size and the level of desired privacy, (ii) the optimal amount of local randomness necessary at the encoder, and (iii) an explicit low-complexity coding scheme that solely relies on XOR operations and that asymptotically (with the data size) matches the fundamental limits found.

Table of Content
Description
Click on the DOI link to access the article (may not be free).
publication.page.dc.relation.uri