DMCA
Optimizing Rekeying Cost for Contributory Group Key Agreement Schemes
| Citations: | 12 - 0 self |
BibTeX
@MISC{Yu_optimizingrekeying,
author = {Wei Yu and Yan Sun and K. J. Ray Liu},
title = {Optimizing Rekeying Cost for Contributory Group Key Agreement Schemes },
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
While contributory group key agreement is a promising solution to achieve access control in collaborative and dynamic group applications, the existing schemes have not achieved the performance lower bound in terms of time, communication and computation cost. In this paper we propose a contributory group key agreement that achieves the performance lower bound by utilizing a novel logical key tree structure, called PFMH, and the concept of phantom user position. In particular, the proposed scheme only needs O(1) rounds of two-party DH upon any single user join event and O(log n) rounds of two-party DH upon any single user leave event. Both theoretical bound analysis and simulation show that the proposed scheme achieves lower rekeying cost than the existing tree-based contributory group key agreement schemes.
