Conference key agreement protocol with non-interactive fault-tolerance over broadcast network

Abstract

Most conventional conference key agreement protocols have not been concerned with a practical situation. There may exist some malicious conferees who attempt to block conference initiation for some purposes, e.g. commercial, political or military benefit. Instances where conference must be launched immediately due to emergency, efficient detection of malicious behavior would be needed. Recently, Tzeng (IEEE Trans. Comput. 51(4):373-379, 2002) proposed a fault-tolerant conference key agreement protocol to address the issue where a conference key can be established among conferees even though malicious conferees exist. However, his protocol might be complex and inefficient during fault-detection. In the case where a malicious conferee exists and a fault-tolerant mechanism is launched, complicated interactions between conferees will be required. In this paper, we introduce a novel strategy, where any malicious conferee may be identified and removed from the conferee list without any interaction. With such a non-interactive fault-tolerance, conferences could be established and started efficiently. A complete example of our protocol will be given to describe the fascinating fault-tolerance. We analyse the security of our protocol regarding four aspects, i.e. correctness, fault-tolerance, active attack and passive attack. The comparisons of performance between our protocol and that of Tzeng are also shown. As a whole, the advantage of our protocol is superior to that of Tzeng under the situation where malicious conferees exist.

Communication protocols based on CAAA attributes

“…Since the permutation is bijective, the above three protocols sustain replay, chosen plaintext and Phishing attacks. Using the result (Proposition 1 of [5]), we can state : For any message m , a client sends m3 to server is unique in the protocols 1,2 and 3. On following this, any malicious customer who cheats on honest customers by attempting to access these protocols will not gain.…”

“…During the communication, a permutation technique (cubing a random number w.r.to a prime p = 2 mod 3) is used between client and server ends in order to avoid reply attack. The defi ned permutation: r r r 3 3 " = mod p (where p = 2 mod 3) is a bijective map [5] employed as a crucial role in the proposed EAPs. There are three authentication protocols proposed below that will fulfi ll CAAA issues.…”

Group Key Transfer Protocol Based on Shamir's Secret Sharing

“…를 분배하는 많은 연구들이 이루어졌다 [5][6][7][8][9][10] . 그 중에 서도 Harn과 Lin은 Shamir의 비밀 공유 방식을 기반 으로 그룹 세션키를 분배하는 프로토콜을 제안하였다 [11] .…”

Improvement on the fault‐tolerant group key agreement protocol of Zhao et al.

“…To overcome this drawback, some fault-tolerant group key agreement protocols [12][13][14][15]17,18] were developed. In a fault-tolerant group key agreement protocol, all malicious participants are excluded from the set of participants before session key computation and cannot disrupt the key agreement process.…”