Advertisement

A Chaos Based Secure Communication Scheme for Hybrid Message Logging and Asynchronous Checkpointing for Mobile Computing

  • Santo BanerjeeEmail author
  • S. Mukhopadhyay
Chapter
Part of the Understanding Complex Systems book series (UCS)

Abstract

Robustness of cellular networks in case of handling faults still remains a daunting task. Mobile computing technology has rapidly become can indispensable mode in various e-commerce transactions along with voice and video communication. With these facilities comes the threat of security and integrity of information which are equally important to be tackled as the seamless transfer of data from remote locations to other remote or fixed locations and has currently drawn significant attention in the research community. The traditional ways of cryptography have been exhaustively explored during the past few decades. This chapter seeks ways to explore the implementation of a complex dynamic system in cryptographic application for another dynamic system. Mobile communications deals with a dynamic system characterized with intermittent disconnections. In the light of these facts, this work introduces fault tolerance technique with secure checkpointing and message logging while handling of mobile disconnections.We propose a secure communication technique and an efficient key management methodology for mobile computing environment based on the chaotic sequences generated by an optical chaos system with high fluctuating chaotic orbits. To the best of our knowledge, very little work has been done based on chaos cryptography in mobile computing. We propose a) A hybrid message logging and asynchronous checkpointing scheme at receiver’s end with an improved performance where messages exchanged by Mobile Hosts (MH) are logged at the stable base station b) The proposed message logging is made secure by introducing cryptography devised from a two-way coupled chaotic laser system derived from Maxwell Bloch’s equations. The entire process serves a dual purpose. Firstly, chaos synchronization would form a secure channel through which physical transfer of the private keys would be completely eliminated. Thereby, reducing the computational overhead incurred during the complex way of exchanging keys in Diffie Hellman Key Exchange (DHKE) protocol. Secondly,the inherent randomness and deterministic properties of chaotic system renders the scheme immune to major attacks. The entire scheme has been labeled as Chaos Key Exchange (CKE) method which uses the chaotic sequences generated by a synchronized chaotic laser system as the private keys to be used in cryptographic purpose. As a consequence, CKE forms as an efficient key management system used during encrypting messages involving voluminous data such as multimedia and images. The proposed logging process as well as the communication of messages has been made secure by applying CKE method.CKE has been demonstrated by encoding an image which is transmitted over a secure channel.The ergodicity of the chaotic system adds the necessary confusion and diffusion properties required for efficient cryptography.Simulation result highlight the merit of the scheme which precisely recovers the messages at the receiver section thereby proving the robustness of the scheme which is efficiently extended to achieve secure logging of the messages.

Keywords

Chaotic System Mobile Host Chaotic Sequence Chaos Synchronization Cipher Image 
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.

