Name
Abstract | ||
|---|---|---|
Conference key management requires relatively heavy-weight modular exponentiation operations and additional communications among group members. So time efficiency of key update for conference key management is the key problem many literatures strived to address. In this paper, we propose a Huffman-based join-exit-tree (HJET) key agreement to achieve better time efficiency in key update. Compared with JET scheme of Mao et al., HJET has two major improvements. First, the join algorithm inserting the new node into the root of the join tree makes the join cost minimal and constant. Second, Huffman coding is used to form the exit tree with the information of users' withdrawal probabilities, and therefore has optimal average leave cost. Performance analysis and simulation results demonstrate that HJET is efficient in key update and achieves the asymptotic time cost of O(1) for join event and nearly O(1) for leave events. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/GLOCOM.2008.ECP.352 | GLOBECOM |
Keywords | Field | DocType |
cryptography,trees (mathematics),huffman-based join-exit-tree method,telecommunication security,heavy-weight modular exponentiation operations,huffman codes,conference key management updating scheme,secure group communication,group dynamics knowledge,huffman coding,group dynamic,protocols,algorithm design and analysis,modular exponentiation,key management,local area networks | Algorithm design,Computer science,Cryptography,Telecommunication security,Computer network,Peer to peer computing,Theoretical computer science,Huffman coding,Local area network,Conference key,Modular exponentiation | Conference |
ISSN | ISBN | Citations |
1930-529X | 978-1-4244-2324-8 | 0 |
PageRank | References | Authors |
0.34 | 14 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaozhuo Gu | 1 | 17 | 4.79 |
| Jianzu Yang | 2 | 10 | 1.93 |
| Xiangjie Ma | 3 | 3 | 3.48 |
| Julong Lan | 4 | 1 | 3.40 |