arXiv (All)
open access
Communication and Privacy Trade-Offs in Distributed Storage With Shared Secret Keys
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Weak Private Information Retrieval for Graph-based Storage under $ε$-privacy#1345279
- On the Delay-Storage Trade-Off in Content Download from Coded Distributed Storage Systems#328650
- Privacy-preserving photo sharing based on a public key infrastructure#955357
- Communication-Oblivious Permutation and Sorting#1491317
- SFDS: Selective File Disclosure System#361408
Record · ID 1490182
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive