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 GKE with communicational and computational complexity $O(\log{n})$ for the size of $n$ parties. The previous schemes in this area , proposed by Jarecki, Kim and Tsudik (JKT), achieves with complexity $O(n)$ although it allows any $T$-party fault in any position. We propose a new robust GKE with scalability, which can work in flexible settings between fault tolerance and efficiency, such as communicational and computational complexity.
|