All Dates/Times are Australian Eastern Standard Time (AEST)

Technical Program

Paper Detail

Paper IDD2-S3-T4.2
Paper Title Compound Secure Groupcast: Key Assignment for Selected Broadcasting
Authors Hua Sun, University of North Texas, United States
Session D2-S3-T4: Information-Theoretic Security
Chaired Session: Tuesday, 13 July, 22:40 - 23:00
Engagement Session: Tuesday, 13 July, 23:00 - 23:20
Abstract The compound secure groupcast problem is considered, where the key variables at $K$ receivers are designed so that a transmitter can securely groupcast a message to {\em any} $N$ out of the $K$ receivers through a noiseless broadcast channel. The metric is the information theoretic tradeoff between key storage $\alpha$, i.e., the number of bits of the key variable per message bit, and broadcast bandwidth $\beta$, i.e., the number of bits of the broadcast information per message bit. We present two results. First, when broadcast bandwidth is minimized, i.e., when $\beta = 1$, we show that the minimum key storage is $\alpha = N$. Second, when key storage is minimized, i.e., when $\alpha = 1$, we show that broadcast bandwidth $\beta = \min(N, K-N+1)$ is achievable.