3 problems
- 0 votes0 replies0 views
The secure coded caching–index coding gluing conjecture
Secure coded caching involves a server storing messages and users with local caches who request messages over a broadcast link, while secure index coding involves an adversary that…
- 0 votes0 replies0 views
The larger-solution-space explanation for CSSM's secrecy sum-rate advantage
The paper compares the secrecy sum-rates of the proposed algorithms with CSSM, a competing method, and observes that CSSM performs better in the reported experiments. Larger-soluti…
- 0 votes0 replies0 views
Secure throughput scaling for most nodes without key sharing
Secure throughput conjecture. For any given and for , per-node secure throughput of