Optimal tree structures for group key management with batch updates

RL Graham, M Li, FF Yao - SIAM Journal on Discrete Mathematics, 2007 - SIAM
We investigate the key management problem for broadcasting applications. Previous work
showed that batch rekeying can be more cost-effective than individual rekeying. Under the …
被引用次数：18 相关文章
[PDF] ucsd.edu

[PDF][PDF] OPTIMAL TREE STRUCTURES FOR GROUP KEY MANAGEMENT WITH BATCH UPDATES

RL GRAHAM, M LI, FF YAO - mathweb.ucsd.edu
We investigate the key management problem for broadcasting applications. Previous work
showed that batch rekeying can be more cost-effective than individual rekeying. Under the …

[引用][C] OPTIMAL TREE STRUCTURES FOR GROUP KEY MANAGEMENT WITH BATCH UPDATES

RL GRAHAM, M LI, FF YAO - SIAM journal on discrete …, 2008 - pascal-francis.inist.fr
OPTIMAL TREE STRUCTURES FOR GROUP KEY MANAGEMENT WITH BATCH UPDATES
CNRS Inist Pascal-Francis CNRS Pascal and Francis Bibliographic Databases Simple …

Optimal Tree Structures for Group Key Management with Batch Updates

RL Graham, M Li, FF Yao - SIAM Journal on Discrete Mathematics, 2007 - dl.acm.org
We investigate the key management problem for broadcasting applications. Previous work
showed that batch rekeying can be more cost-effective than individual rekeying. Under the …
[PDF] psu.edu

[PDF][PDF] OPTIMAL TREE STRUCTURES FOR GROUP KEY MANAGEMENT WITH BATCH UPDATES

RL GRAHAM, M LI, FF YAO - Citeseer
We investigate the key management problem for broadcasting applications. Previous work
showed that batch rekeying can be more cost-effective than individual rekeying. Under the …
[PDF] ucsd.edu

[PDF][PDF] OPTIMAL TREE STRUCTURES FOR GROUP KEY MANAGEMENT WITH BATCH UPDATES

RL GRAHAM, M LI, FF YAO - math.ucsd.edu
We investigate the key management problem for broadcasting applications. Previous work
showed that batch rekeying can be more cost-effective than individual rekeying. Under the …

Optimal Tree Structures for Group Key Management with Batch Updates

RL Graham, M Li, FF Yao - SIAM Journal on Discrete …, 2007 - search.proquest.com
We investigate the key management problem for broadcasting applications. Previous work
showed that batch rekeying can be more cost-effective than individual rekeying. Under the …
[PDF] cityu.edu.hk

[PDF][PDF] OPTIMAL TREE STRUCTURES FOR GROUP KEY MANAGEMENT WITH BATCH UPDATES

RL GRAHAM, M LI, FF YAO - cs.cityu.edu.hk
We investigate the key management problem for broadcasting applications. Previous work
showed that batch rekeying can be more cost-effective than individual rekeying. Under the …
[PDF] ucsd.edu

[PDF][PDF] OPTIMAL TREE STRUCTURES FOR GROUP KEY MANAGEMENT WITH BATCH UPDATES

RL GRAHAM, M LI, FF YAO - math.ucsd.edu
We investigate the key management problem for broadcasting applications. Previous work
showed that batch rekeying can be more cost-effective than individual rekeying. Under the …
[PDF] archive.org

[PDF][PDF] OPTIMAL TREE STRUCTURES FOR GROUP KEY MANAGEMENT WITH BATCH UPDATES

RL GRAHAM, M LI, FF YAO - scholar.archive.org
We investigate the key management problem for broadcasting applications. Previous work
showed that batch rekeying can be more cost-effective than individual rekeying. Under the …