Lower Bounds for Subset Cover Based Broadcast Encryption

DOI10.1007/978-3-540-68164-9_23zbMath1142.94330OpenAlexW1529410469MaRDI QIDQ3506392

Per Austrin, Gunnar Kreitz

Publication date: 13 June 2008

Published in: Progress in Cryptology – AFRICACRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68164-9_23

zbMATH Keywords

lower boundskey revocationBroadcast EncryptionSubset Cover

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Complete tree subset difference broadcast encryption scheme and its analysis ⋮ Tree based symmetric key broadcast encryption ⋮ Group rekeying in the exclusive subset-cover framework

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Revocation Scheme with Minimal Storage at Receivers
• Advances in Cryptology – CRYPTO 2004
• One-Way Chain Based Broadcast Encryption Schemes
• Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
• Generic Transformation for Scalable Broadcast Encryption Schemes
• Information Security
• Applied Cryptography and Network Security
• Advances in Cryptology - ASIACRYPT 2003

This page was built for publication: Lower Bounds for Subset Cover Based Broadcast Encryption