Robust group key agreement using short broadcasts
Proceedings of the 14th ACM conference on Computer and communications security
A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
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
On the Strong Forward Secrecy of the Improved Chikazawa-Yamagishi ID-Based Key Sharing
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
ID-Based Authenticated Group Key Agreement Secure against Insider Attacks
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Survival in the Wild: Robust Group Key Agreement in Wide-Area Networks
Information Security and Cryptology --- ICISC 2008
An escrow-less identity-based group-key agreement protocol for dynamic peer groups
International Journal of Security and Networks
Authenticated Key Exchange Protocol in One-Round
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
An efficient fault-tolerant group key agreement protocol
Computer Communications
Developing security protocols by refinement
Proceedings of the 17th ACM conference on Computer and communications security
A security weakness in Abdalla et al.'s generic construction of a group key exchange protocol
Information Sciences: an International Journal
Towards understanding pure publish/subscribe cryptographic protocols
Security'08 Proceedings of the 16th International conference on Security protocols
Cryptanalysis of ID-based authenticated key agreement protocols from bilinear pairings (short paper)
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Design of secure key establishment protocols: successes, failures and prospects
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Security goals and protocol transformations
TOSCA'11 Proceedings of the 2011 international conference on Theory of Security and Applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Sufficient condition for ephemeral key-leakage resilient tripartite key exchange
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Decentralized dynamic broadcast encryption
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Future Generation Computer Systems
Improved group off-the-record messaging
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
An improved fault-tolerant conference-key agreement protocol with forward secrecy
Proceedings of the 6th International Conference on Security of Information and Networks
A new hierarchical and scalable group key exchange protocol with XOR operation
International Journal of Wireless and Mobile Computing
Establishing and preserving protocol security goals
Journal of Computer Security - Foundational Aspects of Security
| Hi-index | 0.00 |
We consider the problem of authenticated group key exchange among n parties communicating over an insecure public network. A number of solutions to this problem have been proposed; however, all prior provably secure solutions do not scale well and, in particular, require O(n) rounds. Our main contribution is the first scalable protocol for this problem along with a rigorous proof of security in the standard model under the DDH assumption; our protocol uses a constant number of rounds and requires only O(1) "full" modular exponentiations per user. Toward this goal (and adapting work of Bellare, Canetti, and Krawczyk), we first present an efficient compiler that transforms any group key-exchange protocol secure against a passive eavesdropper to an authenticated protocol which is secure against an active adversary who controls all communication in the network. This compiler adds only one round and O(1) communication (per user) to the original scheme. We then prove secure—against a passive adversary—a variant of the two-round group key-exchange protocol of Burmester and Desmedt. Applying our compiler to this protocol results in a provably secure three-round protocol for authenticated group key exchange which also achieves forward secrecy.