Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 3 min ago
PreprintarXiv licencearXiv

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

  • Maryam Keshvari
  • Remi A. Chou
Open at sourcePDFDOICite

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 L servers such that any subset of at least t servers can reconstruct the file, while any subset of at most z 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 n bits with each server. For a fixed key length n, 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.

Related

  1. The Price of Privacy: Randomness Complexity of Graph-Based Multi-Secret Sharing
    Piotr Marszalik
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  2. Differentially Private Distributed Optimization via the Intrinsic Randomness of Zeroth-Order Estimators: Sampling Geometry, Convergence, and Privacy Guarantees
    Jiajun Wang, Yujie Tang
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. Privacy-Constrained Function Computation in Distributed Databases
    Vamoua Yachongka, Rémi A. Chou
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  4. Weak Private Information Retrieval for Graph-based Storage under ε-privacy
    Jayesh Seshadri, Prasad Krishnan
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  5. Optimisation of distributed storage in existing district heating networks to solve hydraulic bottlenecks
    Anne-Geneviève Lemelle, Erwan Bescher, Nicolas Lamaison +3
    Energy ReportsPreprintLicence not stated1 citedOptimisation & controlHAL

Cite

BibTeXRIS
BibTeX
@misc{keshvari2026communication,
  title = {{Communication and Privacy Trade-Offs in Distributed Storage With Shared Secret Keys}},
  author = {Maryam Keshvari and Remi A. Chou},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.39112},
  eprint = {2610.39112},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.39112},
}
RIS
TY  - UNPB
TI  - Communication and Privacy Trade-Offs in Distributed Storage With Shared Secret Keys
AU  - Maryam Keshvari
AU  - Remi A. Chou
PY  - 2026
DA  - 2026/10/29
PB  - arXiv
DO  - 10.48550/arxiv.2610.39112
UR  - https://arxiv.org/abs/2610.39112
AB  - 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 L servers such that any subset of at least t servers can reconstruct the file, while any subset of at most z 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 n bits with each server. For a fixed key length n, 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.
ER  -