JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/9850

Title: T-Robust Scalable Group Key Exchange Protocol with O(logn) Complexity
Authors: Hatano, Tetsuya
Miyaji, Atsuko
Sato, Takashi
Keywords: group key exchange
robustness
scalability
Issue Date: 2011-07-02
Publisher: Springer
Magazine name: Lecture Notes in Computer Science
Volume: 6812/2011
Start page: 189
End page: 207
DOI: 10.1007/978-3-642-22497-3_13
Abstract: Group key exchange (GKE) allows a large group of n parties to share a common secret key over insecure channels. The goal of this paper is to present T-robust scalable GKEwith communicational and computational complexity O(log n) forn parties.As a result, our GKE not only has a resistance to party failures resulting from party crashes, run-down batteries, and network failures, but also satisfiesscalability: parties do not need to have the sameenvironment such as computational resources, batteries, etc.The previous schemes in this area focus onBurmester-Desmedt GKE with complexity O(n) (BDI) and without scalability.As a result, the previous robust GKEs, proposed byJarecki, Kim and Tsudik (JKT), need computationalcomplexity O(n) without scalability,although they withstand any T-party fault in any position.We, by focusing on the well-known Burmester-Desmedt GKE with complexity O(log n) (BDII), propose a new robust GKE with scalability, called CH-GKE.CH-GKE can reduce the communicational and computationalcomplexity and allow parties to be in different environments.Then, we extend CH-GKE to increase the number of faults withstood andpresent T-robust scalable efficient GKE by a novel combinationof CH-GKE and JKT.Our T-robust scalable GKE can work inflexible settings with trade-offs between fault tolerance and efficiency,such as communicational and computational complexity.
Rights: This is the author-created version of Springer, Tetsuya Hatano, Atsuko Miyaji, and Takashi Sato, Lecture Notes in Computer Science, 6812/2011, 2011, 189-207. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-22497-3_13
URI: http://hdl.handle.net/10119/9850
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
16763-1.pdf546KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.

 


Contact : Library Information Section, JAIST (ir-sys[at]ml.jaist.ac.jp)