• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

Secure and Efficient Tree-based Group Diffie-Hellman Protocol

Vol. 3, No.2, April 25, 2009
10.3837/tiis.2009.02.004, Download Paper (Free):

Abstract

Current group key agreement protocols (often tree-based) involve unnecessary delays because members with low-performance computer systems can join group key computation. These delays are caused by the computations needed to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of filtering low performance members in group key generation. This paper presents an efficient tree-based group key agreement protocol and the results of its performance evaluation. The proposed approach to filtering of low performance members in group key generation is scalable and it requires less computational overhead than conventional tree-based protocols.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Sunghyuck Hong, "Secure and Efficient Tree-based Group Diffie-Hellman Protocol," KSII Transactions on Internet and Information Systems, vol. 3, no. 2, pp. 178-194, 2009. DOI: 10.3837/tiis.2009.02.004

[ACM Style]
Hong, S. 2009. Secure and Efficient Tree-based Group Diffie-Hellman Protocol. KSII Transactions on Internet and Information Systems, 3, 2, (2009), 178-194. DOI: 10.3837/tiis.2009.02.004