Skip to main content

Advertisement

Springer Nature Link
Log in

An Efficient Hybrid Cryptographic Algorithm, Consuming Less Time for Exchanging Information in Wireless Sensor Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Set of autonomous nodes attached together and to a base station, working in a particular system is called wireless sensor network. Due to its wireless and dynamic nature, wireless sensor networks (WSNs) are easily attacked in comparison to wired networks. Now days, WSNs are not only used as routers but also working as communication end points as well as considered responsible for security of exchanging information. For fulfilling the security requirements in WSNs, scheme cryptography is widely used in which signed messages are being transferred from node to node. Cryptography is mainly classified in symmetric and asymmetric schemes. Public and private keys are used for encryption and decryption process in asymmetric key cryptography while single key is used in symmetric cryptography. Asymmetric cryptography provides high level of security and authenticity on cost of consumption of high amount of memory, power and bandwidth. On the other hand, symmetric key cryptography is considerably efficient and less resource consuming but providing less security level. Efficiency of network is considered is assumed major issue in exchanging of information in WSNs. In this paper, keeping efficiency of network in consideration, such hybrid algorithm has been suggested which satisfies the required security levels on high efficiency level. The proposed hybrid algorithm proves scalable and its performance is quite faster than single asymmetric cryptography and more secure than symmetric algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
€32.70 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (France)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  1. Rivest, R. L., Shamir, A., & Adleman, L. A. (1998) A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 120–126.

  2. Heinzelman, W., Kulik, J., & Balakrishnan, H. (1999). Adaptive protocols for information dissemination in wireless sensor networks. In Proceedings of the 5th ACM/IEEE mobicom conference, Seattle, WA.

  3. Chu, M., Haussecker, H., & Zhao, F. (2002). Scalable information-driven sensor querying and routing farad hoc heterogeneous sensor networks. The International Journal of High Performance Computing Applications, 16(3), 293–313.

    Article  Google Scholar 

  4. Ganesan, P., Venugopalan, R., Peddabachagari, P., Dean, A., Mueller, F., & Sichitiu, F. M. (2003). Analyzing and modeling encryption overhead for sensor network nodes. In Proceedings of the WSNA, pp. 151–159.

  5. Karlof, C., & Wagner, D. (2003). Secure routing in sensor networks: Attacks and counter measures. In Proceedings of the 1st IEEE workshop on sensor network protocols and applications, pp. 1–15.

  6. Gura, N., Patel, A., Wander, A., Eberle, H., & Shantz, S. (2004). Comparing elliptic curve cryptography and RSA on 8-bit CPUs. In Proceedings of the 6th international workshop on cryptographic hardware and embedded systems, Cambridge, MA, pp. 119–132.

  7. Perrig, A., Stankovic, J., & Wagner, D. (2004). Security in wireless sensor networks. Communications of the ACM, 47(6), 53–57.

    Article  Google Scholar 

  8. Liu, D., & Ning, P. (2005). Improving key pre-distribution with deployment knowledge in static sensor networks. ACM Transactions on Sensor Networks, 1(2), 204–239.

    Article  Google Scholar 

  9. Renesse, R. D. & Aghvami, A. H. (2005). Formal verification of ad-hoc routing protocols using spin model checker. In IEEE melecon, pp. 12–15.

  10. Wander, A., Gura, N., Eberle, H., Gupta, V., & Shantz, S. (2005). Energy analysis of public-key cryptography for wireless sensor networks. In Proceedings of the third IEEE international conference on pervasive computing and communications (PERCOM), pp. 324–328, March 08–12.

  11. Kifayat, K., Merabti, M., Shi, Q., & Llewellyn-Jones, L. (2007). Group based secure communication for large-scale wireless sensor networks. Journal of Information Assurance and Security, 2(2), 139–147.

    Google Scholar 

  12. Rousan, M., Rjoub, A., & Baset, A. (2007). A low-energy security algorithm for exchanging information in wireless sensor networks. Journal of Information Assurance and Security, 4, 48–59.

    Google Scholar 

  13. Sorniotti, A., K, L. Gomez., & Odorico, L. (2007). Secure and trusted in-network data processing in wireless sensor networks: A survey. Journal of Information Assurance and Security, 2(3), 189–199.

    Google Scholar 

  14. Basler, C. F., & Aguilar, P. V. (2008). Progress in identifying virulence determinants of the 1918 H1N1 and the Southeast Asian H5N1 influenza A viruses: Review article. Antiviral Research, 79(3), 166–178.

    Article  Google Scholar 

  15. Mukherjee, Y. B., & Ghosal, D. (2008). Wireless sensor network survey, 52(12), 2292–2330.

    Google Scholar 

  16. Tripathy, S., & Nandi, S. (2008). Defense against outside attacks in wireless sensor networks, 31(4), 818–826.

    Google Scholar 

  17. Ssu, K. F., Wang, W. T., & Chang, W. C. (2009). Detecting sybil attacks in wireless sensor networks using neighboring information, 53(18), 3042–3056.

    MATH  Google Scholar 

  18. Misra, S., & Thomasinous, P. D. (2010). A simple, least-time, and energy-efficient routing protocol with one-level data aggregation for wireless sensor networks. Journal of Systems and Software, 83(5), 852–860.

    Article  Google Scholar 

  19. Xie, M., Han, S., Tian, B., & Parvin, S. (2011). Anomaly detection in wireless sensor networks: A survey. Journal of Network and Computer Applications, 34(4), 1302–1325.

    Article  Google Scholar 

Download references

Acknowledgments

This work is supported by Erasmus Mundus Action 2 STRoNG-TiES scholarship program awarded by European Union and Higher Education Commission of Pakistan.

Author information

Authors and Affiliations

  1. Faculty of Computer Science and Management, Wroclaw University of Technology, Wrocław, Poland

    Piyar Ali Jatoi

  2. Mehran University of Engineering and Technology, Jamshoro, Pakistan

    Piyar Ali Jatoi, Aftab A. Memon & B. S. Chowdhry

  3. Usman Institute of Technology, Karachi, Pakistan

    M. Ghazanfar Ullah & Shiraz Latif

Authors
  1. Piyar Ali Jatoi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aftab A. Memon
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. S. Chowdhry
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. M. Ghazanfar Ullah
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Shiraz Latif
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Piyar Ali Jatoi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jatoi, P.A., Memon, A.A., Chowdhry, B.S. et al. An Efficient Hybrid Cryptographic Algorithm, Consuming Less Time for Exchanging Information in Wireless Sensor Networks. Wireless Pers Commun 85, 449–462 (2015). https://doi.org/10.1007/s11277-015-2748-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-015-2748-9

Keywords

Search

Navigation