We study the problem of broadcasting confidential information to a collection of n devices while providing the ability to revoke an arbitrary subset of those devices (and tolerating collusion among the revoked devices). In this paper, we restrict our attention to low-memory devices, that is, devices that can store at most O(log n) keys. We consider solutions for both zero-state and low-state cases, where such devices are organized in a tree structure T. We allow the group controller to encrypt broadcasts to any subtree of T, even if the tree is based on an multi-way organizational chart or a severely unbalanced multicast tree. © International Association for Cryptologic Research 2004.
CITATION STYLE
Goodrich, M. T., Sun, J. Z., & Tamassia, R. (2004). Efficient Tree-Based revocation in groups of low-state devices. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3152, 511–527. https://doi.org/10.1007/978-3-540-28628-8_31
Mendeley helps you to discover research relevant for your work.