Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Secure group communications using key graphs
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Provably authenticated group Diffie-Hellman key exchange
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Authenticated Multi-Party Key Agreement
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Efficient and Secure Conference-Key Distribution
Proceedings of the International Workshop on Security Protocols
Round-Optimal Contributory Conference Key Agreement
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Tree-based group key agreement
ACM Transactions on Information and System Security (TISSEC)
A secure and scalable Group Key Exchange system
Information Processing Letters
A non-malleable group key exchange protocol robust against active insiders
ISC'06 Proceedings of the 9th international conference on Information Security
Revisiting Pairing Based Group Key Exchange
Financial Cryptography and Data Security
Group Key Management: From a Non-hierarchical to a Hierarchical Structure
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
Efficient cluster-based group key agreement protocols for wireless ad hoc networks
Journal of Network and Computer Applications
Communication-efficient 2-round group key establishment from pairings
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
T-robust scalable group key exchange protocol with O(log n) complexity
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
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 |
Task-specific groups are often formed in an ad-hoc manner within large corporate structures, such as companies. Take the following typical scenario: A director decides to set up a task force group for some specific project. An order is passed down the hierarchy where it finally reaches a manager who selects some employees to form the group. The members should communicate in a secure way and for efficiency, a symmetric encryption system is chosen. To establish a joint secret key for the group, a group key exchange (GKE) protocol is used. We show how to use an existing Public Key Infrastructure (PKI) to achieve authenticated GKE by modifying the protocol and particularly by including signatures. In this paper we recall a GKE due to Burmester and Desmedt which needs only O(log n) communication and computation complexity per user, rather than O(n) as in the more well-known Burmester-Desmedt protocol, and runs in a constant number of rounds. To achieve authenticated GKE one can apply compilers, however, the existing ones would need O(n) computation and communication thereby mitigating the advantages of the faster protocol. Our contribution is to extend an existing compiler so that it preserves the computation and communication complexity of the non-authenticated protocol. This is particularly important for tree based protocols.