Skip to main content

Advertisement

Springer Nature Link
Log in

Secure Data Sharing Framework via Hierarchical Greedy Embedding in Darknets

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

Geometric routing, which combines greedy embedding and greedy forwarding, is a promising approach for efficient data sharing in darknets. However, the security of data sharing using geometric routing in darknets is still an issue that has not been fully studied. In this paper, we propose a Secure Data Sharing framework (SeDS) for future darknets via hierarchical greedy embedding. SeDS adopts a hierarchical topology and uses a set of secure nodes to protect the whole topology. To support geometric routing in the hierarchical topology, a two-level bit-string prefix embedding approach (Prefix-T) is first proposed, and then a greedy forwarding strategy and a data mapping approach are combined with Prefix-T for data sharing. SeDS guarantees that the publication or request of a data item can always pass through the corresponding secure node, such that security strategies can be performed. The experimental results show that SeDS provides scalable and efficient end-to-end communication and data sharing.

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
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  1. Biddle P, England P, Peinado M, Willman B (2002) The darknet and the future of content protection. In: ACM workshop on digital rights management. Springer, pp 155–176

  2. Mansfield-Devine S (2009) Darknets. Computer Fraud & Security 2009(12):4–6

    Article  Google Scholar 

  3. Clarke I, Sandberg O, Wiley B, Hong TW (2001) Freenet: a distributed anonymous information storage and retrieval system. In: Designing privacy enhancing technologies. Springer, pp 46–66

  4. Isdal T, Piatek M, Krishnamurthy A, Anderson T (2010) Privacy-preserving p2p data sharing with oneswarm. In: ACM SIGCOMM computer communication review, vol 40. ACM, pp 111–122

  5. Kügler D (2003) An analysis of gnunet and the implications for anonymous, censorship-resistant networks. In: International workshop on privacy enhancing technologies. Springer, pp 161–176

  6. Tan Q, Gao Y, Shi J, Wang X, Fang B, Tian ZH (2018) Towards a comprehensive insight into the eclipse attacks of tor hidden services. IEEE Internet Things J.

  7. Roos S, Beck M, Strufe T (2016) Anonymous addresses for efficient and resilient routing in f2f overlays. In: Proceedings of the 35th annual IEEE international conference on computer communications (INFOCOM). IEEE, pp 1–9

  8. Popescu B (2004) Safe and private data sharing with turtle: friends team-up and beat the system (transcript of discussion). In: International workshop on security protocols. Springer, pp 221–230

  9. Mittal P, Caesar M, Borisov N (2011) X-vine: Secure and pseudonymous routing using social networks. arXiv:11090971

  10. Kleinberg R (2007) Geographic routing using hyperbolic space. In: Proceeding of the 26th IEEE international conference on computer communications (INFOCOM). IEEE, pp 1902–1909

  11. Höfer A, Roos S, Strufe T (2013) Greedy embedding, routing and content addressing for darknets. In: Conference on networked systems (NetSys). IEEE, pp 43–50

  12. Wu C, Zapevalova E, Chen Y, Li F (2018) Time optimization of multiple knowledge transfers in the big data environment. Computers, Materials & Continua 54(3):269–285

    Google Scholar 

  13. Evans NS, Grothoff C (2011) R5n: Randomized recursive routing for restricted-route networks. In: 2011 5th international conference on network and system security (NSS). IEEE, pp 316–321

  14. Caesar M, Castro M, Nightingale EB, O’Shea G, Rowstron A (2006) Virtual ring routing: network routing inspired by dhts. In: ACM SIGCOMM computer communication review, vol 36. ACM, pp 351–362

  15. Karp B, Kung HT (2000) GPSR: Greedy perimeter stateless routing for wireless networks. In: Proceedings of the 6th annual international conference on mobile computing and networking,. ACM, pp 243–254

  16. Caruso A, Chessa S, De S, Urpi A (2005) GPS free coordinate assignment and routing in wireless sensor networks. In: Proceedings of the 24th IEEE international conference on computer communications (INFOCOM). IEEE, pp 150–160

  17. Ratnasamy S, Karp B, Yin L, Yu F, Estrin D, Govindan R, Shenker S (2002) GHT: a geographic hash table for data-centric storage. In: Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications. ACM, pp 78–87

  18. Newsome J, Song D (2003) GEM: Graph embedding for routing and data-centric storage in sensor networks without geographic information. In: Proceedings of the 1st international conference on Embedded networked sensor systems. ACM, pp 76–88

  19. Landsiedel O, Lehmann KA, Wehrle K (2005) T-DHT: topology-based distributed hash tables. In: Proceedings of the 5th IEEE international conference on peer-to-peer computing. IEEE, pp 143–144

  20. Leighton T, Moitra A (2010) Some results on greedy embeddings in metric spaces. Discrete & Computational Geometry 44(3):686–705

    Article  MathSciNet  Google Scholar 

  21. Abdel-Aziz H, Saad MK (2018) On special curves according to darboux frame in the three dimensional lorentz space. Computers, Materials & Continua 54(3):229–249

    Google Scholar 

  22. Wang L, Waltari O, Kangasharju J (2013) Mobiccn: mobility support with greedy routing in content-centric networks. In: IEEE Global communications conference (GLOBECOM). IEEE, pp 2069–2075

  23. Herzen J, Westphal C, Thiran P (2011) Scalable Routing easy as PIE: a practical isometric embedding protocol. In: Proceeding of the 19th IEEE international conference on network protocols (ICNP). IEEE, pp 49–58

  24. Sun Y, Zhang Y, Fang B, Zhang H (2017) Succinct and practical greedy embedding for geometric routing. Computer Communications

  25. Perlman R (1985) An algorithm for distributed computation of a spanning tree in an extended LAN. In: ACM SIGCOMM computer communication review, vol 15. ACM, pp 44–53

  26. Jiang F, Fu Y, Gupta BB, Lou F, Rho S, Meng F, Tian Z (2018) Deep learning based multi-channel intelligent attack detection for data security. IEEE Transactions on Sustainable Computing

  27. Ahmed A, Bakar KA, Channa MI, Khan AW (2016) A secure routing protocol with trust and energy awareness for wireless sensor network. Mobile Networks and Applications 21(2):272–285

    Article  Google Scholar 

  28. Chen J, Tian Z, Cui X, Yin L, Wang X (2018) Trust architecture and reputation evaluation for internet of things. Journal of Ambient Intelligence and Humanized Computing, pp 1–9

  29. Wang Y, Tian Z, Zhang H, Su S, Shi W (2018) A privacy preserving scheme for nearest neighbor query. Sensors 18(8):2440

    Article  Google Scholar 

  30. Thorup M, Zwick U (2001) Compact routing schemes. In: Proceedings of the 13th annual ACM symposium on parallel algorithms and architectures. ACM, pp 1–10

  31. Papadimitriou CH, Ratajczak D (2005) On a conjecture related to geometric routing. Theor Comput Sci 344(1):3–14

    Article  MathSciNet  Google Scholar 

  32. Yanbin S, Yu Z, Shen S, Hongli Z, Binxing F (2015) Geometric name routing for icn in dynamic world. China Communications 12(7):47–59

    Article  Google Scholar 

  33. (2012) The IPv4 Routed/24 AS Links Dataset-Jue, 2012. http://www.caida.org/data/active/ipv4_routed_topology_aslinks_dataset.xml

  34. Bu T, Towsley D (2002) On distinguishing between internet power law topology generators. In: Proceedings of the 21st annual joint conference of the IEEE computer and communications societies (INFOCOM), vol 2. IEEE, pp 638–647

