Stateful subset cover
2006 (English)In: APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS, 2006, Vol. 3989, 178-193 p.Conference paper (Refereed)
This paper describes a method to convert stateless key revocation schemes based on the subset cover principle into stateful schemes. The main motivation is to reduce the bandwidth overhead to make broadcast encryption schemes more practical in network environments with limited bandwidth resources, such as cellular networks. This modification is not fully collusion-resistant. A concrete new scheme based on the Subset Difference scheme  is presented, accomplishing a bandwidth overhead of Delta m + 2 Delta r + 1 compared to e.g. Logical Key Hierarchy's 2(Delta m + Delta r) log m, where Delta m and Delta r is the number of members added and removed since the last stateful update and m is the number of current members.
Place, publisher, year, edition, pages
2006. Vol. 3989, 178-193 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 3989
broadcast encryption, key revocation, subset cover, Subset Difference, Logical Key Hierarchy, stateful, stateless
IdentifiersURN: urn:nbn:se:kth:diva-26572DOI: 10.1007/11767480_12ISI: 000238570400012ScopusID: 2-s2.0-33746619537ISBN: 3-540-34703-8OAI: oai:DiVA.org:kth-26572DiVA: diva2:380354
4th International Conference on Applied Cryptography and Network Security Singapore, SINGAPORE, JUN 06-09, 2006
QC 201012212010-12-212010-11-252011-04-20Bibliographically approved