Secure Distributed Storage: Optimal Trade-Off Between Storage Rate and Privacy Leakage

Remi A. Chou, Jorg Kliewer

Research output: Contribution to journalArticlepeer-review


Consider the problem of storing data in a distributed manner over T servers. Specifically, the data needs to (i) be recoverable from any τ servers, and (ii) remain private from any z colluding servers, where privacy is quantified in terms of mutual information between the data and all the information available at any z colluding servers. For this model, our main results are (i) the fundamental trade-off between storage size and the level of desired privacy, and (ii) the optimal amount of local randomness necessary at the encoder. As a byproduct, our results provide an optimal lower bound on the individual share size of ramp secret sharing schemes under a more general leakage symmetry condition than the ones previously considered in the literature.

Original languageEnglish (US)
Pages (from-to)3658-3668
Number of pages11
JournalIEEE Transactions on Information Theory
Issue number5
StatePublished - May 1 2024

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


  • information leakage
  • optimal share size
  • privacy
  • ramp secret sharing
  • Secret sharing


Dive into the research topics of 'Secure Distributed Storage: Optimal Trade-Off Between Storage Rate and Privacy Leakage'. Together they form a unique fingerprint.

Cite this