Download references

Acknowledgements

This work is funded by the National Key Research and Development Plan (Grant No. 2018YFB0803504) and the National Natural Science Foundation of China (No. 61871140, 61702223, 61702220, 61572153).

Author information

Authors and Affiliations

  1. Cyberspace Institute of Advanced Technology, Guangzhou University, Guangzhou, 510006, China

    Yanbin Sun, Mohan Li, Shen Su & Zhihong Tian

  2. School of Information Technology Faculty of Engineering and Design, Carleton University Ottawa, Ontario, 520-2600, Canada

    Wei Shi

  3. Kennesaw State University, 1100 South Marietta Pkwy Marietta, Kennesaw, GA, 30060, USA

    Meng Han

Authors
  1. Yanbin Sun
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Mohan Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Shen Su
    View author publications

    You can also search for this author inPubMed Google Scholar

  4. Zhihong Tian
    View author publications

    You can also search for this author inPubMed Google Scholar

  5. Wei Shi
    View author publications

    You can also search for this author inPubMed Google Scholar

  6. Meng Han
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Zhihong Tian.

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

Sun, Y., Li, M., Su, S. et al. Secure Data Sharing Framework via Hierarchical Greedy Embedding in Darknets. Mobile Netw Appl 26, 940–948 (2021). https://doi.org/10.1007/s11036-019-01325-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-019-01325-4

Keywords