Secrecy Capacity-Memory Tradeoff of Erasure Broadcast Channels

01/02/2018
by   Sarah Kamel, et al.
1

This paper derives upper and lower bounds on the secrecy capacity-memory tradeoff of a wiretap erasure broadcast channel (BC) with Kw weak receivers and Ks strong receivers, where weak receivers, respectively strong receivers, have same erasure probabilities and cache sizes. The lower bounds are achieved by schemes that meticulously combine joint cache-channel coding with wiretap coding and key-aided one-time pads. The presented upper bound holds more generally for arbitrary degraded BCs and arbitrary cache sizes. When only weak receivers have cache memories, upper and lower bounds coincide for small and large cache memories, thus providing the exact secrecy capacity-memory tradeoff for this setup. The derived bounds allow to further conclude that the secrecy capacity is positive even when the eavesdropper is stronger than all the legitimate receivers with cache memories. Moreover, they show that the secrecy capacity-memory tradeoff can be significantly smaller than its non-secure counterpart, but it grows much faster when cache memories are small. The paper also presents a lower bound on the global secrecy capacity-memory tradeoff where one is allowed to optimize the cache assignment subject to a total cache budget. It is close to the best known lower bound without secrecy constraint. For small total cache budget, the global secrecy capacity-memory tradeoff is achieved by assigning all the available cache memory uniformly over all receivers if the eavesdropper is stronger than all legitimate receivers, and it is achieved by assigning the cache memory uniformly only over the weak receivers if the eavesdropper is weaker than the strong receivers.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/07/2018

The Caching Broadcast Channel with a Wire and Cache Tapping Adversary of Type II

This paper introduces the notion of cache-tapping into the information t...
09/26/2019

Improved Lower Bounds for Pliable Index Coding using Absent Receivers

This paper studies pliable index coding, in which a sender broadcasts in...
12/06/2018

A Converse Bound for Cache-Aided Interference Networks

In this paper, an interference network with arbitrary number of transmit...
09/23/2021

Secrecy Capacity Bounds for Visible Light Communications With Signal-Dependent Noise

In physical-layer security, one of the most fundamental issues is the se...
02/01/2022

On the Capacity Achieving Input of Amplitude Constrained Vector Gaussian Wiretap Channel

This paper studies secrecy-capacity of an n-dimensional Gaussian wiretap...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.