Lower Bounds for Subset Cover Based Broadcast Encryption
From MaRDI portal
Publication:3506392
Recommendations
Cites work
- A Revocation Scheme with Minimal Storage at Receivers
- Advances in Cryptology - ASIACRYPT 2003
- Advances in Cryptology – CRYPTO 2004
- Applied Cryptography and Network Security
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- Generic Transformation for Scalable Broadcast Encryption Schemes
- scientific article; zbMATH DE number 177621 (Why is no real title available?)
- scientific article; zbMATH DE number 1303146 (Why is no real title available?)
- scientific article; zbMATH DE number 1024079 (Why is no real title available?)
- scientific article; zbMATH DE number 1942412 (Why is no real title available?)
- scientific article; zbMATH DE number 1842485 (Why is no real title available?)
- Information Security
- One-Way Chain Based Broadcast Encryption Schemes
Cited in
(7)- Complete tree subset difference broadcast encryption scheme and its analysis
- scientific article; zbMATH DE number 2079372 (Why is no real title available?)
- Tree based symmetric key broadcast encryption
- Group rekeying in the exclusive subset-cover framework
- An Optimal Subset Cover for Broadcast Encryption
- Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient Instantiations
- \textit{Ad hoc} broadcast, trace, and revoke -- plus time-space trade-offs for attribute-based encryption
This page was built for publication: Lower Bounds for Subset Cover Based Broadcast Encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506392)