arXiv (All)
open access
Hierarchical Secure Distributed Linearly Separable Computation with Arbitrary Heterogeneous Data Assignment
This paper studies secure distributed linearly separable computation over a three-layer hierarchical network, where clustered users communicate with a central server through relays. The server aims to recover Kc linear combinations of K intermediate outcomes, where each intermediate outcome is a sep
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
- Hierarchical Secure Distributed Linearly Separable Computation with Arbitrary Heterogeneous Data Assignment#1108737
- Randomized k-server in polynomial time#236491
- Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement#665979
- Progressive-Resolution Secure Aggregation for Federated Learning#1160983
- Progressive-Resolution Secure Aggregation for Federated Learning#1155630
Record · ID 1117804
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