References

  1. [1].
    Acharya, A., Badrinath, B.R.: Checkpointing distributed applications on mobile computers. In: Proceedings of the Third International Conference on Parallel and Distributed Information Systems, pp. 73–80 (1994)Google Scholar
  2. [2].
    Alvarez, G., Monotoya, G., Pastor, F., et al.: Chaotic cryptosystems. In: Proc. IEEE Int. Carnahan Conf. Security Technology, pp. 332–338 (1999)Google Scholar
  3. [3].
    Alvisi, L., Hoppe, B., Marzullo, K.: Nonblocking and orphan free message logging protocols. In: Proceedings of IEEE 23rd Int. Symp. Fault Tolerant Computing, pp. 145–154 (1993)Google Scholar
  4. [4].
    Asokan, N.: Anonymity in a mobile computing environment. In: Proceedings of Workshop in Mobile Computing Systems and Applications, Santa Cruz, California, pp. 200–204 (1994)Google Scholar
  5. [5].
    Banerjee, S., Ghosh, D., Ray, A., et al.: Synchronization between two different time-delayed systems and image encryption. Europhys. Lett. 81(2), 20006 (2008)CrossRefGoogle Scholar
  6. [6].
    Banerjee, S., Rondoni, L., Mukhopadhyay, S., et al.: Synchronization of spatio-temporal semiconductor lasers and its application in color image encryption. Optic. Comm. 284(9), 2278–2291 (2011)CrossRefGoogle Scholar
  7. [7].
    Banerjee, S., Saha, P., Chowdhury, A.R.: Chaotic aspects of lasers with host-induced nonlinearity and its control. Phys. Lett. A 291, 103–114 (2001)zbMATHCrossRefGoogle Scholar
  8. [8].
    Bhargava, B., Lian, S.R.: Independent checkpointing and concurrent rollback for recovery in distributed systems. In: Proceedings of Seventh Symposium Reliable Distributed Systems, p. 312 (1988)Google Scholar
  9. [9].
    Bhargava, B., Lilien, L.: Vulnerabilities and threats in distributed systems. Distributed computing and internet technology, p. 146. Springer (2004)Google Scholar
  10. [10].
    Bhargava, B., Zhong, Y., Lu, Y.: Fraud formalization and detection. In: Proc. Intl Conf on Data Warehousing and Knowledge Discovery DaWak (2002)Google Scholar
  11. [11].
    Cao, G., Singhal, M.: On the Impossibility of Min-Process Non-Blocking Checkpointing and an Efficient Checkpointing Algorithm for Mobile Computing Systems. In: Proceeding of the 27th International Conference on Parallel Processing, 37–44 (1998)Google Scholar
  12. [12].
    Chandy, M., Lamport, L.: Distributed snapshots: Determine global states of distributed. In: ACM Transactions on Computing Systems, 3(1), 63–75 (1985)CrossRefGoogle Scholar
  13. [13].
    Cho, J.H., Chen, I.R., Wang, D.C.: Performance optimization of region-based group key management in mobile ad hoc networks, Perform. Eval. 65(5), 319–344 (2008)CrossRefGoogle Scholar
  14. [14].
    Daza, V., Herranz, J., Morillo, P., et al.: Cryptographic techniques for mobile ad-hoc networks. Comput. Network. 51(18), 4938–4950 (2007)zbMATHCrossRefGoogle Scholar
  15. [15].
    Dedieu, H., Kennedy, M.P., Hasler, M.: Chaos shift keying: Modulation and demodulation of a chaotic carrier using self-synchronizing. IEEE Trans. Circuits Syst. II 40, 634–641 (1993)CrossRefGoogle Scholar
  16. [16].
    El-Barrv, M.I.H.A., Khan, S.A.: Design and analysis of a fault tolerant hybrid mobile scheme. Inform. Sci. 177(12), 2602–2620 (2007)CrossRefGoogle Scholar
  17. [17].
    Elnozahy, E.N., Johnson, D.B., Zwaenpoel, W.: The performance of consistent checkpointing. In: Proceedings of the 11th IEEE Symposium on Reliable Distributed Systems, pp. 39–47. Houston, TX (1992)Google Scholar
  18. [18].
    Feldmann, U., Hasler, M., Schwarz, W.: Communication by chaotic signals: The inverse system approach. Int. J. Circuit Theor. Appl. 24, 551–579 (1996)zbMATHCrossRefGoogle Scholar
  19. [19].
    Gerla, M., Kleinrock, L.: Vehicular networks and the future of the mobile internet. Comput. Network. 55(2), 457–469 (2011)CrossRefGoogle Scholar
  20. [20].
    Gickenheimer, J., Holmes, P.: Nonlinear oscillations. Dynamical systems and bifurcations of vector fields, p.  453. Springer, Berlin, Germany (1983)Google Scholar
  21. [21].
    Habutsu, T., Nishio, Y., Sasase, I., et al.: A secret key cryptosystem by iterating a chaotic map, in Advances in Cryptology – EUROCRYPT’91. Lecture Notes in Computer Science, vol. 547, pp. 127–140. Spinger (1991)Google Scholar
  22. [22].
    Halle, K.S., Wu, C.W., Itoh, M., et al.: Spread spectrum communication through modulation of chaos in Chua’s circuit. Int. J. Bifurc. Chaos 3, 469–477 (1993)zbMATHCrossRefGoogle Scholar
  23. [23].
    Kambhampati, V., Ray, I., Kim, E.: A secure checkpointing protocol for survivable server design, distributed computing and internet technology. Lecture Notes in Computer Science, pp. 430–440 (2005)Google Scholar
  24. [24].
    Klein, E., Mislovaty, R., Kanter, I., et al.: Public-channel cryptography using chaos synchronization. Phys. Rev. E 72, 016214 (2005)CrossRefGoogle Scholar
  25. [25].
    Kocarev, L.: Chaos-based cryptography: A brief overview. IEEE Circ. Syst. Mag. 1(3), 6–21 (2001)CrossRefGoogle Scholar
  26. [26].
    Li, Y.X., Tang, W.K.S., Chen, G.: Generating hyperchaos via state feedback control. Int. J. Bifurc. Chaos, 15(10), 3367–3375 (2005)CrossRefGoogle Scholar
  27. [27].
    Menezes, A.J., Oorschot, P.V., Vanstone, S.: Handbook of Applied Cryptography. Boca Raton: CRC Press (1997)zbMATHGoogle Scholar
  28. [28].
    Mukhopadhyay, S., Banerjee, S.: Cooperating swarms: A paradigm for collective intelligence and its application in finance. Int. J. Comput. Appl. 6(10), 31–41 (2010a)Google Scholar
  29. [29].
    Mukhopadhyay, S., Mitra, M., Banerjee, S.: Chaos Synchronization with Genetic Engineering Algorithm in secure communication. In: Banerjee, S. (ed.), Chaos Synchronization and Cryptography for Secure Communications: Applications for Encryption, IGI Global Publishers: U.S.A., pp. 476–509 (2010b)CrossRefGoogle Scholar
  30. [30].
    Nam, H., Kim, J., Hong, S.J., et al.: Secure checkpointing. J. Syst. Architect. 48, 237–254 (2003)CrossRefGoogle Scholar
  31. [31].
    Park, T., Woo, N., Yeom, H.Y.: An Efficient Optimistic Message Logging Scheme for Recoverable Mobile Computing Systems. IEEE Transactions on Mobile Computing 1(4), 265–277 (2002)CrossRefGoogle Scholar
  32. [32].
    Pecora, L.M., Carroll, T.L.: Synchronization in chaotic systems. Phys. Rev. Lett. 64, 821–824 (1990)MathSciNetCrossRefGoogle Scholar
  33. [33].
    Plank, J.X., Netzer, R.: Compressed differences: an algorithm for fast incremental checkpointing. Technical Report CS, University of Tennesse, pp. 95–302 (1995)Google Scholar
  34. [34].
    Schneier, B.: Applied cryptography: protocols, algorithm, and source code in C. Wiley, New York (1996)Google Scholar
  35. [35].
    Strom, R., Yemini, S.: Optimistic Recovery in Distributed Systems. ACM Trans. Comput. Syst. 3, 204–226 (1985)CrossRefGoogle Scholar
  36. [36].
    Shannon, C.E.: Communication theory of secrecy systems. Bell Syst. Tech. J. 28, 656–715 (1949)MathSciNetzbMATHGoogle Scholar
  37. [37].
    Tang, G., Liao, X., Chen, Y.: A novel method for designing S-boxes based on chaotic maps. Chaos, Solitons, Fractals, 23, 413–419 (2005)zbMATHCrossRefGoogle Scholar
  38. [38].
    Zhou, H., Ling, X.: Problems with the chaotic inverse system encryption approach. IEEE Trans. Circuits Syst. I. 44, 268–271 (1997)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  1. 1.Politecnico di TorinoTorinoItaly
  2. 2.Micro and Nanotechnology UnitTechfab s.r.l.ChivassoItaly
  3. 3.Army Institute of ManagementKolkataIndia

Personalised recommendations