Redesigning Group Key Exchange Protocol Based on Bilinear Pairing Suitable for Various Environments
Redesigning Group Key Exchange Protocol Based on Bilinear Pairing Suitable for Various Environments
复制标题
DOI：
10.1007/978-3-642-21518-6_17
复制
发表时间：
2010-10
期刊：
影响因子：
--
通讯作者：
Y. Desmedt;A. Miyaji
中科院分区：
文献类型：
--
作者：
Y. Desmedt;A. Miyaji
组密钥交换（GKE）允许一组n方在不安全的信道上共享一个公共密钥。由于密钥管理很重要，NIST现在正在寻找一个标准。本文的目标是重新设计GKE使用双线性对，提出了Desmedt和兰格，从安排的角度来看，各方。在本文中，各方的安排被称为一个党树。实际上，我们可以重新设计的党树，以减少计算和通信的复杂性相比，以前的计划，当GKE是在一个小组的缔约方之间执行。我们还重新设计了大量的党，其中每一方是在一个不同的环境，如有大量或有限的计算资源，电力等一般党树。
Group key exchange (GKE) allows a group ofnparties to share a common secret key over insecure channels. Since key management is important, NIST is now looking for a standard. The goal of this paper is to redesign GKE using bilinear pairings, proposed by Desmedt and Lange, from the point of view of arrangement of parties. The arrangement of parties is called a party tree in this paper. Actually, we are able toredesignthe party tree, to reduce the computational and communicational complexity compared with the previous scheme, when GKE is executed among a small group of parties. We also redesign the general party tree for a large number of parties, in which each party is in a different environment such as having large or limited computational resources, electrical power, etc.