Sciweavers

40 search results - page 2 / 8
» Constant Round Dynamic Group Key Agreement
Sort
View
PERCOM
2007
ACM
14 years 5 months ago
A three round authenticated group key agreement protocol for ad hoc networks
Group Key Agreement (GKA) protocols enable the participants to derive a key based on each one's contribution over a public network without any central authority. They also pr...
Daniel Augot, Raghav Bhaskar, Valérie Issarny, Da...
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
13 years 9 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo
GLOBECOM
2007
IEEE
13 years 12 months ago
Certificateless Authenticated Group Key Agreement Protocol for Dynamic Groups
A Group Key Agreement protocol is a process to establish a cryptographic key for a group of participants over an open network. In this paper, we propose a group key agreement(CAGKA...
Sungchul Heo, Zeen Kim, Kwangjo Kim
ASIACRYPT
2000
Springer
13 years 9 months ago
Round-Efficient Conference Key Agreement Protocols with Provable Security
A conference key protocol allows a group of participants to establish a secret communication (conference) key so that all their communications thereafter are protected by the key. ...
Wen-Guey Tzeng, Zhi-Jia Tzeng
ICISC
2008
89views Cryptology» more  ICISC 2008»
13 years 7 months ago
Survival in the Wild: Robust Group Key Agreement in Wide-Area Networks
Group key agreement (GKA) allows a set of players to establish a shared secret and thus bootstrap secure group communication. GKA is very useful in many types of peer group scenar...
Jihye Kim, Gene Tsudik