论文标题
复合安全组广播：选定广播的密钥分配
Compound Secure Groupcast: Key Assignment for Selected Broadcasting
论文作者
论文摘要
考虑了复合安全的组播种问题，其中设计了$ k $接收器的关键变量，以便通过嘈杂的广播频道将发射器安全地将消息固定到$ k $接收器中的任何$ n $中。指标是密钥存储$α$（即每个消息位键变量的位数量）和广播带宽$β$（即每个消息位的广播信息位的位数）之间的信息理论权衡。 我们有三个主要结果。首先，当广播带宽被最小化时，即当$β= 1 $时，我们表明最小键存储为$α= n $。其次，当键存储最小化时，即当$α= 1 $时，我们表明广播带宽$β= \ min（n，k-n+1）$是可实现的，如果$ n = 2 $或$ k-1 $，则是最佳的（最低）。第三，当$ n = 2 $时，最佳键存储和广播带宽折衷的特征是$α+β\ geq 3，α\ geq 1，β\ geq 1 $。
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 any $N$ out of the $K$ receivers through a noiseless broadcast channel. The metric is the information theoretic tradeoff between key storage $α$, i.e., the number of bits of the key variable per message bit, and broadcast bandwidth $β$, i.e., the number of bits of the broadcast information per message bit. We have three main results. First, when broadcast bandwidth is minimized, i.e., when $β= 1$, we show that the minimum key storage is $α= N$. Second, when key storage is minimized, i.e., when $α= 1$, we show that broadcast bandwidth $β= \min(N, K-N+1)$ is achievable and is optimal (minimum) if $N=2$ or $K-1$. Third, when $N=2$, the optimal key storage and broadcast bandwidth tradeoff is characterized as $α+β\geq 3, α\geq 1, β\geq 1$.
