Securing group key exchange against strong corruptions
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Securing group key exchange against strong corruptions and key registration attacks
International Journal of Applied Cryptography
Modeling Key Compromise Impersonation Attacks on Group Key Exchange Protocols
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Universally composable contributory group key exchange
Proceedings of the 4th International Symposium on Information, Computer, and Communications Security
Password-Authenticated Group Key Agreement with Adaptive Security and Contributiveness
AFRICACRYPT '09 Proceedings of the 2nd International Conference on Cryptology in Africa: Progress in Cryptology
Generic one round group key exchange in the standard model
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Attribute-based authenticated key exchange
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
On the minimum communication effort for secure group key exchange
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
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
Stronger security model of group key agreement
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Modeling key compromise impersonation attacks on group key exchange protocols
ACM Transactions on Information and System Security (TISSEC)
Computationally-Fair group and identity-based key-exchange
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
ATC'07 Proceedings of the 4th international conference on Autonomic and Trusted Computing
Hi-index | 0.00 |
We examine the popular proof models for group key establishment of Bresson et al. (LNCS 2248: 290–309, 2001; Proceedings of the 8th ACM conference on computer and communications security (CCS-8), 2001) and point out missing security properties addressing malicious protocol participants. We show that established group key establishment schemes from CRYPTO 2003 and ASIACRYPT 2004 do not fully meet these new requirements. Next to giving a formal definition of these extended security properties, we prove a variant of the explored proposal from ASIACRYPT 2004 secure in this stricter sense. Our proof builds on the Computational Diffie Hellman (CDH) assumption and the random oracle model.