Colloquium Speaker

Prof. Michael T. Goodrich, Computer Science Department, University of California - Irvine
Title: Efficient Tree-Based Revocation in Groups of Low-State Devices
Date: Tuesday, November 9, 2004
Time: 11:00AM
Place: Gould-Simpson, Room 701
Refreshments will be served in the 7th floor lobby of Gould-Simpson at 10:45 AM


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$, even if the tree is based on an multi-way organizational chart or a severely unbalanced multicast tree. This is joint work with David Eppstein and Jonathan Z. Sun.