Group rekeying in the exclusive subset-cover framework
From MaRDI portal
Publication:526907
DOI10.1016/J.TCS.2017.03.046zbMATH Open1370.68079OpenAlexW2606496862MaRDI QIDQ526907FDOQ526907
Authors: Minmin Liu, Jing Liu, Changji Wang, Shao-Wen Yao
Publication date: 15 May 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.03.046
Recommendations
- Applied Cryptography and Network Security
- Grafting key trees: efficient key management for overlapping groups
- Group rekeying with limited unicast recovery
- Provably secure group key management scheme based on proxy re-encryption with constant public bulletin size and key derivation time
- scientific article; zbMATH DE number 1842485
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimizing deletion cost for secure multicast key management
- Title not available (Why is that?)
- Optimal tree structures for group key tree management considering insertion and deletion cost
- Lower Bounds for Subset Cover Based Broadcast Encryption
- Approximately optimal trees for group key management with batch updates
- Efficient Multicast Key Distribution Using HOWP-Based Dynamic Group Access Structures
Cited In (3)
This page was built for publication: Group rekeying in the exclusive subset-cover framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526907)