arXiv (All)
open access
Secret key-distribution over networks with node-based adversarial errors
We study the multiple key-cast problem in network coding under active node-based adversaries. In multiple key-cast, a source generates independent secret keys to be securely and reliably delivered to designated terminal subsets. The network adversary can observe \(\ell_o\) nodes, inject additive or
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
- PASTA: A Patch-Agnostic Twofold-Stealthy Backdoor Attack on Vision Transformers#123967
- Bootstrapping Mutual Attestation with Kleene's Second Recursion Theorem#793882
- Bootstrapping Mutual Attestation with Kleene's Second Recursion Theorem#789863
- Let the Carrier Carry the Attack: Preserving the Subject in Adversarial Image Generation#1144890
- The Transmitter Trojan Channel: Achievable Rates and Error Exponents#1116030
Record · ID 1142719
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