University of Surrey

Test tubes in the lab Research in the ATI Dance Research

Flexible Group Key Exchange with On-Demand Computation of Subgroup Keys

Abdalla, M, Chevalier, C, Manulis, M and Pointcheval, D (2010) Flexible Group Key Exchange with On-Demand Computation of Subgroup Keys In: Third International Conference on Cryptology in Africa AFRICACRYPT 2010, 2010-05-03 - 2010-05-06, Stellenbosch, South Africa.

[img]
Preview
PDF
AbChMaPo_AFRICACRYPT10.pdf
Available under License : See the attached licence file.

Download (733kB)
[img]
Preview
PDF (licence)
SRI_deposit_agreement.pdf

Download (33kB)

Abstract

Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, offer flexible forms of communication and exchange of data. At any time point concurrent communication sessions involving different subsets of users can be invoked. The traditional tool for achieving security in a multi-party communication environment are group key exchange (GKE) protocols that provide participants with a secure group key for their subsequent communication. Yet, in communication scenarios where various user subsets may be involved in different sessions the deployment of classical GKE protocols has clear performance and scalability limitations as each new session should be preceded by a separate execution of the protocol. The motivation of this work is to study the possibility of designing more flexible GKE protocols allowing not only the computation of a group key for some initial set of users but also efficient derivation of independent secret keys for all potential subsets. In particular we improve and generalize the recently introduced GKE protocols enabling on-demand derivation of peer-to-peer keys (so called GKE+P protocols). We show how a group of users can agree on a secret group key while obtaining some additional information that they can use on-demand to efficiently compute independent secret keys for any possible subgroup. Our security analysis relies on the Gap Diffie-Hellman assumption and uses random oracles.

Item Type: Conference or Workshop Item (Conference Paper)
Divisions : Faculty of Engineering and Physical Sciences > Computing Science
Authors :
AuthorsEmailORCID
Abdalla, MUNSPECIFIEDUNSPECIFIED
Chevalier, CUNSPECIFIEDUNSPECIFIED
Manulis, MUNSPECIFIEDUNSPECIFIED
Pointcheval, DUNSPECIFIEDUNSPECIFIED
Date : May 2010
Identification Number : 10.1007/978-3-642-12678-9_21
Contributors :
ContributionNameEmailORCID
PublisherSpringer Berlin Heidelberg, UNSPECIFIEDUNSPECIFIED
Additional Information : The original publication is available at http://www.springerlink.com
Depositing User : Symplectic Elements
Date Deposited : 12 Jun 2013 10:38
Last Modified : 09 Jun 2014 13:32
URI: http://epubs.surrey.ac.uk/id/eprint/755176

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year


Information about this web site

© The University of Surrey, Guildford, Surrey, GU2 7XH, United Kingdom.
+44 (0)1483 300800