|Table of Contents|

Key Agreement Scheme for Dynamic Secure Multicast Based on Connected Dominating Set(PDF)

南京师范大学学报（工程技术版）[ISSN:1006-6977/CN:61-1281/TN]

Issue:
2007年01期
Page:
68-71
Research Field:
Publishing date:

Info

Title:
Key Agreement Scheme for Dynamic Secure Multicast Based on Connected Dominating Set
Author(s):
Ding Yongping
School of Mathematics and Computer Science,Nanjing Normal University,Nanjing 210097,China
Keywords:
secure mu lticast;  key ag reem ent;  connected dom inating set;  elliptic curve cryptosystem
PACS:
TN918.1
DOI:
-
Abstract:
H ow to des ign effic ient key agreem ent schem es is a d ifficult problem in dynam ic securem ulticast. In th is pape r, w e propose a nove l key agreem en t schem e using E lliptic Curve Crypto system fo r dynam ic secu re mu lticast based on CDS( Connected Dom inating Set). F irst, we use CDS g roup ing ar ithm etic to partition the mu lticast group m em bers. Then w e apply E lliptic Curve Crypto system to the procedure of key agreem ent of every subg roup and the entire mu lticast group. Adopting the CDS structure not only increases the system ag ility and avo ids producing h itches, but a lso im proves the sy stem haleness. App ly ing E lliptic Curve Crypto system decreases the computation of key agreem en t and cryptography arithm etic. W e a lso analyze the pro cedure of key agreem ent of every subgroup and the entire m ulticast g roup, and the procedure of upda ting of group keys w ith the dynam ic change of group m em bers in detai.l The ana ly sis show s tha t our scheme is not only effic ient in com puta tion and comm un ication, but also sa tisfies the security requ irem ents of mu lticast key agreem ent.

References:

[ 1] Berkov its S. H ow to broadcast a secre t[ C ] / / Advances in Crypto logy - EUROCRYPTO ’91. B erlin: Springer-Ver lag, 1991, LNCS 547: 535-541.
[ 2] Boneh D, Gentry C, W ate rs B. Co llus ion resistant broadcast encryption w ith short ciphertex ts and pr ivate keys[ C ] / / Adv ances in Cryptology-CRYPTO ’05. Ber lin: Springer-Verlag, 2005, LNCS 3621: 258-275.
[ 3] H ankerson D, M enezes A, V anstone S. Gu ide to E lliptic Curve C ryptography [M ]. New York: Springer-V erlag, 2004: 75- 198.
[ 4] M enezes A, Oorschot P, Vanstone S. H andbook of Applied Cryptography[M ]. New York: CRC Press, 1997: 425-488.
[ 5] Ste inerM, Tsudik G, W a idnerM. CLIQUES: A new approach to group key ag reem ent[ C] / / Proceed ings o f 18 th Inte rnational Conference on D istributed Com puting System s. Amsterdam, New York: IEEE Computer Soc ie ty Press, 1998: 380-387.
[ 6] Becker K. Communication com plex ity o f group key distribution[ C] / / Proceed ing s o f 5th ACM Conference on Computer and Communications Secur ity. New York: ACM Press, 1998: 1-6.
[ 7] K im Y, Perrig A, Tsudik G. Tree-based group key agreem en t[ J]. ACM Transactions on Inform ation and System Security( T ISSEC), 2004, 7( 1): 60-96.
[ 8] W an P, A lzoubi K, Frieder O. Distributed construction of connected dom inating se t in w ire less ad hoc netwo rks[ J]. M ob ile Netwo rks and Applications, 2004, 9( 2): 141-149.
[ 9] A lzoub iK, W an P, Frieder O. M essage-optima l connected-dom inating-set construc tion for routing in m obile ad hoc netwo rks [ C] / / Proceed ing s o f 3rd ACM Internationa l Symposium M obile AdH o cNetw ork ing and Computing. N ew Yo rk: ACM Press, 2002: 157-164.
[ 10] Zhang F, W ang Y. Study and advance o f hyper-e lliptic curves cryp to system s[ J]. Ac taE lectronica S inica, 2002, 30( 1): 126- 131.
[ 11] Oorschot P, W ienerM. Para llel co llision search w ith cryptanalytic applica tions[ J]. Journa l of Crypto logy, 1999, 12( 1): 1- 28.

Memo

Memo:
-
Last Update: 2013-04-29