{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:41:08Z","timestamp":1740123668421,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61572153","61702223","61702220"],"award-info":[{"award-number":["61572153","61702223","61702220"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Key Research and Development Plan","award":["2018YFB0803504"],"award-info":[{"award-number":["2018YFB0803504"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mobile Netw Appl"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s11036-019-01325-4","type":"journal-article","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T15:03:00Z","timestamp":1564671780000},"page":"940-948","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Secure Data Sharing Framework via Hierarchical Greedy Embedding in Darknets"],"prefix":"10.1007","volume":"26","author":[{"given":"Yanbin","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shen","family":"Su","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9409-5359","authenticated-orcid":false,"given":"Zhihong","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meng","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,1]]},"reference":[{"key":"1325_CR1","doi-asserted-by":"crossref","unstructured":"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\u2013176","DOI":"10.1007\/978-3-540-44993-5_10"},{"issue":"12","key":"1325_CR2","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/S1361-3723(09)70150-2","volume":"2009","author":"S Mansfield-Devine","year":"2009","unstructured":"Mansfield-Devine S (2009) Darknets. Computer Fraud & Security 2009(12):4\u20136","journal-title":"Computer Fraud & Security"},{"key":"1325_CR3","doi-asserted-by":"crossref","unstructured":"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\u201366","DOI":"10.1007\/3-540-44702-4_4"},{"key":"1325_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013122","DOI":"10.1145\/1851275.1851198"},{"key":"1325_CR5","doi-asserted-by":"crossref","unstructured":"K\u00fcgler D (2003) An analysis of gnunet and the implications for anonymous, censorship-resistant networks. In: International workshop on privacy enhancing technologies. Springer, pp 161\u2013176","DOI":"10.1007\/978-3-540-40956-4_11"},{"key":"1325_CR6","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1109\/ICC.2017.7996832"},{"key":"1325_CR7","doi-asserted-by":"crossref","unstructured":"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\u20139","DOI":"10.1109\/INFOCOM.2016.7524553"},{"key":"1325_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013230","DOI":"10.1007\/11861386_25"},{"key":"1325_CR9","unstructured":"Mittal P, Caesar M, Borisov N (2011) X-vine: Secure and pseudonymous routing using social networks. arXiv:11090971"},{"key":"1325_CR10","doi-asserted-by":"crossref","unstructured":"Kleinberg R (2007) Geographic routing using hyperbolic space. In: Proceeding of the 26th IEEE international conference on computer communications (INFOCOM). IEEE, pp 1902\u20131909","DOI":"10.1109\/INFCOM.2007.221"},{"key":"1325_CR11","doi-asserted-by":"crossref","unstructured":"H\u00f6fer A, Roos S, Strufe T (2013) Greedy embedding, routing and content addressing for darknets. In: Conference on networked systems (NetSys). IEEE, pp 43\u201350","DOI":"10.1109\/NetSys.2013.23"},{"issue":"3","key":"1325_CR12","first-page":"269","volume":"54","author":"C Wu","year":"2018","unstructured":"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\u2013285","journal-title":"Computers, Materials & Continua"},{"key":"1325_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013321","DOI":"10.1109\/ICNSS.2011.6060022"},{"key":"1325_CR14","doi-asserted-by":"crossref","unstructured":"Caesar M, Castro M, Nightingale EB, O\u2019Shea G, Rowstron A (2006) Virtual ring routing: network routing inspired by dhts. In: ACM SIGCOMM computer communication review, vol 36. ACM, pp 351\u2013362","DOI":"10.1145\/1151659.1159954"},{"key":"1325_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013254","DOI":"10.1145\/345910.345953"},{"key":"1325_CR16","doi-asserted-by":"crossref","unstructured":"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\u2013160","DOI":"10.1109\/INFCOM.2005.1497887"},{"key":"1325_CR17","doi-asserted-by":"crossref","unstructured":"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\u201387","DOI":"10.1145\/570738.570750"},{"key":"1325_CR18","doi-asserted-by":"crossref","unstructured":"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\u201388","DOI":"10.1145\/958491.958501"},{"key":"1325_CR19","doi-asserted-by":"crossref","unstructured":"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\u2013144","DOI":"10.1109\/P2P.2005.36"},{"issue":"3","key":"1325_CR20","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1007\/s00454-009-9227-6","volume":"44","author":"T Leighton","year":"2010","unstructured":"Leighton T, Moitra A (2010) Some results on greedy embeddings in metric spaces. Discrete & Computational Geometry 44(3):686\u2013705","journal-title":"Discrete & Computational Geometry"},{"issue":"3","key":"1325_CR21","first-page":"229","volume":"54","author":"H Abdel-Aziz","year":"2018","unstructured":"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\u2013249","journal-title":"Computers, Materials & Continua"},{"key":"1325_CR22","doi-asserted-by":"crossref","unstructured":"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\u20132075","DOI":"10.1109\/GLOCOM.2013.6831380"},{"key":"1325_CR23","doi-asserted-by":"crossref","unstructured":"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\u201358","DOI":"10.1109\/ICNP.2011.6089081"},{"key":"1325_CR24","doi-asserted-by":"crossref","unstructured":"Sun Y, Zhang Y, Fang B, Zhang H (2017) Succinct and practical greedy embedding for geometric routing. Computer Communications","DOI":"10.1016\/j.comcom.2017.10.014"},{"key":"1325_CR25","doi-asserted-by":"crossref","unstructured":"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\u201353","DOI":"10.1145\/318951.319004"},{"key":"1325_CR26","unstructured":"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"},{"issue":"2","key":"1325_CR27","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/s11036-016-0683-y","volume":"21","author":"A Ahmed","year":"2016","unstructured":"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\u2013285","journal-title":"Mobile Networks and Applications"},{"key":"1325_CR28","unstructured":"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\u20139"},{"issue":"8","key":"1325_CR29","doi-asserted-by":"publisher","first-page":"2440","DOI":"10.3390\/s18082440","volume":"18","author":"Y Wang","year":"2018","unstructured":"Wang Y, Tian Z, Zhang H, Su S, Shi W (2018) A privacy preserving scheme for nearest neighbor query. Sensors 18(8):2440","journal-title":"Sensors"},{"key":"1325_CR30","doi-asserted-by":"crossref","unstructured":"Thorup M, Zwick U (2001) Compact routing schemes. In: Proceedings of the 13th annual ACM symposium on parallel algorithms and architectures. ACM, pp 1\u201310","DOI":"10.1145\/378580.378581"},{"issue":"1","key":"1325_CR31","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.022","volume":"344","author":"CH Papadimitriou","year":"2005","unstructured":"Papadimitriou CH, Ratajczak D (2005) On a conjecture related to geometric routing. Theor Comput Sci 344(1):3\u201314","journal-title":"Theor Comput Sci"},{"issue":"7","key":"1325_CR32","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/CC.2015.7188524","volume":"12","author":"S Yanbin","year":"2015","unstructured":"Yanbin S, Yu Z, Shen S, Hongli Z, Binxing F (2015) Geometric name routing for icn in dynamic world. China Communications 12(7):47\u201359","journal-title":"China Communications"},{"key":"1325_CR33","unstructured":"(2012) The IPv4 Routed\/24 AS Links Dataset-Jue, 2012. http:\/\/www.caida.org\/data\/active\/ipv4_routed_topology_aslinks_dataset.xml"},{"key":"1325_CR34","unstructured":"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\u2013647"}],"container-title":["Mobile Networks and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-019-01325-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11036-019-01325-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11036-019-01325-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T17:20:13Z","timestamp":1620494413000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11036-019-01325-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,1]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["1325"],"URL":"https:\/\/doi.org\/10.1007\/s11036-019-01325-4","relation":{},"ISSN":["1383-469X","1572-8153"],"issn-type":[{"type":"print","value":"1383-469X"},{"type":"electronic","value":"1572-8153"}],"subject":[],"published":{"date-parts":[[2019,8,1]]},"assertion":[{"value":"1 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}