We deal with the revocation scheme such that the revoked receivers should not be able to obtain available information when a center broadcasts data to all receivers. We propose a new revocation scheme with minimal message length for stateless receivers, where the receivers do not update their state from session to session. The proposed scheme requires storage of 1/2 log~2 n―1/2 log n+2. keys at the receiver and a message length of at most r+1. The main contribution of the proposed scheme is to reduce the message length. Namely, the proposed scheme minimizes the number of subsets which the non-revoked receivers are partitioned.
展开▼
机译：我们处理撤销方案，以便当中心将数据广播到所有接收者时，被撤销的接收者不应该能够获得可用的信息。我们为无状态接收者提出了一种具有最小消息长度的新吊销方案，其中，接收者不会在会话之间更新其状态。提出的方案需要存储1/2 log〜2 n〜1/2 log n + 2。接收器上的键，消息长度最大为r + 1。所提出的方案的主要贡献是减少消息长度。即，所提出的方案最小化了未被撤销的接收机被划分的子集的数量。
展开▼
