Revocation and Tracing Schemes for Stateless Receivers
- Dalit NaorAffiliated withIBM Almaden Research Center
- , Moni NaorAffiliated withDepartment of Computer Science and Applied Math, Weizmann Institute
- , Jeff LotspiechAffiliated withIBM Almaden Research Center
We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of the message. We concentrate on the stateless receiver case, where the users do not (necessarily) update their state from session to session. We present a framework called the Subset-Cover framework, which abstracts a variety of revocation schemes including some previously known ones. We provide sufficient conditions that guarantees the security of a revocation algorithm in this class.
We describe two explicit Subset-Cover revocation algorithms; these algorithms are very flexible and work for any number of revoked users. The schemes require storage at the receiver of log N and 1/2 log2 N keys respectively (N is the total number of users), and in order to revoke r users the required message lengths are of r log N and 2r keys respectively. We also provide a general traitor tracing mechanism that can be integrated with any Subset-Cover revocation scheme that satisfies a “bifurcation property”. This mechanism does not need an a priori bound on the number of traitors and does not expand the message length by much compared to the revocation of the same set of traitors.
The main improvements of these methods over previously suggested methods, when adopted to the stateless scenario, are: (1) reducing the message length to O(r) regardless of the coalition size while maintaining a single decryption at the user’s end (2) provide a seamless integration between the revocation and tracing so that the tracing mechanisms does not require any change to the revocation algorithm.
KeywordsBroadcast Encryption Revocation scheme Tracing scheme Copyright Protection
- Revocation and Tracing Schemes for Stateless Receivers
- Book Title
- Advances in Cryptology — CRYPTO 2001
- Book Subtitle
- 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19–23, 2001 Proceedings
- pp 41-62
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Broadcast Encryption
- Revocation scheme
- Tracing scheme
- Copyright Protection
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.