Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient Instantiations

DOI10.1007/11593447_6zbMath1154.94370OpenAlexW1505866941MaRDI QIDQ5451066

Nuttapong Attrapadung, Hiroshi Imai

Publication date: 18 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11593447_6

zbMATH Keywords

Broadcast EncryptionOptimal Key StorageRevocation SchemeSubset-cover

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Public Key Broadcast Encryption with Low Number of Keys and Constant Decryption Time ⋮ Conjunctive Broadcast and Attribute-Based Encryption ⋮ Efficient Dynamic Broadcast Encryption and Its Extension to Authenticated Dynamic Broadcast Encryption

This page was built for publication: Graph-Decomposition-Based Frameworks for Subset-Cover Broadcast Encryption and Efficient Instantiations