arXiv (All)
open access
Weak Private Information Retrieval for Graph-based Storage under $ε$-privacy
The problem of Private Information Retrieval (PIR) across graph-based replicated systems has seen a surge of interest in recent literature. In such systems, servers are modeled as the vertices of a graph, and each file is represented by an edge connecting the pair of servers that store it. While pre
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#394315
- Local Private Information Retrieval for Graph-Based Replicated Systems#622426
- SLFS: a Flexible, Low-Cost Distributed File System Using Serverless Designs#332500
- Latency-Optimal Geo-Distributed Storage over Structured Networks#972168
- Icicle: Scalable Metadata Indexing and Real-Time Monitoring for HPC File Systems#10320
Record · ID 1345279
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