Skip to main content

Advertisement

Springer Nature Link
Log in

Anonymising group data sharing in opportunistic mobile social networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

The security and privacy risks of group users are major concerns in opportunistic mobile social network (OMSN) platforms, especially when the users share data publicly in a proximity area. However, existing schemes on group data sharing usually do not enforce the anonymity and/or privacy preservation properties and making them relatively unsuitable for large scale implementation. In this paper, we construct a compelling lightweight cryptographic encryption protocol scheme to anonymise and preserve the identity and data privacy of the users for a large scale OMSN. The users are authenticated to forward data-packet notification via Bluetooth-enabled smartphones, respond via 4G mobile network and can deny the notification with zero detection. The scheme’s notification delay considerably reduces with the introduction of some passers-by and hence achieves high reliability of packet notification forwarding in a 1000 m-squared proximity area. Simulation and testing for the performance requirement using Proverif software prove the scheme as easy to implement for large scale OMSN. Furthermore, the security analysis with proof based on the hardness of decisional bilinear Diffie–Hellman condition demonstrates the scheme as semantically secure under chosen-plaintext and chosen-ciphertext attacks. Nonetheless, resource constraints management has not been tackled in the present study.

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
$34.99 /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 excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Availability of data and material

No external data were used to support this study.

References

  1. Niu, J., Dai, B., & Guo, J. (2011). A novel data collection scheme based on active degree for OMSN. In N. Zhong, V. Callaghan, A. A. Ghorbani, & B. Hu (Eds.), Active media technology. AMT 2011. Lecture notes in computer science (6890). Berlin: Springer.

    Google Scholar 

  2. Alomair, B., & Poovendran, R. (2014). Efficient authentication for mobile and pervasive computing. IEEE Transactions on Mobile Computing, 13(3), 469–481.

    Article  Google Scholar 

  3. Shen, J., Zhou, T., Chen, X., Li, J., & Susilo, W. (2017). Anonymous and traceable group data sharing in cloud computing. IEEE Transactions on Information Forensics and Security, 13(4), 912–925.

    Article  Google Scholar 

  4. Biryukov, A., & Perrin, L. (2017). State of the art in lightweight symmetric cryptography. https://eprint.iacr.org/2017/511.pdf. Accessed 21 Sept 2020.

  5. McKay, K.A., Bassham, L.E., Turan, M., & Mouha, N. (2017). Report on lightweight cryptography. National Institute of Standards and Technology Internal Report 8114. https://doi.org/https://doi.org/10.6028/NIST.IR.8114.

  6. Wang, Y., Chen, I., & Wang, D. A. (2015). Survey of mobile cloud computing applications: Perspectives and challenges. Wireless Personal Communication, 80, 1607–1623.

    Article  Google Scholar 

  7. Xie, R., He, C., Xie, D., Gao, C., & Zhang, X. (2018). A secure ciphertext retrieval scheme against insider KGAs for mobile devices in cloud storage. Security and Communication Networks. https://doi.org/10.1155/2018/7254305.

    Article  Google Scholar 

  8. Greitzer, F. L., Strozer, J. R., Cohen, S., Moore, A. P., Mundie, D. & Cowley, J. (2014). Analysis of unintentional insider threats deriving from social engineering exploits. In 2014 IEEE security and privacy workshops (pp. 236–250). IEEE.

  9. Edwards, M., Larson, R., Green, B., Rashid, A., & Baron, A. (2017). Panning for gold: Automatically analysing online social engineering attack surfaces. Computers & Security. https://doi.org/10.1016/j.cose.2016.12.013.

    Article  Google Scholar 

  10. Braghin, C., & Cremonini, M. (2017). Online privacy. Computer and Information Security Handbook (Third Edition). https://doi.org/10.1016/B978-0-12-803843-7.00052-1.

    Article  Google Scholar 

  11. Ling, H., & Yang, S. (2019). Passive neighbor discovery with social recognition for mobile ad hoc social networking applications. Wireless Networks, 25, 4247–4258.

    Article  Google Scholar 

  12. Wang, Y., Vasilakos, A. V., Jin, Q., et al. (2014). Survey on mobile social networking in proximity (MSNP): Approaches, challenges and architecture. Wireless Networks, 20, 1295–1311.

    Article  Google Scholar 

  13. Ahmad, H., Agiwal, M., Saxena, N., et al. (2018). D2D-based survival on sharing for critical communications. Wireless Networks, 24, 2283–2295.

    Article  Google Scholar 

  14. Han, G., Jiang, J., Zhang, C., Duong, T. Q., Guizani, M., & Karagiannidis, G. K. (2016). A survey on mobile anchor node assisted localization in wireless sensor networks. IEEE Communications Surveys & Tutorials, 8(3), 2220–2243.

    Article  Google Scholar 

  15. De Rango, F., Socievole, A., & Marano, S. (2015). Exploiting online and offline activity-based metrics for opportunistic forwarding. Wireless Networks, 21(4), 1163–1179.

    Article  Google Scholar 

  16. Arapinis, M., Mancini, L., Ritter, E., et al. (2012). New privacy issues in mobile telephony: Fix and verification. In Proceedings of the 2012 ACM conference on computer and communications security (pp. 205–216). ACM.

  17. Zakhary, S., & Benslimane, A. (2018). On location-privacy in opportunistic mobile networks, a survey. Journal of Network and Computer Applications. https://doi.org/10.1016/j.jnca.2017.10.022.

    Article  Google Scholar 

  18. Ouladj, M., Guillot, P., & Mokrane, F. (2019). Chosen message strategy to improve the correlation power analysis. IET Information Security, 13(4), 304–310.

    Article  Google Scholar 

  19. Jiang, W., Chen, J. & Feng, Q. (2017). A trusted service selection method based on user's personality feature and service recommendation. In 14th web information systems and applications conference (WISA) (pp. 267–272). IEEE.

  20. Wu, X., Yang, Z., Ling, C., & Xia, X. (2016). Artificial-noise-aided message authentication codes with information-theoretic security. IEEE Transactions on Information Forensics and Security, 11(6), 1278–1290.

    Article  Google Scholar 

  21. Li, H., Chen, Y., Cheng, X., Li, K., & Chen, D. (2014). Secure friend discovery based on encounter history in mobile social networks. In 2014 international conference on identification, information and knowledge in the internet of things (pp. 280–285). IEEE.

  22. Arapinis, M., Chothia, T., Ritter, E., & Ryan, M. (2010). Analysing unlinkability and anonymity using the applied pi calculus. In 2010 23rd IEEE computer security foundations symposium (pp. 107–121). IEEE.

  23. Carver, C., & Lin, X. (2012). A privacy-preserving proximity friend notification scheme with opportunistic networking. In 2012 IEEE international conference on communications (ICC) (pp. 5387–5392). IEEE.

  24. Lin, C., Han, D., Deng, J., & Wu, G. (2017). P2S: A primary and passer-by scheduling algorithm for on-demand charging architecture in wireless rechargeable sensor networks. IEEE Transactions on Vehicular Technology, 66(9), 8047–8058.

    Article  Google Scholar 

  25. Saikia, P., Cheung, M., She, J., & Park, S. (2017). Effectiveness of mobile notification delivery. In 2017 18th IEEE international conference on mobile data management (MDM) (pp. 21–29). IEEE.

  26. Derakhshanfard, N., Sabaei, M., & Rahmani, A. M. (2016). Sharing spray and wait routing algorithm in opportunistic networks. Wireless Networks, 22, 2403–2414.

    Article  Google Scholar 

  27. Salehi, M., & Boukerche, A. (2019). Secure opportunistic routing protocols: Methods, models, and classification. Wireless Networks, 25, 559–571.

    Article  Google Scholar 

  28. Li, J., Jia, X., Lv, X., Han, Z., & Liu, J. (2019). Opportunistic routing with data fusion for multi-source wireless sensor networks. Wireless Networks, 25, 3103–3113.

    Article  Google Scholar 

  29. Fan, X., Li, V. O. K., & Xu, K. (2014). Fairness analysis of routing in opportunistic mobile networks. IEEE Transactions on Vehicular Technology, 63(3), 1282–1295.

    Article  Google Scholar 

  30. Fan, X., Xu, K. & Li, V. O. K. (2011). Fair packet forwarding in opportunistic networks. In 2011 IEEE 73rd vehicular technology conference (VTC Spring) (pp. 1–5). IEEE.

  31. Wu, J., Chen, Z., & Zhao, M. (2019). Information cache management and data transmission algorithm in opportunistic social networks. Wireless Networks, 25(8), 2977–2988.

    Article  Google Scholar 

  32. Chiou, S., & Huang, Y. (2013). Mobile common friends discovery with friendship ownership and replay-attack resistance. Wireless Networks, 19, 1839–1850.

    Article  Google Scholar 

  33. Zhuo, G., & Yang, H. (2018). Privacy-preserving context-aware friend discovery based on mobile sensing. In 2018 IEEE international conference on consumer electronics (ICCE) (pp. 1–5). IEEE.

  34. Køien, G. M., & Oleshchuk, V. A. (2006). Location privacy for cellular systems; analysis and solution. In G. Danezis & D. Martin (Eds.), Privacy enhancing technologies PET 2005. Lecture notes in computer science (3856). Berlin: Springer.

    Google Scholar 

  35. Tegos, S., Demetriadis, S., & Tsiatsos, T. (2012). Using a conversational agent for promoting collaborative language learning. In 2012 fourth international conference on intelligent networking and collaborative systems (pp. 162–165). IEEE.

  36. Lu, R., Lin, X., & Shen, X. (2013). SPOC: A secure and privacy-preserving opportunistic computing framework for mobile-healthcare emergency. IEEE Transactions on Parallel and Distributed Systems, 24(3), 614–624.

    Article  Google Scholar 

  37. Boneh, D., Boyen, X., & Halevi, S. (2006). Chosen ciphertext secure public key threshold encryption without random oracles. In D. Pointcheval (Ed.), Topics in cryptology—CT-RSA 2006. Lecture notes in computer science (3860). Berlin: Springer.

    Google Scholar 

  38. Hu, X., Wang, T. & Xu, H. (2010). Cryptanalysis and improvement of a HIBE and HIBS without random oracles. In 2010 international conference on machine vision and human–machine interface (pp. 389–392). IEEE.

  39. Tang, Q., & Wang, J. (2018). Privacy-preserving friendship-based recommender systems. IEEE Transactions on Dependable and Secure Computing, 15(5), 784–796.

    Article  Google Scholar 

  40. Choi, K. W., & Han, Z. (2015). Device-to-device discovery for proximity-based service in LTE-advanced system. IEEE Journal on Selected Areas in Communications, 33(1), 55–66.

    Article  Google Scholar 

  41. Yang, X., Shen, Z., Hu, X., & Hu, W. (2016). Physical layer encryption algorithm for chaotic optical OFDM transmission against chosen-plaintext attacks. In 2016 18th international conference on transparent optical networks (ICTON) (pp. 1–5). IEEE.

  42. Al-Moliki, Y. M., Alresheedi, M. T., & Al-Harthi, Y. (2017). Physical-layer security against known/chosen plaintext attacks for OFDM-based VLC system. IEEE Communications Letters, 21(12), 2606–2609.

    Article  Google Scholar 

  43. Fujisaki, E., & Okamoto, T. (2013). Secure integration of asymmetric and symmetric encryption schemes. Journal of Cryptology, 26, 80–101.

    Article  MathSciNet  MATH  Google Scholar 

  44. Tseng, Y., Tsai, T., Huang, S., & Huang, C. (2018). Identity-based encryption with cloud revocation authority and its applications. IEEE Transactions on Cloud Computing, 6(4), 1041–1053.

    Article  Google Scholar 

  45. Boneh, D., Lynn, B., & Shacham, H. (2001). Short signatures from the Weil pairing. In C. Boyd (Ed.), Advances in cryptology, lecture notes in computer science. Berlin: Springer.

    Google Scholar 

  46. Kobeissi, N., Bhargavan, K., & Blanchet, B. (2017). Automated verification for secure messaging protocols and their implementations: A symbolic and computational approach. In 2017 IEEE European symposium on security and privacy (EuroS&P) (pp. 435–450). IEEE.

  47. Blanchet, B. (2014). Automatic verification of security protocols in the symbolic model: The verifier ProVerif. In A. Aldini, J. Lopez, & F. Martinelli (Eds.), Foundations of security analysis and design VII. FOSAD 2013, FOSAD 2012. Lecture notes in computer science (8604). Cham: Springer.

    Google Scholar 

  48. Kim, Y., & Kim, G. (2018). A Performance analysis of lightweight cryptography algorithm for data privacy in IoT devices. In 2018 international conference on information and communication technology convergence (ICTC) (pp. 936–938). IEEE.

  49. Vodel, M., Caspar, M. & Hardt, W. (2010). A capable, lightweight communication concept by combining ambient network approaches with cognitive radio aspects. In 2010 17th international conference on telecommunications (pp. 430–434). IEEE.

  50. Katagi, M. & Moriai, S. (2011). Lightweight cryptography for the internet of things. Available: https://www.iab.org/wpcontent/IAB-uploads/2011/03/Kaftan.pdf. Accessed 21 Sept 2020.

  51. Shen, J., Chang, S., Shen, J., Liu, Q., & Sun, X. (2018). A lightweight multi-layer authentication protocol for wireless body area networks. Future Generation Computer Systems, 78(3), 956–963.

    Article  Google Scholar 

  52. Gao, W., Li, Q., Zhao, B., & Cao, G. (2009). Multicasting in delay tolerant networks: A social network perspective. In Proceedings of the 10th ACM international symposium on mobile ad hoc networking and computing (MobiHoc) (pp. 299–308). ACM.

