[ 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.
