Some cryptographic schemes based on the bilinear pairings were proposed recently. In this paper, we apply the pairings on elliptic curve and Elliptic Curve Cryptography to the key agreement of dynamic peer group. Each member performs authentication and contributes a secret data to negotiate a group common key by means of a binary key tree. The proposed protocol does not need a dedicated central server to perform the key agreement, and the overhead is distributed among the group members. To provide a secure dynamic group communication, the key renewing mechanism has to be included. While the member joins/leaves, the group session key will be renewed to provide the backward/forward privacy, respectively. The key renewing is much efficient because it is only confined to the keys of the key-path. The proposed protocol is flexible while the change of membership is frequent.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Shyi-Tsong WU, Jung-Hui CHIU, Bin-Chang CHIEU, "Identity-Based Key Agreement for Peer Group Communication from Pairings" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 10, pp. 2762-2768, October 2005, doi: 10.1093/ietfec/e88-a.10.2762.
Abstract: Some cryptographic schemes based on the bilinear pairings were proposed recently. In this paper, we apply the pairings on elliptic curve and Elliptic Curve Cryptography to the key agreement of dynamic peer group. Each member performs authentication and contributes a secret data to negotiate a group common key by means of a binary key tree. The proposed protocol does not need a dedicated central server to perform the key agreement, and the overhead is distributed among the group members. To provide a secure dynamic group communication, the key renewing mechanism has to be included. While the member joins/leaves, the group session key will be renewed to provide the backward/forward privacy, respectively. The key renewing is much efficient because it is only confined to the keys of the key-path. The proposed protocol is flexible while the change of membership is frequent.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.10.2762/_p
Copy
@ARTICLE{e88-a_10_2762,
author={Shyi-Tsong WU, Jung-Hui CHIU, Bin-Chang CHIEU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Identity-Based Key Agreement for Peer Group Communication from Pairings},
year={2005},
volume={E88-A},
number={10},
pages={2762-2768},
abstract={Some cryptographic schemes based on the bilinear pairings were proposed recently. In this paper, we apply the pairings on elliptic curve and Elliptic Curve Cryptography to the key agreement of dynamic peer group. Each member performs authentication and contributes a secret data to negotiate a group common key by means of a binary key tree. The proposed protocol does not need a dedicated central server to perform the key agreement, and the overhead is distributed among the group members. To provide a secure dynamic group communication, the key renewing mechanism has to be included. While the member joins/leaves, the group session key will be renewed to provide the backward/forward privacy, respectively. The key renewing is much efficient because it is only confined to the keys of the key-path. The proposed protocol is flexible while the change of membership is frequent.},
keywords={},
doi={10.1093/ietfec/e88-a.10.2762},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - Identity-Based Key Agreement for Peer Group Communication from Pairings
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2762
EP - 2768
AU - Shyi-Tsong WU
AU - Jung-Hui CHIU
AU - Bin-Chang CHIEU
PY - 2005
DO - 10.1093/ietfec/e88-a.10.2762
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2005
AB - Some cryptographic schemes based on the bilinear pairings were proposed recently. In this paper, we apply the pairings on elliptic curve and Elliptic Curve Cryptography to the key agreement of dynamic peer group. Each member performs authentication and contributes a secret data to negotiate a group common key by means of a binary key tree. The proposed protocol does not need a dedicated central server to perform the key agreement, and the overhead is distributed among the group members. To provide a secure dynamic group communication, the key renewing mechanism has to be included. While the member joins/leaves, the group session key will be renewed to provide the backward/forward privacy, respectively. The key renewing is much efficient because it is only confined to the keys of the key-path. The proposed protocol is flexible while the change of membership is frequent.
ER -