Advertisement

Wireless Networks

, Volume 21, Issue 4, pp 1243–1258 | Cite as

Multi-party encryption (MPE): secure communications in delay tolerant networks

  • Roy Cabaniss
  • Vimal Kumar
  • Sanjay Madria
Article

Abstract

Mobile ad hoc networks are a subset of delay tolerant networks (DTNs) composed of several mobile devices. These dynamic environments make conventional security algorithms unreliable; nodes located far apart from each other may not have access (available) to each other’s public keys or have doubt on the validity of public-keys, making secure message exchange difficult. Furthermore, ad hoc networks are likely to be highly compromised and therefore may be untrusted. Other security methods, such as identity-based encryption and Kerberos, rely on requesting key data from a trusted third party, which can be unavailable or compromised in a DTN like environment. The purpose of this paper is to introduce two security overlay networks capable of delivering messages securely, preventing both eavesdropping and alteration of messages. The first algorithm, Chaining, uses multiple midpoints to re-encrypt the message for the destination node. The second, Fragmenting, separates the message key into pieces that are routed and secured independently from each other. Both techniques improve security in hostile environments; under test conditions, Chaining reduces the number of messages intercepted by 90 %, and Fragmenting by 83 %. This improvement has a performance trade-off, however, reducing the delivery ratio by 63 % in both algorithms.

Keywords

Security Chaining encryption Delay tolerant networks Threshold encryption Fragmented keys 

