This paper proposes a family of key management schemes for stateless receivers, and particularly two of the family members called SKT-A and SKT-B. A basic strategy of the proposed approach could be formulated as follows: Before dealing with the set covering issues, perform an appropriate preprocessing over the underlying tree in order to specify a more suitable underlying structure for the set covering. The main underlying idea for developing a novel family of the key management schemes is employment of appropriate clustering of the keys and users, and employment heterogeneous cluster oriented local key management. The proposed schemes are compared with the recently reported, and the advantages of the novel ones are pointed out. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Mihaljević, M. J. (2003). Broadcast encryption schemes based on the sectioned key tree. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2836, 158–169. https://doi.org/10.1007/978-3-540-39927-8_15
Mendeley helps you to discover research relevant for your work.