Efficient Key Packaging Schemes for Group Key Management
Date Issued
2007
Date
2007
Author(s)
Kang, Chao-Chun
DOI
zh-TW
Abstract
Group key management is an essential component of secure multicast architecture. An efficient group key management protocol called One-Way Key Derivation (OKD), proposed by Lin et al. in 2005, uses a tree to manage keys. We find that in OKD, when a member joins a group with key tree height x, the new member has to decrypt O(x) times to get the new group key. On the other hand, when a member leaves the group, other group members have to decrypt O(x) times to get the new group key. For devices with limited computational capabilities, decryption is a costly operation. In these situations, the group members cannot derive the new group key fast enough when membership changes. Therefore, they can neither encrypt and send messages nor decrypt to get the received messages immediately. It is inefficient for group members, especially when the message is very urgent.
In this paper, we propose an efficient key packaging scheme for group key management based on OKD. In our scheme, a new group member only needs one decryption to get the new group key. On the contrary, our scheme replaces decryption operations with faster hash operations when a member leaves the group, so it allows group members to derive the new group key more quickly than OKD.
Subjects
群組金鑰管理
安全群播
安全群組溝通
樹狀結構金鑰管理
邏輯式階層金鑰管理
雜湊函數
group key management
secure multicast
secure group communication
tree-based key management
Logical Key Hierarchy (LKH)
hash function
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-96-R94944013-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):2c229c18aefd5368a13fa7b4457397fa