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

Design and Performance Analysis of Queue-based Group Diffie-Hellman Protocol (QGDH)

Vol. 7, No.1, January 30,2013
10.3837/tiis.2013.01.010, Download Paper (Free):

Abstract

Current group key agreement protocols, which are often tree-based, have unnecessary delays that are caused when members with low-performance computer systems join a group key computation process. These delays are caused by the computations necessary to balance a key tree after membership changes. An alternate approach to group key generation that reduces delays is the dynamic prioritizing mechanism of queue-based group key generation. We propose an efficient group key agreement protocol and present the results of performance evaluation tests of this protocol. The queue-based approach that we propose is scalable and 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 and Sungjin Lee, "Design and Performance Analysis of Queue-based Group Diffie-Hellman Protocol (QGDH)," KSII Transactions on Internet and Information Systems, vol. 7, no. 1, pp. 149-165, 2013. DOI: 10.3837/tiis.2013.01.010

[ACM Style]
Hong, S. and Lee, S. 2013. Design and Performance Analysis of Queue-based Group Diffie-Hellman Protocol (QGDH). KSII Transactions on Internet and Information Systems, 7, 1, (2013), 149-165. DOI: 10.3837/tiis.2013.01.010