An efficient revocation scheme with minimal message length for stateless receivers

  • Authors:
  • Yong Ho Hwang;Chong Hee Kim;Pil Joong Lee

  • Affiliations:
  • Department of Electronic and Electrical Engineering, Pohang University of Science & Technology, Kyoungbuk, Rep. of Korea;Department of Electronic and Electrical Engineering, Pohang University of Science & Technology, Kyoungbuk, Rep. of Korea;Department of Electronic and Electrical Engineering, Pohang University of Science & Technology, Kyoungbuk, Rep. of Korea

  • Venue:
  • ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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 1/2 log2 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.