Multi-Agent System Protecting from Attacking with Elliptic Curve Cryptography

  • Xu Huang
  • Pritam Gajkumar Shah
  • Dharmendra Sharma
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 4)


Today’s software applications are mainly characterized by their component-based structures which are usually heterogeneous and distributed. Agent technology provides a method for handling increasing software complexity and supporting rapid and accurate decision making. This paper first investigated multiagent applying for key exchange. Security systems have been drawing great attentions as cryptographic algorithms have gained popularity due to the natures that make them suitable for use in constrained environment such as mobile sensor information applications, where computing resources and power availability are limited. Elliptic curve cryptography (ECC) is one of them, which requires less computational power, communication bandwidth, and memory in comparison with other cryptosystem. In particularly, for saving pre-computing storages recently there is a trend for the sensor networks that the sensor group leaders rather than sensors communicate to the end database, which highlighted the needs to prevent from the man-in-the middle attack. Due to the multiagent system (MAS) used the whole system becomes easy to be used. In particularly we designed a hidden generator point that offer a good protection from the man-in-the middle (MinM) attack which becomes one of major worries for the sensor’s networks with MAS.


Sensor Network Elliptic Curve Multiagent System Elliptic Curf Certificate Authority 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Logan, B., Theodoropoulos, G.: The distributed simulation of multi-agent systems. Proceedings of IEEE 89, 174–186 (2001)CrossRefGoogle Scholar
  2. 2.
    Eiter, T., Mascardi, V.: Comparing Environments for Developing Software Agents. INFSYS Research Report 1843-01-02, Tech. Univ. Wien, Austria (2001)Google Scholar
  3. 3.
    Miller, V.S.: Uses of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–426. Springer, Heidelberg (1986)Google Scholar
  4. 4.
    Research Report 1843-01-02, Tech. Univ. Wien, Austria (2001)Google Scholar
  5. 5.
    Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Compution 48(177), 203–209 (1987)zbMATHMathSciNetGoogle Scholar
  6. 6.
    Hakerson, D., Menezes, A., Vanston, S.: Guide to Elliptic Curve Cryptography. Springer, NY (2004)Google Scholar
  7. 7.
    Cohen, H., Miyaji, A., Ono, T.: Efficient elliptic curve exponentiation using mixed coordinates. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 51–65. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  8. 8.
    Dimitrov, V.S., Imbert, L., Mishra, P.K.: Efficient and secure elliptic curve point multiplication using double-base chains. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 59–78. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Ciet, M., Joye, M., Lauter, K., Montgomery, P.L.: Trading inversions for multiplications in elliptic curve cryptography. Designs, Codes, and Cryptography 39, 189–206 (2006)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Bernstein, D.: High-speed diffie-hellman, part 2. Presented at the INDOCRYPT 2006 tutorial session, Kolkata, India, December 11-13 (2006)Google Scholar
  11. 11.
    Kaabneh, K., Al-Bdour, H.: Key exchange protocol in elliptic curve cryptography with no public point. American Journal of Applied Sciences 2(8), 1232–1235 (2005)CrossRefGoogle Scholar
  12. 12.
    Adikari, J., Dimitrov, V., Imbert, L.: Hybrid binary-ternary joint sparse from and its application in ellipic curve cryptography. Cryptology ePrint Archive, Report 2008/285 (2008)Google Scholar
  13. 13.
    Wang, B., Zhang, H., Wang, Y.: An efficient elliptic curves scalar multiplication for wireless network. In: 2007 IFIP International Conference on Network and Parallel Computing-Workship, p. 131 (2007)Google Scholar
  14. 14.
    Ma, S., Hao, Y., Pan, Z., Chen, H.: Fast implementation for modular inversion and scalar multiplication in the elliptic curve cryptography. In: 2008 Second International Symposium on Intelligent Information Technology Application, p. 488 (2008)Google Scholar
  15. 15.
    Scott, M.: Optimal Irreducible Polynomials for GF(2m) Arithmetic, Cryptology ePrint Archive, Report 2007/192 (2007)Google Scholar
  16. 16.
    Wang, H., Sheng, B., Li, Q.: Elliptic curve cryptography-based access control in sensor networks. International Journal of Security and Networks 1(3/4) (2006)Google Scholar
  17. 17.
    Liu, A., Kampanakis, P., Ning, P.: TinyECC: Elliptic curve cryptography for sensor networks (version 10) (November 2007)Google Scholar
  18. 18.
    Doche, C., Kohel, D., Sica, F.: Double-base number system for multiscalar multiplications, Cryptology ePrint Archive, Report 2008/288 (2008)Google Scholar
  19. 19.
    Stallings, W.: Cryptography and Network Security: Principles and Practice, 2nd edn. Prentice-Hall, Upper Saddle River (1999)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2010

Authors and Affiliations

  • Xu Huang
    • 1
  • Pritam Gajkumar Shah
    • 1
  • Dharmendra Sharma
    • 1
  1. 1.Faculty of Information Sciences and EngineeringUniversity of CanberraAustralia

Personalised recommendations