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

DOI10.1007/11593447_6MaRDI QIDQ5451066zbMATH OpenOpenAlexFDO

Authors Nuttapong Attrapadung, Hideki 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)

Recommendations

• Information Security
• Lower Bounds for Subset Cover Based Broadcast Encryption
• An Optimal Subset Cover for Broadcast Encryption
• Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
• Fully Collusion Secure Dynamic Broadcast Encryption with Constant-Size Ciphertexts or Decryption Keys

Cited in

(5)

• Conjunctive Broadcast and Attribute-Based Encryption
• Information Security and Privacy
• Public Key Broadcast Encryption with Low Number of Keys and Constant Decryption Time
• Information Security
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5451066)