Presentation 2009-05-22
A Pairing-based Group Key Exchange with an Edge-based Tree
Atsuko MIYAJI, Yvo DESMEDT,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Group key exchange (GKE) allows a large group of n users to share a common secret key over insecure channels and, thus, afterwards users in the group can encrypt and decrypt messages to and from the group. The goal of this paper is to propose efficient GKE using bilinear pairings. Instead of making only a theoretical analysis, we focus on the exact costs. Moreover, besides focusing on computational/round/communicational complexity we also consider the size of the software and hardware required. The previous schemes in this area required entities to support various different architectures such as elliptic curve scalar multiplication, bilinear pairing, multiplication over two different finite fields, and finite-field inversion. We propose a new efficient group key exchange protocol in which any inverse operation is removed.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) group key exchange / pairing
Paper # ISEC2009-11
Date of Issue

Conference Information
Committee ISEC
Conference Date 2009/5/15(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Pairing-based Group Key Exchange with an Edge-based Tree
Sub Title (in English)
Keyword(1) group key exchange
Keyword(2) pairing
1st Author's Name Atsuko MIYAJI
1st Author's Affiliation Japan Advanced Institute of Science and Technology()
2nd Author's Name Yvo DESMEDT
2nd Author's Affiliation University College London
Date 2009-05-22
Paper # ISEC2009-11
Volume (vol) vol.109
Number (no) 42
Page pp.pp.-
#Pages 8
Date of Issue