References

  1. 1.
    Al-Shurman, M., Yoo, S.-M., & Park, S. (2004). Black hole attack in mobile ad hoc networks. In ACM Southeast regional conference (pp. 96–97).Google Scholar
  2. 2.
    Bhutta, N., Ansa, G., Johnson, E., Ahmad, N., Alsiyabi, M., & Cruickshank, H. (2009). Security analysis for delay/disruption tolerant satellite and sensor networks. In International workshop on satellite and space communications, 2009. IWSSC 2009 (pp. 385–389).Google Scholar
  3. 3.
    Cabaniss, R., Kumar, V., & Madria, S. (2012). Three point encryption (3PE): Secure communications in delay tolerant networks. In SRDS. IEEE (pp. 479–480).Google Scholar
  4. 4.
    Camtepe, S. A., & Yener, B. (2005). Key distribution mechanisms for wireless sensor networks: A survey. Technical report.Google Scholar
  5. 5.
    Capkun, S., Buttyn, L., & Hubaux, J.-P. (2002). Self-organized public-key management for mobile ad hoc networks. IEEE Transactions on Mobile Computing, 2, 52–64.CrossRefGoogle Scholar
  6. 6.
    Dimitriou, T., & Michalas, A. (2014). Multi-party trust computation in decentralized environments in the presence of malicious adversaries. Ad Hoc Networks, 15, 53–66 (Smart solutions for mobility supported distributed and embedded systems).Google Scholar
  7. 7.
    Dolev, S., Gilboa, N., & Kopeetsky, M. (2014). Efficient private multi-party computations of trust in the presence of curious and malicious users. Journal of Trust Management, 1, 8. doi: 10.1186/2196-064X-1-8.
  8. 8.
    El Defrawy, K., Solis, J., & Tsudik, G. (2009). Leveraging social contacts for message confidentiality in delay tolerant networks. In 2009 33rd annual IEEE international computer software and applications conference. IEEE (pp. 271–279).Google Scholar
  9. 9.
    Golle, P., Jakobsson, M., Juels, A., & Syverson, P. (2002). Universal re-encryption for mixnets. In RSA conference, cryptographer’s track (pp. 163–178). Springer.Google Scholar
  10. 10.
    Jain, M., & Kandwal, H. (2009). A survey on complex wormhole attack in wireless ad hoc networks. In International conference on advances in computing, control, and telecommunication technologies (Washington, DC, USA, 2009), ACT’09 (pp. 555–558). IEEE Computer Society.Google Scholar
  11. 11.
    Katz, J., & Yung, M. (2001). Threshold cryptosystems based on factoring. Cryptology ePrint Archive, Report 2001/093.Google Scholar
  12. 12.
    Kong, J., Zerfos, P., Luo, H., Lu, S., & Zhang, L. (2001). Providing robust and ubiquitous security support for manet. In Proceedings of IEEE international conference on network protocols (ICNP).Google Scholar
  13. 13.
    Kong, Y., Deng, J., & Tate, S. R. (2010). A distributed public key caching scheme in large wireless networks. In Proceedings of IEEE global telecommunications conference—communication and information system security (GLOBECOM’10). Miami, FL, USA, December 6–10 2010.Google Scholar
  14. 14.
    Kosta, S., Mei, A., & Stefa, J. (2010). Small world in motion (SWIM): Modeling communities in ad-hoc mobile networking. In Proceedings of the seventh annual IEEE communications society conference on sensor, mesh and ad hoc communications and networks, SECON 2010 (pp. 10–18). June 21–25, 2010, Boston, Massachusetts, USA.Google Scholar
  15. 15.
    Levine, B. N., Shields, C., & Margolin, N. B. (2006). A survey of solutions to the sybil attack. Technical report 2006–052, University of Massachusetts Amherst, Amherst, MA, October 2006.Google Scholar
  16. 16.
    Lewand, R. E. (2000). Cryptological mathematics (classroom resource materials). Washington, DC: The Mathematical Association of America.Google Scholar
  17. 17.
    Lindgren, A., Doria, A., & Schelén, O. (2003). Probabilistic routing in intermittently connected networks. SIGMOBILE Mobile Computing and Communications Review, 7, 19–20.CrossRefGoogle Scholar
  18. 18.
    Madria, S. K., & Yin, J. (2009). Serwa: A secure routing protocol against wormhole attacks in sensor networks. Ad Hoc Networks, 7(6), 1051–1063.CrossRefGoogle Scholar
  19. 19.
    Menezes, A., & Ustaoglu, B. (2006). On the importance of public-key validation in the mqv and hmqv key agreement protocols. In Proceedings of the 7th international conference on cryptology in India (Berlin, Heidelberg, 2006), INDOCRYPT’06 (pp. 133–147). Springer.Google Scholar
  20. 20.
    Newsome, J., Shi, E., Song, D., & Perrig, A. (2004). The sybil attack in sensor networks: Analysis defenses. In Third international symposium on information processing in sensor networks, 2004. IPSN 2004 (pp. 259–268).Google Scholar
  21. 21.
    Patra, R., Surana, S., & Nedevschi, S. (2008). Hierarchical identity based cryptography for end-to-end security in dtns. In 4th international conference on intelligent computer communication and processing, 2008. ICCP 2008 (pp. 223–230).Google Scholar
  22. 22.
    Shamir, A. (1979). How to share a secret. Communications of the ACM, 22(11), 612–613.CrossRefzbMATHMathSciNetGoogle Scholar
  23. 23.
    Stajano, F., & Anderson, R. (1999). The resurrecting duckling: Security issues for ad-hoc wireless networks. In Proceedings of 7th International Workshop on Security Protocols, Cambridge. Picture Notes in Computer Science (Vol. 1796, pp. 172–194). Berlin: Springer.Google Scholar
  24. 24.
    Stinson, D. R. (2005). Cryptography: theory and practice, third edition (discrete mathematics and its applications).  Boca Raton: Chapman & Hall/CRC.Google Scholar
  25. 25.
    Syverson, P. F., Reed, M. G., & Goldschlag, D. M. (1997). Private web browsing. Journal of Computer Security, 5(3), 237–248.Google Scholar
  26. 26.
    Vakde, G., Bibikar, R., Le, Z., & Wright, M. (2011). Enpassant: Anonymous routing for disruption-tolerant networks with applications in assistive environments. Security and Communication Networks, 4(11), 1243–1256.CrossRefGoogle Scholar
  27. 27.
    Wu, B., Chen, J., Wu, J., & Cardei, M. (2007). A survey of attacks and countermeasures in mobile ad hoc networks. In Y. Xiao , X. S. Shen & D.-Z. Du (Eds.), Wireless network security, signals and communication technology (pp. 103–135). US: Springer.Google Scholar
  28. 28.
    Yin, J., & Madria, S. K. (2006). A hierarchical secure routing protocol against black hole attacks in sensor networks. In SUTC (1) (pp. 376–383).Google Scholar
  29. 29.
    Zhou, L., & Haas, Z. J. (1999). Securing ad hoc networks. IEEE Network Magazine, 13, 24–30.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Department of Computer ScienceMissouri University of Science and TechnologyRollaUSA

Personalised recommendations