betaFeedback

WorksComputer Science

Communication and Privacy Trade-Offs in Distributed Storage With Shared Secret Keys

Abstract

We study distributed storage over public communication channels where privacy is realized using shared secret keys. Specifically, a user wishes to store a file across LL servers such that any subset of at least tt servers can reconstruct the file, while any subset of at most zz colluding servers learns no more than a fraction αα of the file. Unlike classical secret-sharing models that assume secure communication channels between the user and each server, we consider a setting where all transmissions occur over a public channel and the user shares an individual secret key of length nn bits with each server. For a fixed key length nn, we characterize the trade-off between the privacy leakage parameter αα and the maximum file size that can be securely stored. Additionally, we determine the minimum local randomness, public communication, and storage required to achieve this optimal trade-off.

Paper details

vlnc:W_dqwtytky
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…