Download references

Funding

This work was partly supported by the National Natural Science Foundation of China [Grant Nos. 61602097, 61502087, and 61472064].

Author information

Authors and Affiliations

  1. School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu, 610054, China

    Daniel Adu-Gyamfi & Fengli Zhang

  2. Department of Cyber Security and Computer Engineering Technology, CK Tedam University of Technology and Applied Sciences, P O Box 24, Navrongo, Ghana

    Daniel Adu-Gyamfi

  3. Department of Computer Science and Informatics, University of Energy and Natural Resources, P O Box 214, Sunyani, Ghana

    Daniel Adu-Gyamfi & Augustine Takyi

Authors
  1. Daniel Adu-Gyamfi
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Fengli Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Augustine Takyi
    View author publications

    You can also search for this author inPubMed Google Scholar

Contributions

Authors have contributed equally in all aspect of the manuscript in terms of design, methodology, analysis, results interpretation, manuscript writing and revision and decision to submit for publication.

Corresponding author

Correspondence to Daniel Adu-Gyamfi.

Ethics declarations

Conflict of interest

The authors declare that there is no conflict of interest regarding the publication of this paper.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Adu-Gyamfi, D., Zhang, F. & Takyi, A. Anonymising group data sharing in opportunistic mobile social networks. Wireless Netw 27, 1477–1490 (2021). https://doi.org/10.1007/s11276-020-02524-8

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-020-02524-8

Keywords