An efficient revocation scheme with minimal message length for stateless receivers

Abstract

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 12 log2 n-12 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. © 2003 Springer-Verlag Berlin Heidelberg.