Efficient compilers for authenticated group key exchange

Authors:
Qiang Tang;Chris J. Mitchell
Affiliations:
Information Security Group, Royal Holloway, University of London, Egham, Surrey, UK;Information Security Group, Royal Holloway, University of London, Egham, Surrey, UK
Venue:
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
Year:
2005

Citing 4
Cited 0

Secure protocol transformation via “expansion”: from two-party to groups

CCS '99 Proceedings of the 6th ACM conference on Computer and communications security
Provably authenticated group Diffie-Hellman key exchange

CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Transitive Signatures Based on Factoring and RSA

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Communication-Efficient Group Key Agreement

IFIP/Sec '01 Proceedings of the IFIP TC11 Sixteenth Annual Working Conference on Information Security: Trusted Information: The New Decade Challenge

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose two compilers which are designed to transform a group key exchange protocol secure against any passive adversary into an authenticated group key exchange protocol with key confirmation which is secure against any passive adversary, active adversary, or malicious insider. We show that the first proposed compiler gives protocols that are more efficient than those produced by the compiler of Katz and Yung.