Redesigning group key exchange protocol based on bilinear pairing suitable for various environments

Authors:
Yvo Desmedt;Atsuko Miyaji
Affiliations:
University College London and RCIS, AIST;Japan Advanced Institute of Science and Technology
Venue:
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Year:
2010

Citing 10
Cited 1

Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on 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

Journal of Cryptology
Graphs and Hypergraphs

Graphs and Hypergraphs
Trading Inversions for Multiplications in Elliptic Curve Cryptography

Designs, Codes and Cryptography
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups

Journal of Cryptology
Cluster-based Group Key Agreement for Wireless Ad hoc Networks

ARES '08 Proceedings of the 2008 Third International Conference on Availability, Reliability and Security
Revisiting Pairing Based Group Key Exchange

Financial Cryptography and Data 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
Dynamic group key agreement in tree-based setting

ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Group key exchange (GKE) allows a group of n parties to share a common secret key over insecure channels. Since key management is important, NIST is now looking for a standard. The goal of this paper is to redesign GKE using bilinear pairings, proposed by Desmedt and Lange, from the point of view of arrangement of parties. The arrangement of parties is called a party tree in this paper. Actually, we are able to redesign the party tree, to reduce the computational and communicational complexity compared with the previous scheme, when GKE is executed among a small group of parties. We also redesign the general party tree for a large number of parties, in which each party is in a different environment such as having large or limited computational resources, electrical power, etc.