Group rekeying in the exclusive subset-cover framework
From MaRDI portal
Publication:526907
DOI10.1016/j.tcs.2017.03.046zbMath1370.68079OpenAlexW2606496862MaRDI QIDQ526907
Minmin Liu, Jing Liu, Shao-Wen Yao, Chang-Ji Wang
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimizing deletion cost for secure multicast key management
- Approximately optimal trees for group key management with batch updates
- Optimal tree structures for group key tree management considering insertion and deletion cost
- Lower Bounds for Subset Cover Based Broadcast Encryption
- A method for obtaining digital signatures and public-key cryptosystems
- Efficient Multicast Key Distribution Using HOWP-Based Dynamic Group Access Structures
This page was built for publication: Group rekeying in the exclusive subset-cover framework