A Dynamic Key Agreement Mechanism for Mission Critical Mobile Ad Hoc Networking

  • Ioannis G. Askoxylakis
  • Theo Tryfonas
  • John May
  • Apostolos Traganitis
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 45)


Mobile ad hoc networks are expected to play an important role in demanding communications such as military and emergency response. In Mobile ad hoc networking each node relies on adjacent nodes in order to achieve and maintain connectivity and functionality. While offering many advantages, such as flexibility, easy of deployment and low cost, mobile ad hoc networking faces important security threats that could be proven vital in future telecommunication applications. This paper introduces a key dynamic agreement method based on a weak to strong authentication mechanism associated with a multiparty contributory key establishment method. It is designed for dynamic changing topologies, it employs elliptic curve cryptography to best serve thin clients with energy constrains, and reduces significantly key re-establishment due to network formation changes.


MANET security password authentication elliptic curve cryptography key agreement 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Verikoukis, C., Alonso, L., Giamalis, T.: Cross-Layer Optimization for Wireless Systems: A European Research Key Challenge. IEEE Communications Magazine 43(7), 1–3 (2005)CrossRefGoogle Scholar
  2. 2.
    Bonnefoi, P.-F., Sauveron, D., Park, J.H.: MANETS: an exclusive choice between use and security? Special Issue on Interactive Multimedia & Intelligent Services in Mobile and Ubiquitous Computing (MUC) of Computing And Informatics 27(5) (2008)Google Scholar
  3. 3.
    Narayanan, A., Shmatikov, V.: Fast dictionary attacks on passwords using time-space trade-off. In: Proceedings of the 12th ACM conference on Computer and communications security, Alexandria, VA, USA (2005)Google Scholar
  4. 4.
    Bellovin, S.M., Merrit, M.: Encrypted key exchange: Password based protocols secure against dictionary attacks. In: Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland, USA (May 1992)Google Scholar
  5. 5.
    Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory 22, 644–654 (1976)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Cucker, F., Smale, S.: Complexity estimates depending on condition and round off error. Journal of the Association for Computing Machinery 46(1), 113–184 (2000)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation 4(8), 203–209 (1987)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Rivest, R., Shamir, A., Adleman, L.M.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM 21(2), 120–126 (1978)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Menezes, A., Okamoto, T., Vanstone, S.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory 39, 1639–1646 (1993)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Menezes, A., Teske, E., Weng, A.: Weak Fields for ECC. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 366–386. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  11. 11.
    Johnson, D., Vanstone, S.: The elliptic curve digital signature algorithm (ECDSA). International Journal on Information Security 1, 36–63 (2001)CrossRefGoogle Scholar
  12. 12.
    Kalele, A., Sule, V.R.: Weak keys of pairing based Diffie-Hellman schemes on elliptic curves, Cryptology ePrint Archive 2005/30 (2005)Google Scholar
  13. 13.
    Zheng, D., Chen, K., You, J.: Multiparty authentication services and key agreement protocols with semi-trusted third party. Journal of Computer Science and Technology archive 17(6), 749–756 (2002)MathSciNetCrossRefMATHGoogle Scholar
  14. 14.
    Ateniese, G., Steiner, M., Tsudik, G.: New Multiparty Authentication Services and Key Agreement Protocols. IEEE Journal of Selected Areas in Communications 18(4) (April 2000)Google Scholar
  15. 15.
    Becker, C., Wille, U.: Communication complexity of group key distribution. In: 5th ACM Conference on Computer and Communications Security, San Francisco, California (November 1998)Google Scholar
  16. 16.
    Asokan, N., Ginzboorg, P.: Key agreement in ad hoc networks. Computer Communications 23, 1627–1637 (2000)CrossRefGoogle Scholar
  17. 17.
    Askoxylakis, I.G., Kastanis, D.D., Traganitis, A.P.: Elliptic curve and password based dynamic key agreement in wireless ad-hoc networks, Communications, Networks and Information Security CNIS-2006, Cambridge, USA (October 2006)Google Scholar
  18. 18.
    Askoxylakis, I.G., Sauveron, D., Markantonakis, K., Tryfonas, T., Traganitis, A.: A Body-Centered Cubic Method for Key Agreement in Dynamic Mobile Ad Hoc Networks. In: Second International Conference on Emerging Security Information, Systems and Technologies, Cap Esterel, France, August 25-29, pp. 193–202 (2008)Google Scholar
  19. 19.
    Askoxylakis, I.G., Markantonakis, K., Tryfonas, T., May, J., Traganitis, A.: A Face Centered Cubic Key Agreement Mechanism for Mobile Ad Hoc Networks. In: First International ICST Conference on Mobile Lightweight Wireless Systems, MOBILIGHT 2009, Athens, Greece, May 18-20, pp. 103–113 (2009)Google Scholar

Copyright information

© ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering 2010

Authors and Affiliations

  • Ioannis G. Askoxylakis
    • 1
    • 2
  • Theo Tryfonas
    • 2
  • John May
    • 2
  • Apostolos Traganitis
    • 1
  1. 1.Foundation for Reserach and TechnologyHellas - Institute of Computer ScienceHeraklionGreece
  2. 2.Faculty of EngineeringUniversity of BristolClifton, BristolUK

Personalised recommendations