Skip to main content
SpringerLink
Log in

Privacy Protection Routing and a Self-organized Key Management Scheme in Opportunistic Networks

  • Conference paper
  • First Online:
Quality, Reliability, Security and Robustness in Heterogeneous Systems (QShine 2019)

  • 528 Accesses

Abstract

The opportunistic network adopts the disconnected store-and-forward architecture to provide communication support for the nodes without an infrastructure. As there is no stable communication link between the nodes, so that forwarding messages is via any encountered nodes. Social networks based on such opportunistic networks will have privacy challenges. In this paper, we propose a privacy protection scheme routing based on the utility value. We exploit the Bloom filter to obfuscate the friends lists and the corresponding utility values of nodes in order to make the routing decisions. This is easy to implement with high performance. Considering no infrastructure and stable link in opportunistic networks, this paper presents a self-organized key management system consisting of an identity authentication scheme based on the zero-knowledge proof of the elliptic curve and a key agreement scheme based on the threshold cryptography. The nodes prove their identities by themselves, and each node carries a certificate library to improve the authentication efficiency and success rate. In order to ensure the forward security and improve the session key agreement rate and the success rate, we exploit threshold cryptography to divide the session key, which could reduce the communication consumption of the traditional Diffie-Hellman (DH) algorithm. The experimental simulation results show that the proposed schemes are much better than the existing schemes for opportunistic networks.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Shikfa, A.: Security issues in opportunistic networks. In: International Workshop on Mobile Opportunistic Networking, pp. 215–216 (2010)

    Google Scholar 

  2. Ciobanu, R.I., et al.: Sprint-self: social-based routing and selfish node detection in opportunistic networks. Mob. Inf. Syst. 15(6), 1–12 (2015)

    Google Scholar 

  3. Li, L., Qin, Y., Zhong, X., et al.: An incentive aware routing for selfish opportunistic networks: a game theoretic approach. In: International Conference on Wireless Communications & Signal Processing, pp. 1–5 (2016)

    Google Scholar 

  4. Nguyen, H.A., Giordano, S., Puiatti, A.: Probabilistic routing protocol for intermittently connected mobile ad hoc network (propicman). In: World of Wireless, Mobile and Multimedia Networks, pp. 1–6 (2007)

    Google Scholar 

  5. Daly, E.M., et al.: Social network analysis for information flow in disconnected delay-tolerant manets. IEEE Trans. Mob. Comput. 8(5), 606–621 (2009)

    Article  Google Scholar 

  6. Hui, P., Crowcroft, J., Yoneki, E.: Bubble rap: social-based forwarding in delay-tolerant networks. IEEE Trans. Mob. Comput. 10, 1576–1589 (2008)

    Article  Google Scholar 

  7. Juang, P., Oki, H., Yong, W., et al.: Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet. In: International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 96–107 (2002)

    Google Scholar 

  8. Lindgren, A., et al.: Probabilistic routing in intermittently connected networks. ACM Sigmobile Mob. Comput. Commun. Rev. 7(3), 19–20 (2004)

    Article  Google Scholar 

  9. Boldrini, C., Conti, M., Jacopini, J., et al.: Hibop: a history based routing protocol for opportunistic networks. In: World of Wireless, Mobile and Multimedia Networks, pp. 1–12 (2007)

    Google Scholar 

  10. Pan, H., et al.: Bubble rap: social-based forwarding in delay-tolerant networks. In: IEEE Educational Activities Department, pp. 1576–1589 (2011)

    Google Scholar 

  11. Cadger, F., et al.: A survey of geographical routing in wireless ad-hoc networks. IEEE Commun. Surv. Tutorials 15(2), 621–653 (2013)

    Article  Google Scholar 

  12. Zhi, Z., Choong, Y.K.: Anonymizing geographic ad hoc routing for preserving location privacy. In: IEEE International Conference on Distributed Computing systems Workshops, pp. 646–651 (2005)

    Google Scholar 

  13. Zhou, J., et al.: Secure and privacy preserving protocol for cloud-based vehicular DTNs. IEEE Trans. Inf. Forensics Secur. 10(6), 1299–1314 (2017)

    Article  Google Scholar 

  14. Asghar, M.R., Gehani, A., Crispo, B., et al.: Pidgin: privacy-preserving interest and content sharing in opportunistic networks. In: ACM Symposium on Information, Computer and Communications Security, pp. 135–146 (2014)

    Google Scholar 

  15. Yao, L., et al.: Secure routing based on social similarity in opportunistic networks. IEEE Trans. Wirel. Commun. 15(1), 594–605 (2016)

    Article  Google Scholar 

  16. Boldrini, C., et al.: Exploiting users’ social relations to forward data in opportunistic networks: the hibop solution. Pervasive Mob. Comput. 4(5), 633–657 (2008)

    Article  Google Scholar 

  17. Parris, I., Henderson, T.: Privacy-enhanced social-network routing. Comput. Commun. 35(1), 62–74 (2012)

    Article  Google Scholar 

  18. Shamir, A.: Identity-based cryptosystems and signature schemes. Lect. Notes Comput. Sci. 21(2), 47–53 (1984)

    MATH  Google Scholar 

  19. Dan, B., Franklin, M.: Identity-based encryption from the weil pairing. SIAM J. Comput. 32(3), 213–229 (2001)

    MathSciNet  MATH  Google Scholar 

  20. Seth, A., Keshav, S.: Practical security for disconnected nodes. In: Secure Network Protocols (2005)

    Google Scholar 

  21. Kumar, K.P., Shailaja, G., et al.: Secure and efficient threshold key issuing protocol for ID-based cryptosystems. IACR Cryptology ePrint Archive 2006/245 (2006)

    Google Scholar 

  22. Al-Riyami, S.S., Paterson, K.G.: Certificateless public key cryptography. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 452–473. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-40061-5_29

    Chapter  Google Scholar 

  23. Liu, W., et al.: Securing mobile ad hoc networks with certificateless public keys. IEEE Trans. Dependable Secur. Comput. 3(4), 386–399 (2006)

    Article  Google Scholar 

  24. Capkun, S., et al.: Self-organized public-key management for mobile ad hoc networks. IEEE Trans. Mob. Comput. 2(1), 52–64 (2003)

    Article  Google Scholar 

  25. Weniger, K., Zitterbart, M.: IPv6 autoconfiguration in large scale mobile ad-hoc networks. In: Proceedings of European Wireless (2002)

    Google Scholar 

  26. Yi, S., Kravets, R.: Composite key management for ad hoc networks. In: International Conference on Mobile and Ubiquitous Systems: Networking and Services, pp. 52–61 (2004)

    Google Scholar 

  27. Ngai, E.C.H., Lyu, M.R.: Trust and clustering-based authentication services in mobile ad hoc networks. In: International Conference on Distributed Computing Systems Workshops, pp. 582–587 (2004)

    Google Scholar 

  28. Chang, C.P., Lin, J.C., Lai, F.: Trust-group-based authentication services for mobile ad hoc networks. In: International Symposium on Wireless Pervasive Computing, pp. 16–18 (2006)

    Google Scholar 

