arXiv (All)
open access
Improved lower bounds for decomposable randomized encoding
A decomposable randomized encoding (DRE) for a function $f$ allows $n$ parties, using shared randomness, to encode their individual inputs locally so that the collection of encodings reveals $f(x_1,\ldots,x_n)$ and nothing else. DREs are widely used in efficient multiparty computation. Their main co
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
- Improved lower bounds for decomposable randomized encoding#965355
- Noisy-Channel Minimum Bayes Risk Decoding#343487
- The Deterministic Broadcast Channel Revisited: A Bipartite Graph Approach#1049065
- Crossflow: Prefill-Decode Elasticity for Agentic LLM Serving#1063296
- Lossy Joint Source-Channel Coding over Unknown Channels#924586
Record · ID 1011729
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