arXiv (All)
open access
Randomized Lifting for One-Way Number-on-Forehead Communication
We prove a lifting theorem from two-party public-coin one-way communication to multiparty public-coin one-way number-on-forehead (NOF) communication. For every fixed $k\ge2$ and prime $q>2k$, there is a generalized inner product gadget $\GIP_{q,r}^k:(\F_q^r)^k\to\F_q$ with $r=O_k(q/\log q)$ such tha
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
- Location Privacy in Cellular Networks#1027245
- Secure multi-party communication with quantum key distribution managed by … — Los Alamos National Security, Llc (US8929554B2)#607381
- Generalized Attack Protection in the Kirchhoff-Law-Johnson-Noise Secure Key Exchanger#295569
- Stabilizer-Public-Key Authentication: Partial Prediction Bounds and Limits of Key Reuse#1034851
- Double DQN-based secrecy energy efficiency and fairness performance in IRS-assisted NOMA systems with friendly jamming.#334929
Record · ID 1116873
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