Provably authenticated group Diffie-Hellman key exchange
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
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
Short Signatures from the Weil Pairing
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient and Secure Conference-Key Distribution
Proceedings of the International Workshop on Security Protocols
A One Round Protocol for Tripartite Diffie-Hellman
ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Journal of Cryptology
Short Signatures from the Weil Pairing
Journal of Cryptology
A secure and scalable Group Key Exchange system
Information Processing Letters
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
Group Key Exchange Enabling On-Demand Derivation of Peer-to-Peer Keys
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
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
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
Flexible group key exchange with on-demand computation of subgroup keys
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
| Hi-index | 0.00 |
Secure communication within a large group of users such as participants in a phone or video conference relies on the availability of secure data and efficient data transmission. Group key exchange protocols allow a (large) group of nusers to establish a joint secret key which can be used in symmetric systems to efficiently en- and decrypt messages to and from the group. To deal with varying constellations of the groups and to ensure key freshness it is essential that the group key exchange protocol is efficient.Most protocols are generalizations of two-party protocols like Diffie-Hellman key exchange. The Burmester and Desmedt I protocol establishes a key in a constant number of rounds independent of the size of the group of users and in O(n) complexity of computation per user.After Joux's proposal to use pairings to enable a one-round tripartite key exchange (KE) several extensions of existing group KE and authenticated key exchange (AKE) protocols were published. However, quite a few turned out to be flawed and the complexity is often worse than for the original scheme. In this paper we propose a new constant round pairing based group AKE protocol which requires a lower computational complexity per user compared to previous proposals. Furthermore, the scheme is particularly interesting for groups in which some members enjoy more computational power than others. The protocol is most efficient if these members constitute roughly half of the group.We also provide a pairing-based version of the Burmester-Desmedt II group key exchange which runs in 3 rounds and requires only O(logn) computation and communication.Both protocols are faster than any published pairing-based key exchange protocols. If the parameters are chosen appropriately so that the pairing computations are fast the protocols can outperform the respective DL-based Burmester-Desmedt key exchange protocols.