Tree based symmetric key broadcast encryption
From MaRDI portal
Publication:491159
DOI10.1016/J.JDA.2015.05.010zbMath1381.94062OpenAlexW624096570WikidataQ121080409 ScholiaQ121080409MaRDI QIDQ491159
Sanjay Bhattacherjee, Palash Sarkar
Publication date: 24 August 2015
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2015.05.010
probabilistic analysistreeslayeringbroadcast encryptionsubset differencecyclotomic cosetsgeneral arityheader lengthtransmission overhead
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Establishing the broadcast efficiency of the subset difference revocation scheme
- Complete tree subset difference broadcast encryption scheme and its analysis
- On the mean number of encryptions for tree-based broadcast encryption schemes
- Lower Bounds for Subset Cover Based Broadcast Encryption
- Ternary Subset Difference Method and Its Quantitative Analysis
- A Revocation Scheme with Minimal Storage at Receivers
- Concrete Analysis and Trade-Offs for the (Complete Tree) Layered Subset Difference Broadcast Encryption Scheme
- Advances in Cryptology – CRYPTO 2004
- One-Way Chain Based Broadcast Encryption Schemes
This page was built for publication: Tree based symmetric key broadcast encryption