An efficient group key establishment in location-aided mobile Ad hoc networks

PE-WASUN'05 - Proceedings of the Second ACM International Workshop on Performance Evaluation of Wireless Ad Hoc, Sensor, and Ubiquitous Networks

Volumn , Issue , 2005, Pages 57-64

  Li, Depeng ^a   Sampalli, Srinivas ^a  

^a DALHOUSIE UNIVERSITY   (Canada)

Author keywords

Group key management; Key tree; Maximum matching

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; INFORMATION THEORY; MOBILE RADIO SYSTEMS; SECURITY SYSTEMS; TOPOLOGY;

GROUP KEY MANAGEMENT; KEY TREE; MAXIMUM MATCHING;

NETWORK PROTOCOLS;

EID: 31844456886     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1089803.1089967     Document Type: Conference Paper

References (41)

1. n), IEEE Trans. on Computers, 51, 8, (Aug 2002).
2. Al-Riyami, S. and Paterson, K. G. Tripartite Authenticated key Agreement Protocols from Pairings. Cryptology ePrint Archieve, Report 2002/035, http:/eprint.iacr.org/2002/035.
3. Anton, E.R. and Duart, O.C. Group key establishment in wireless ad hoc networks. In E.R. Workshop en Qualidade de Servi, co e Mobilidade, Nov, 2002.
4. Anton, E.R. and Duart, O.C. Performance Analysis of Group Key Establishment Protocols in Ad Hoc Networks. 2003, http://www.gta.ufrj.br/ftp/ gta/TechReports/AnDu03a.ps.gz
5. Asokan, N. and Ginzboorg, P. Key Agreement in ad hoc networks. Computer Communications, 23, 17, (Nov. 2000), 1627-1637.
6. Ateniese, G., Steiner, M., and Tsudik, G. Authenticated Group Key Agreement and Friends. In Proceedings of ACM Conference on Computer and Communication Security (CCS'98), (San Francisco, Nov. 1998), pages 17-26.
7. Barua, R., Dutta, R., Sarkar, P. An n-party Key Agreement Scheme using Bilinear Map. International Association for Cryptologic Research (IACR), Vol. 2003(060-068), 2003, http://eprint.iacr.org/2003/062
8. Becker, K. and Wille, U. Communication complexity of group key distribution. Proceedings of ACM conference on Computer and communications security (CCS'98), 1-6.
9. Blake, I., Seroussi, G., Smart, N., and Cassels, J. W. S. Elliptic Curves in Cryptography, 34-36.
10. Boneh, D. and Franklin, M. Identity-Based Encryption from the Weil Pairing. In proceedings of Crypt '01, 213-229.
11. Boneh, D. and Silverberg, A. Applications of Multilinear forms to Cryptography. Http://eprint.iacr.org, Report 2002/080.
12. Burmester, M. and Desmedt, Y. A secure and efficient conference key distribution system. Advances in Cryptology-EUROCRYPT '94, LNCS 950, Berlin, 275-286, Springer.
13. Chan, K. and S.-H. G. Key management approaches to offer data confidentiality for secure multicast. IEEE Network, 17, 5, (Sept.-Oct. 2003), 30 - 39.
14. Chiang, T. and Huang, Y. Group keys and the multicast security in ad hoc networks. In Proceedings of International Conference on Parallel Processing Workshops, 385 - 390, Oct. 2003.
15. Diffie, W. and Hellman, M. New directions in cryptography. IEEE Trans. on Information Theory, 22, 6, (Nov., 1976), 644-654.
16. Du, X., Wang, Y., Ge, J., and Wang, Y. A group key establishment scheme for ad hoc networks. Advanced Information Networking and Applications, 2003 (March 2003), 518-520.
17. Edmonds, J. Paths, trees and flowers. Canadian Journal of Mathematics. 17, (1965), 449-467.
18. Eisentraeger, K., Lauter, K., Montgomery, P.L. Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation. Topics in Cryptology - CT-RSA (2003), 343-354.
19. Gabow, Harold N. An efficient implementation of Edmonds' algorithm for maximum matching on graphs. Journal of the ACM, 23, 2, (April 1976), 221-234.
20. Galil, Z. Efficient algorithms for finding maximum matching in graphs. ACM Computing Surveys (CSUR), 18, 1, (March 1986), 23-38.
21. Goddard, W., Hedetniemi, S.T., Jacobs, D.P., and Srimani, P. K. Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks. In Proceedings of International Parallel and Distributed Processing Symposium, (IPDPS'03), 87-96.
22. Gross, J. and Yellen, J. Graph theory and its applications. CRC Press, 1999.
23. Gupta, V., Gupta, S., and Chang, S. Performance Analysis of Elliptic Curve Cryptography for SSL. ACM Workshop, Wireless Security, Mobicom'02, pp. 87-94.
24. Ingemarsson, I., Tang, D., and Wong, C. A Conference Key Distribution System. IEEE Trans. on Information Theory, 28, 5, (Sep 1982), 714-720.
25. Izu, T. and Takagi,T. Efficient Computations of Tate Pairing for the large MOV degrees. International Conference Information Security and Cryptology (ICISC'02), (November, 2002), 283-297.
26. Joux, A. A one Round Protocol for Tripartite Diffie-Hellman. ANTS IV, (LNCS 1838, Springer-Verlag, 2000), 385-394.
27. Kim, Y., Perrig, A., and Tsudik, G. Simple and Fault-Tolerant Key Agreement for Dynamic Collaborative Groups. ACM Conference on Computer and Communications Security, (CCS'00), (Nov., 20002), 35-244.
28. Kim, Y., Perrig, A., and Tsudik, G. Tree-based group key agreement, cryptology ePrint Archive, Report 2002/009.
29. Kim, Y., Perrig, A., and Tsudik, G. Group Key Agreement Efficient in Communication. IEEE Computer Society, 2004.
30. Koblitz, N. Elliptic curve cryptosystems. Mathematics of Computation, 48, (1987), 203-209.
31. Lee, H. K., Lee, H.-S. and Lee, Y-R. Multi-Party Authenticated Key Agreement Protocols from Multilinear Forms. Cryptology ePrint Archive: Report 2002/166
32. Li, X., Wang, Y., Frieder, O. Efficient Hybrid Key Agreement Protocol for Wireless Ad Hoc Networks. In Proceedings of International Conference Computer Communications and Networks, (ICCCN'02), 404 - 409.
33. Miller, V. Uses of elliptic curves in cryptography. In proceedings of Advanced in Cryptology (crypto '85), (LNCS 218), New York, Springer-Verlag, 417-426.
34. Mohapatra, P., Cui, C. and Li, J. Group Communications in Mobile Ad Hoc Networks. IEEE Computer Society, (Feb. 2004), 52-59.
35. Steer, D., Strawczynski, L., Diffie, W., and Wiener, M. A secure audio teleconference system. Advances in cryptology (CRYPTO'88), LNCS403, Springer-Verlag, 1990, Berlin Germany, 520-528.
36. Steiner, M., Tsudik, G., and Waidner, M. Diffie-Hellman Key Distribution Extended to Groups communication. In ACM Conference on Computer and Communications Security (CCS'96), (New Delhi), 31-37.
37. Steiner, M., Tsudik, G., and Waidner, M. CLIQUES: A New Approach to Group Key Agreement. In Proceedings of the International Conference on Distributed Computing Systems (ICDCS'98), (Amsterdam, May 1998), 380-387.
38. Steiner, M., Ateniese, G., and Tsudik, G. New Multi-party Authentication Services and Key Agreement Protocols. IEEE Journal of Selected Area in Communications (JSAC), Special Issue on Network Security, 18, 4, (April 2000), 628-639.
39. Steiner, M., Tsudik, G., and Waidner, M. Key Agreement in Dynamic Peer Groups. IEEE Trans. on Parallel and Distributed Systems, II, 8, (August 2002), 769-780.
40. Tzeng, W.-G. and Tzeng, Z.-J. Round-efficient conference-key agreement protocols with provable security. In advances in Cryptology (ASIACRYPT'00), December 2000.
41. The Secure Multicast Research Group (SMuG), Internet Research Task Force (IRTF). [Online]. Available at: http://www.securemulticast.org/