Efficient tree-based revocation in groups of low-state devices (2004)
Cached
Download Links
- [www.cs.usm.edu]
- [www.cs.brown.edu]
- [www.ics.uci.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of Crypto ’04, volume 2204 of LNCS |
| Citations: | 28 - 1 self |
BibTeX
@INPROCEEDINGS{Goodrich04efficienttree-based,
author = {Michael T. Goodrich and Jonathan Z. Sun and Roberto Tamassia},
title = {Efficient tree-based revocation in groups of low-state devices},
booktitle = {In Proceedings of Crypto ’04, volume 2204 of LNCS},
year = {2004},
pages = {511--527},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. 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,evenifthetreeisbasedonanmulti-way organizational chart or a severely unbalanced multicast tree. 1
