End-to-End Security in Delay Tolerant Mobile Social Network

  • Rinki Rani
  • C. P. KattiEmail author
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 899)


In a Delay Tolerant Mobile Social Network (MSN) it is very difficult to maintain end-to-end security, which makes it vulnerable to various attacks like black hole attack, spoofing, modifies routing packets, packets dropping and many more. Apart from the attacks, there are various challenges in security of MSN like access control, confidentiality and intrusion detection system. Previously proposed model for security mechanism like efficient certificateless aggregate signature scheme provides security without the headache of maintaining the certificate, but the cost of signature verification is very high. So, to resolve these problems we are using HIBE (Hierarchical Identity Based Encryption) and proposing SPCRP (Secure Profile Cast Routing Protocol) which will provide end-to-end security along with the efficient key management, fine grained revocation and make sure the authorized access. We used ONE (Opportunistic Network) simulator with Profile Cast Routing protocol and observed various parameter overhead_ratio, number of messages transmitted, threshold value. We can conclude that this secure environment provides integrity, confidentiality and didn’t reveal the behavioural profile of the users.


DTN MSN HIBE Routing protocol Security 



This research has been partially supported by the Council of Scientific and Industrial Research, a research and development organization in India, with sanctioned no. 09/263(1054)/2015-EMR-I.


  1. 1.
    Nguyen, H.: Mobile social network and its open research problems. Department of Computer Science, University of Houston, Houston (2010)Google Scholar
  2. 2.
    Boneh, D., Boyen, X., Goh, E.-J.: Hierarchical identity based encryption with constant size ciphertext. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 440–456. Springer, Heidelberg (2005). Scholar
  3. 3.
    Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001). Scholar
  4. 4.
    Keränen, A., Ott, J., Kärkkäinen T.: The ONE simulator for DTN protocol evaluation. In: Proceedings of the 2nd International Conference on Simulation Tools and Techniques (2009)Google Scholar
  5. 5.
    Leguay, J., Friedman, T., Conan V.: Evaluating mobility pattern space routing for DTNs. In: Proceedings of IEEE INFOCOM (2006)Google Scholar
  6. 6.
    Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks. Technical report CS-200006, Duke University (2000)Google Scholar
  7. 7.
    Daly, E., Haahr, M.: Social network analysis for routing in disconnected delay-tolerant MANETs. In: Proceedings of ACM MOBIHOC (2007)Google Scholar
  8. 8.
    Hui, P., Crowcroft, J., Yoneki, E.: Bubble rap: social-based forwarding in delay tolerant ZNetworks. In: Proceedings of ACM MOBIHOC (2008)Google Scholar
  9. 9.
    Motani, M., Srinivasan, V., Nuggehalli, P.: PeopleNet: engineering a wireless virtual social network. In: Proceedings of MOBICOM 2005 (2005)Google Scholar
  10. 10.
    Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. In: Dini, P., Lorenz, P., de Souza, J.N. (eds.) SAPIR 2004. LNCS, vol. 3126, pp. 239–254. Springer, Heidelberg (2004). Scholar
  11. 11.
    Thomas, M., Gupta, A., Keshav, S.: Group based routing in disconnected ad hoc networks. In: Proceedings of 13th Annual IEEE International Conference on High Performance Computing (2006)Google Scholar
  12. 12.
    Perkins, C.E., Belding-Royer, E.M.: Ad-hoc on-demand distance vector routing. In: WMCSA, pp. 90–100 (1999)Google Scholar
  13. 13.
    Hsu, W.J., Dutta, D., Helmy, A.: CSI: a paradigm for behavior-oriented profile-cast services in mobile networks. Ad Hoc Netw. 10(8), 1586–1602 (2012)CrossRefGoogle Scholar
  14. 14.
    Vastardis, N., Yang, K.: Mobile social networks: architectures, social properties and key research challenges. IEEE Commun. Surv. Tutor. 15(3), 1355–1371 (2013)CrossRefGoogle Scholar
  15. 15.
    Liang, X., Li, X., Zhang, K., Lu, R., Lin, X., Shen, X.S.: Fully anonymous profile matching in mobile social networks. IEEE J. Sel. Areas Commun. 31(9), 641–655 (2013)CrossRefGoogle Scholar
  16. 16.
    Liu, H., Liang, M.: Efficient identity-based hierarchical access authentication protocol for mobile network. Secur. Commun. Netw. 6(12), 1509–1521 (2013)CrossRefGoogle Scholar
  17. 17.
    Li, M., Yu, S., Cao, N., Lou, W.: Privacy-preserving distributed profile matching in proximity-based mobile social networks. IEEE Trans. Wirel. Commun. 12(5), 2024–2033 (2013)CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.School of Computer & Systems SciencesJawaharlal Nehru UniversityNew DelhiIndia

Personalised recommendations