南開科技大學圖書館 |

Language: 繁體中文

說明(常見問題)

南開科技大學

圖書館首頁

編目中圖書申請

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

A communication-computation efficien...

University of Idaho.

A communication-computation efficient group key algorithm for large and dynamic groups.

紀錄類型:	書目-電子資源 : 單行本
正題名/作者:	A communication-computation efficient group key algorithm for large and dynamic groups./
作者:	Zheng, Shanyu.
面頁冊數:	92 p.
附註:	Source: Dissertation Abstracts International, Volume: 67-09, Section: B, page: 5216.
Contained By:	Dissertation Abstracts International67-09B.
標題:	Computer Science. -
電子資源:	Download PDF (下載PDF全文)
ISBN:	9780542897993

A communication-computation efficient group key algorithm for large and dynamic groups.
Zheng, Shanyu.

A communication-computation efficient group key algorithm for large and dynamic groups. - 92 p.

Source: Dissertation Abstracts International, Volume: 67-09, Section: B, page: 5216.

Thesis (Ph.D.)--University of Idaho, 2006.

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.

ISBN: 9780542897993Subjects--Topical Terms:

1000005419
Computer Science.

A communication-computation efficient group key algorithm for large and dynamic groups.
LDR:03156nmm 2200301 4500 001 1000004930
005 20070601084736.5
008 070601s2006 eng d
020 $a 9780542897993
035 $a (UnM)AAI3235444
035 $a AAI3235444
040 $a UnM $c UnM{me_controlnum}
100 1 $a Zheng, Shanyu. $3 1000006086
245 1 2 $a A communication-computation efficient group key algorithm for large and dynamic groups.
300 $a 92 p.
500 $a Source: Dissertation Abstracts International, Volume: 67-09, Section: B, page: 5216.
500 $a Adviser: Jim Alves-Foss.
502 $a Thesis (Ph.D.)--University of Idaho, 2006.
520 $a 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.
520 $a 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.
520 $a 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.
520 $a 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.
590 $a School code: 0089.
650 4 $a Computer Science. $3 1000005419
690 $a 0984
710 2 0 $a University of Idaho. $3 1000006087
773 0 $t Dissertation Abstracts International $g 67-09B.
790 1 0 $a Alves-Foss, Jim, $e advisor
790 $a 0089
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3235444 $z Download PDF (下載PDF全文)