Technical Program

Paper Detail

Paper IDM.3.2
Paper Title Secure Distributed Storage: Rate-Privacy Trade-Off and XOR-Based Coding Scheme
Authors Remi Chou, Wichita State University, United States; Joerg Kliewer, New Jersey Institute of Technology, United States
Session M.3: Codes for Distributed Storage III
Presentation Lecture
Track Coding for Storage and Memories
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
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.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!