Idioma:

Efficient Tree-Based Revocation in Groups of Low-State Devices

Goodrich, Michael T. ; Sun, Jonathan Z. ; Tamassia, Roberto

Advances in Cryptology – CRYPTO 2004, 2004, p.511-527 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
Efficient Tree-Based Revocation in Groups of Low-State Devices
Autor: Goodrich, Michael T. ; Sun, Jonathan Z. ; Tamassia, Roberto
Assuntos: Applied sciences ; Computer science; control theory; systems ; Cryptography ; Dynamic Tree ; Exact sciences and technology ; Group Controller ; Information, signal and communications theory ; Internal Node ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Multicast Tree ; Security Property ; Signal and communications theory ; Software ; Telecommunications and information theory
É parte de: Advances in Cryptology – CRYPTO 2004, 2004, p.511-527
Descrição: 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.
Títulos relacionados: Lecture Notes in Computer Science
Editor: Berlin, Heidelberg: Springer Berlin Heidelberg
Idioma: Inglês

Links

Voltar para lista de resultados