CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
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
Explicit Exclusive Set Systems with Applications to Broadcast Encryption
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Collusion resistant broadcast encryption with short ciphertexts and private keys
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Generic transformation for scalable broadcast encryption schemes
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
One-Way chain based broadcast encryption schemes
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
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
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Complete tree subset difference broadcast encryption scheme and its analysis
Designs, Codes and Cryptography
| Hi-index | 0.00 |
In this paper, we prove lower bounds for a large class of Subset Cover schemes (including all existing schemes based on pseudorandom sequence generators). In particular, we show that - For small r, bandwidth is Ω(r) - For some r, bandwidth is Ω(n/log(s)) - For large r, bandwidth is n - r where n is the number of users, r is the number of revoked users, and s is the space required per user. These bounds are all tight in the sense that they match known constructions up to small constants.