Sciweavers

149 search results - page 13 / 30
» On the Performance of Group Key Agreement Protocols
Sort
View
IJISEC
2002
86views more  IJISEC 2002»
13 years 7 months ago
Using AVL trees for fault-tolerant group key management
In this paper we describe an efficient algorithm for the management of group-keys for Group Communication Systems. Our algorithm is based on the notion of key-graphs, previously u...
Ohad Rodeh, Kenneth P. Birman, Danny Dolev
ACMSE
2007
ACM
13 years 11 months ago
Chinese remainder theorem based group key management
In this paper, we present two new centralized group key management protocols based on the Chinese Remainder Theorem (CRT). By shifting more computing load onto the key server we o...
Xinliang Zheng, Chin-Tser Huang, Manton M. Matthew...
ACSAC
2001
IEEE
13 years 11 months ago
Secure Anonymous Group Infrastructure for Common and Future Internet Applications
Secure group communication protocols, in particular multi-party key agreement and update algorithms, help promote traditional and new Internet multi-party applications such as vid...
Nathalie Weiler
IJNSEC
2008
140views more  IJNSEC 2008»
13 years 7 months ago
A Secure Group Key Management Scheme for Wireless Cellular Systems
In wireless networks, secure multicast protocols are more difficult to implement efficiently due to the dynamic nature of the multicast group and the scarcity of bandwidth at the ...
Hwa Young Um, Edward J. Delp
EUROCRYPT
2004
Springer
14 years 1 months ago
On Generating the Initial Key in the Bounded-Storage Model
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
Stefan Dziembowski, Ueli M. Maurer