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

Document Type

Article

Publication Date

5-1-2024

Abstract

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.

Identifier

85187395510 (Scopus)

Publication Title

IEEE Transactions on Information Theory

External Full Text Location

https://doi.org/10.1109/TIT.2024.3373780

e-ISSN

15579654

ISSN

00189448

First Page

3658

Last Page

3668

Issue

5

Volume

70

Grant

CCF-2201824

Fund Ref

National Science Foundation

This document is currently not available here.

Share

COinS