Download references

Acknowledgements

The work is supported by the Science and Technology Fundament Research Fund of Shenzhen under grant JCYJ20170307151807788, JCYJ20160318095218091.

Author information

Authors and Affiliations

  1. School of Computer Science and Technology, Harbin Institute of Technology (Shenzhen), Shenzhen, China

    Yang Qin, Tiantian Zhang & Mengya Li

Authors
  1. Yang Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tiantian Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mengya Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yang Qin .

Editor information

Editors and Affiliations

  1. Hong Kong Baptist University, Hong Kong, China

    Xiaowen Chu

  2. Hunan University, Hunan, China

    Hongbo Jiang

  3. The Hong Kong University of Science and Technology, Hong Kong, China

    Bo Li

  4. The Hong Kong Polytechnic University, Hong Kong, China

    Dan Wang

  5. The Hong Kong University of Science and Technology, Hong Kong, China

    Wei Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2020 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Qin, Y., Zhang, T., Li, M. (2020). Privacy Protection Routing and a Self-organized Key Management Scheme in Opportunistic Networks. In: Chu, X., Jiang, H., Li, B., Wang, D., Wang, W. (eds) Quality, Reliability, Security and Robustness in Heterogeneous Systems. QShine 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 300. Springer, Cham. https://doi.org/10.1007/978-3-030-38819-5_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-38819-5_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-38818-8

  • Online ISBN: 978-3-030-38819-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation