An efficient revocation scheme with minimal message length for stateless receivers
SCIE
SCOPUS
- Title
- An efficient revocation scheme with minimal message length for stateless receivers
- Authors
- Hwang, YH; Kim, CH; Lee, PJ
- Date Issued
- 2003-01
- Publisher
- SPRINGER-VERLAG BERLIN
- 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 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.
- URI
- https://oasis.postech.ac.kr/handle/2014.oak/18364
- DOI
- 10.1007/3-540-45067-X_32
- ISSN
- 0302-9743
- Article Type
- Article
- Citation
- LECTURE NOTES IN COMPUTER SCIENCE, vol. 2727, page. 377 - 386, 2003-01
- Files in This Item:
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.