Efficient and Secure Conference-Key Distribution
Proceedings of the International Workshop on Security Protocols
Exploring Robustness in Group Key Agreement
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Group Key Agreement Efficient in Communication
IEEE Transactions on Computers
Asynchronous group key exchange with failures
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Robust group key agreement using short broadcasts
Proceedings of the 14th ACM conference on Computer and communications security
Cluster-based Group Key Agreement for Wireless Ad hoc Networks
ARES '08 Proceedings of the 2008 Third International Conference on Availability, Reliability and Security
Fully Robust Tree-Diffie-Hellman Group Key Exchange
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Scalable authenticated tree based group key exchange for ad-hoc groups
FC'07/USEC'07 Proceedings of the 11th International Conference on Financial cryptography and 1st International conference on Usable Security
Redesigning group key exchange protocol based on bilinear pairing suitable for various environments
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
| Hi-index | 0.00 |
Group key exchange (GKE) allows a large group of n parties to share a common secret key over insecure channels. The goal of this paper is to present T- robust scalable GKE with communicational and computational complexity O(log n) for the size of n parties. As a result, our GKE not only has a resistance to party failures resulting from party crashes, run-down batteries, and network failures, but also satisfies scalability: each party does not need to have the same environment such as computational resources, batteries, etc. The previous schemes in this area focus on Burmester-Desmedt GKE with complexity O(n) (BDI) and without scalability. As a result, the previous robust GKEs, proposed by Jarecki, Kim and Tsudik (JKT), need computational complexity O(n) without scalability although it allows any T-party fault in any position. We, by focusing the well-known Burmester-Desmedt GKE with complexity O(log n) (BDII), propose a new robust GKE with scalability, called CH-GKE. CH-GKE can reduce the communicational and computational complexity and allow parties be in different environments. Then, we extend CH-GKE to increase the number of faults and present T-robust scalable efficient GKE by a novel combination of CH-GKE and JKT. Our T-robust scalable GKE can work in flexible settings between fault tolerance and efficiency, such as communicational and computational complexity.