Establishing the broadcast efficiency of the Subset Difference Revocation Scheme

Authors:
Thomas Martin;Keith M. Martin;Peter Wild
Affiliations:
Centre for Information and Security Systems Research, BT, London, UK;Information Security Group, Royal Holloway, University of London, Egham, UK;Information Security Group, Royal Holloway, University of London, Egham, UK
Venue:
Designs, Codes and Cryptography
Year:
2009

Citing 5
Cited 1

Broadcast encryption

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Secure group communications using key graphs

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
The LSD Broadcast Encryption Scheme

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
A Revocation Scheme with Minimal Storage at Receivers

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A broadcast encryption scheme with free-riders but unconditional security

DRMTICS'05 Proceedings of the First international conference on Digital Rights Management: technologies, Issues, Challenges and Systems

Complete tree subset difference broadcast encryption scheme and its analysis

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

When an organisation chooses a system to make regular broadcasts to a changing user base, there is an inevitable trade off between the number of keys a user must store and the number of keys used in the broadcast. The Complete Subtree and Subset Difference Revocation Schemes were proposed as efficient solutions to this problem. However, all measurements of the broadcast size have been in terms of upper bounds on the worst-case. Also, the bound on the latter scheme is only relevant for small numbers of revoked users, despite the fact that both schemes allow any number of such users. Since the broadcast size can be critical for limited memory devices, we aid comparative analysis of these important techniques by establishing the worst-case broadcast size for both revocation schemes.