Please note: this collection is no longer updated. Visit our Theses and Dissertations Collection in VERSO for all U of I ETD since 2012.
ETD RECORD
A communication-computation efficient group key algorithm for large and dynamic groups
Citation
Zheng, Shanyu.. (2006). A communication-computation efficient group key algorithm for large and dynamic groups. Theses and Dissertations Collection, University of Idaho Library Digital Collections. https://www.lib.uidaho.edu/digital/etd/items/etd_394.html
- Title:
- A communication-computation efficient group key algorithm for large and dynamic groups
- Author:
- Zheng, Shanyu.
- Date:
- 2006
- Keywords:
- Internet--Security measures Data encryption (Computer science) Computer security
- Abstract:
- The management of secure communication between groups of participants requires a set of secure and efficient operations. In this dissertation we present a Communication-Computation Efficient Group Key Algorithm (CCEGK). This algorithm extends prior work to provide both efficient communication and computation, and to address performance, security and authentication issues. We then theoretically compare the performance of CCEGK with four other leading group key algorithms, EGK, TGDH, STR, and GDH3.0 in worst case scenario.;Traditional analysis of group key protocol performance is based on the cost of performing a single operation. We extend this analysis to examine the performance and stability behavior of five group key protocols over multiple operations. Thus, the experimental results we report consist of combinations of join, leave, mass join, mass leave, merge, and partition operations, which assist decision makers in reviewing their performance and stability over time.;Since CCEGK provides two rebalance schemes to improve its performance, the performance impact of tree rebalancing operations on the overall cost of CCEGK is evaluated over the course of the execution of multiple operations. Thus, experimental results for CCEGK obtained by executing multiple operations and considering rebalance schemes are displayed to show average computation cost, communication cost, and stability. This was done in order to provide decision makers the ability to select the appropriate protocols.;Several group key protocols, including the above five, have been presented in the literature to enable secrecy of communication among dynamic groups of participants. However, there is little consistency in the literature in terms of operations supported and performance metrics of the various protocols. This makes it difficult for designers to choose the best protocol for their specific applications. To alleviate this problem, we introduce a generic model of group key exchange protocols. In addition, we introduce new performance metrics for use in uniformly comparing these protocols and then in improving the performance of five protocols based on these operations and metrics.
- Description:
- Thesis (Ph. D.)--University of Idaho, 2006.
- Major Professor:
- Jim Alves-Foss
- Defense Date:
- 2006
- Type:
- Text
- Format Original:
- x, 92 leaves :ill. ;29 cm.
- Format:
- record
Rights
- Rights:
- In Copyright - Educational Use Permitted. For more information, please contact University of Idaho Library Special Collections and Archives Department at libspec@uidaho.edu.
- Standardized Rights:
- http://rightsstatements.org/vocab/InC-EDU/1.0/