{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T11:49:18Z","timestamp":1768996158714,"version":"3.49.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972136"],"award-info":[{"award-number":["61972136"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2024,2]]},"DOI":"10.1007\/s11265-023-01908-1","type":"journal-article","created":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T12:02:13Z","timestamp":1708171333000},"page":"153-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":38,"title":["Secure Routing Strategy Based on Attribute-Based Trust Access Control in Social-Aware Networks"],"prefix":"10.1007","volume":"96","author":[{"given":"Xueming","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Haitao","family":"Deng","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4467-9599","authenticated-orcid":false,"given":"Zenggang","family":"Xiong","sequence":"additional","affiliation":[]},{"given":"Yanchao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Yuanlin","family":"Lyu","sequence":"additional","affiliation":[]},{"given":"Yuan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Delin","family":"Hou","sequence":"additional","affiliation":[]},{"given":"Youfeng","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,17]]},"reference":[{"key":"1908_CR1","doi-asserted-by":"crossref","unstructured":"Xia, F., Liu, L., Li, J., Ma, J., & Vasilakos, A. V. (2015). Socially aware networking: A survey. IEEE, (3).","DOI":"10.1109\/JSYST.2013.2281262"},{"issue":"jan.","key":"1908_CR2","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.ress.2017.08.001","volume":"169","author":"S Xiang","year":"2018","unstructured":"Xiang, S., & Yang, J. (2018). Performance reliability evaluation for mobile ad hoc networks. Reliability Engineering & System Safety, 169(jan.), 32\u201339.","journal-title":"Reliability Engineering & System Safety"},{"issue":"2s","key":"1908_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2544375.2544390","volume":"13","author":"H Huang","year":"2014","unstructured":"Huang, H., Chaturvedi, V., et al. (2014). Throughput maximization for periodic real-time systems under the maximal temperature constraint. ACM Transactions on Embedded Computing Systems (TECS), 13(2s), 1\u201322.","journal-title":"ACM Transactions on Embedded Computing Systems (TECS)"},{"issue":"9","key":"1908_CR4","first-page":"6163","volume":"16","author":"Y Song","year":"2019","unstructured":"Song, Y., Li, Y., et al. (2019). Retraining strategy-based domain adaption network for intelligent fault diagnosis. IEEE TII, 16(9), 6163\u20136171.","journal-title":"IEEE TII"},{"issue":"6","key":"1908_CR5","first-page":"546","volume":"69","author":"M Qiu","year":"2009","unstructured":"Qiu, M., Guo, M., Liu, M., et al. (2009). Loop scheduling and bank type assignment for heterogeneous multi-bank memory. JPDC, 69(6), 546\u2013558.","journal-title":"JPDC"},{"issue":"1","key":"1908_CR6","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1109\/TCC.2016.2607708","volume":"7","author":"M Qiu","year":"2019","unstructured":"Qiu, M., Dai, W., & Vasilakos, A. (2019). Loop parallelism maximization for multimedia data processing in mobile vehicular clouds. IEEE Transactions on Cloud Computing, 7(1), 250\u2013258.","journal-title":"IEEE Transactions on Cloud Computing"},{"issue":"12","key":"1908_CR7","doi-asserted-by":"publisher","first-page":"3528","DOI":"10.1109\/TC.2015.2409857","volume":"64","author":"M Qiu","year":"2015","unstructured":"Qiu, M., Ming, Z., et al. (2015). Phase-change memory optimization for green cloud with genetic algorithm. IEEE Transactions on Computers, 64(12), 3528\u20133540.","journal-title":"IEEE Transactions on Computers"},{"key":"1908_CR8","unstructured":"Fang, X. (2016). Research on Context-aware routing algorithm in distributed mobile social networks. PhD thesis, Wuhan University."},{"key":"1908_CR9","doi-asserted-by":"crossref","unstructured":"Zenggang, X., Xiang, L., Xueming, Z., Zhu Sanyuan, X., Fang, Z. X., Yunyun, W., & Mingyang, Z. (2022). A service pricing-based two-stage incentive algorithm for socially aware networks. Journal of Signal Processing Systems, 94(11), 1227\u20131242.","DOI":"10.1007\/s11265-022-01768-1"},{"key":"1908_CR10","unstructured":"Kui, Y. (2021). Research on privacy protection data mining of mobile internet user behavior. Beijing University of Posts and Telecommunications."},{"key":"1908_CR11","unstructured":"Xuanfu, L., & Yumei, L. (2019). User privacy protection scheme based on locality sensitive hashing in social opportunistic networks, (Vol.\u00a046)."},{"issue":"3","key":"1908_CR12","first-page":"15","volume":"25","author":"L Xiangyu","year":"2014","unstructured":"Xiangyu, L., Bin, W., & Xiaochun, Y. (2014). Survey on privacy preserving techniques for social network data publishing. Journal of Software, 25(3), 15.","journal-title":"Journal of Software"},{"key":"1908_CR13","unstructured":"Ling, C., Jiang, J., et\u00a0al. (2023). Deep graph representation learning and optimization for influence maximization. In ICML."},{"key":"1908_CR14","doi-asserted-by":"crossref","unstructured":"Zhang, Y., et\u00a0al. (2023). Communication-efficient stochastic gradient descent ascent with momentum algorithms. In IJCAI 2023.","DOI":"10.24963\/ijcai.2023\/512"},{"key":"1908_CR15","unstructured":"Ying, H. (2018). Research on detection and defense methods of malicious attack nodes in opportunistic networks. Yanshan University."},{"key":"1908_CR16","doi-asserted-by":"crossref","unstructured":"Cadger, F., Curran, K., Santos, J., & Moffett, S. (2013, January). A survey of geographical routing in wireless ad-hoc networks. Communications Surveys & Tutorials, IEEE, 15, 621\u2013653.","DOI":"10.1109\/SURV.2012.062612.00109"},{"key":"1908_CR17","doi-asserted-by":"crossref","unstructured":"Shikfa, A., Onen, M., & Molva, R. (2009). Privacy in context-based and epidemic forwarding. PhD thesis.","DOI":"10.1109\/WOWMOM.2009.5282445"},{"key":"1908_CR18","unstructured":"Xi, C. (2013). Research on secure routing and key management scheme in opportunistic networks. Xidian University."},{"key":"1908_CR19","doi-asserted-by":"crossref","unstructured":"Parris, I., Bigwood, G., & Henderson, T. (2010). Privacy-enhanced social network routing in opportunistic networks. 2010 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops) (pp. 624\u2013629). IEEE.","DOI":"10.1109\/PERCOMW.2010.5470511"},{"issue":"7","key":"1908_CR20","first-page":"3","volume":"29","author":"L Yang","year":"2012","unstructured":"Yang, L., Zhenyu, Z., & Linlin, Z. (2012). Reputation-based trust model for opportunistic networks. Computer Applications and Software, 29(7), 3.","journal-title":"Computer Applications and Software"},{"issue":"2","key":"1908_CR21","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/MNET.011.1900336","volume":"35","author":"J Wang","year":"2021","unstructured":"Wang, J., Zhao, J., An, J., Wang, D., & Qiu, M. (2021). A linear NAS service of convnets for fast deployment in the edge of 5g networks. IEEE Network, 35(2), 46\u201352.","journal-title":"IEEE Network"},{"key":"1908_CR22","unstructured":"Li, L. (2015). Research on routing and incentive mechanism in social-aware networks. Dalian University of Technology. Doctoral dissertation."},{"key":"1908_CR23","unstructured":"Ling, L., & Benqian, W. (2012). A malicious node detection model based on game cooperation theory in mobile ad hoc networks is proposed. Chinese Institute of Electronics."},{"key":"1908_CR24","unstructured":"Wuyou, L. (2018). Research on opportunistic network data forwarding strategy with malicious collusion attack tolerance. Chongqing University of Posts and Telecommunications."},{"issue":"11","key":"1908_CR25","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1007\/s11265-021-01737-0","volume":"94","author":"Z Xiong","year":"2022","unstructured":"Xiong, Z., Mo, F., Zhao, X., Fang, X., Zhang, X., & Yunyun, W. (2022). Dynamic texture classification based on 3D ICA-learned filters and fisher vector encoding in big data environment. Journal of Signal Processing Systems, 94(11), 1129\u20131143.","journal-title":"Journal of Signal Processing Systems"},{"key":"1908_CR26","unstructured":"White Moon. (2018). Research on privacy protection in opportunity network data transmission. Hunan University of Science and Technology."},{"key":"1908_CR27","unstructured":"Jiangtao, Y. (2015). Trust forwarding algorithm based on social relations in opportunistic network. Xinjiang University."},{"issue":"2","key":"1908_CR28","first-page":"314","volume":"38","author":"R Yingchao","year":"2023","unstructured":"Yingchao, R., & Xuefeng, Y. (2023). Attribute-based encryption for DDS access control scheme. Data Acquisition and Processing, 38(2), 314\u2013323.","journal-title":"Data Acquisition and Processing"},{"key":"1908_CR29","unstructured":"Quan, L. (2013). Research on access control based on attribute en-cryption system. Huazhong University of Science and Technology."},{"key":"1908_CR30","doi-asserted-by":"crossref","unstructured":"Sahai, A., & Waters, B. (2005). Fuzzy identity-based encryption. Advances in Cryptoloty-EUROCRYPT 2005.","DOI":"10.1007\/11426639_27"},{"key":"1908_CR31","doi-asserted-by":"crossref","unstructured":"Goyal, V., Pandey, O., Sahai, A., & Waters, B. (2006). Attribute-based encryption for fine-grained access control of encrypted data. Proceedings of the 13th ACM conference on Computer and communications security (pp. 89\u201398).","DOI":"10.1145\/1180405.1180418"},{"key":"1908_CR32","doi-asserted-by":"crossref","unstructured":"Bethencourt, J., Sahai, A., & Waters, B. (2007). Ciphertext-policy attribute-based encryption (pp. 321\u2013334) IEEE Symposium on Security & Privacy.","DOI":"10.1109\/SP.2007.11"},{"key":"1908_CR33","unstructured":"Jianpeng, D. (2017). Research on searchable encryption technology based on cloud storage. Nanjing University of Posts and Telecommunications."},{"issue":"1","key":"1908_CR34","first-page":"7","volume":"31","author":"Yu Jinxia","year":"2019","unstructured":"Jinxia, Yu., Chaochao, Y., Liwei, Y., Yongli, T., & Xixi, Y. (2019). Access tree supported attribute-based encryption scheme on ideal lattices. Journal of Chongqing University of Posts and Telecommunications: Natural Science Edition, 31(1), 7.","journal-title":"Journal of Chongqing University of Posts and Telecommunications: Natural Science Edition"},{"key":"1908_CR35","first-page":"105","volume":"024","author":"Z Xuemei","year":"2010","unstructured":"Xuemei, Z. (2010). Implementation and application of AES encryption algorithm. Journal of Changshu Institute of Technology, 024, 105\u2013110.","journal-title":"Journal of Changshu Institute of Technology"},{"key":"1908_CR36","unstructured":"Luo, F. (2010). Hardware implementation of aes and md5 hybrid encryption algorithm. Southeast University. Doctoral dissertation."},{"issue":"1","key":"1908_CR37","first-page":"135","volume":"25","author":"H Liu","year":"2005","unstructured":"Liu, H., Dai, G., Li, H., & Dejun, M. (2005). AES algorithm working in CBC mode can be realized by reconfigurable hardware. Computer Application, 25(1), 135\u2013137.","journal-title":"Computer Application"},{"issue":"2","key":"1908_CR38","first-page":"96","volume":"35","author":"W Xun","year":"2016","unstructured":"Xun, W., Ming, X., Fei, Z., Zejian, Z., Fang, Y., Yaneng, Y., & Xiaodong, W. (2016). Research and improvement of ZigBee protocol wireless network encryption technology. Logistics Technology, 35(2), 96\u201398.","journal-title":"Logistics Technology"},{"key":"1908_CR39","first-page":"94","volume":"010","author":"R Yanmin","year":"2019","unstructured":"Yanmin, R. (2019). Data encryption technology in the application of computer network security. Heilongjiang Science, 010, 94\u201395.","journal-title":"Heilongjiang Science"},{"key":"1908_CR40","unstructured":"Haifeng, L., Whereabouts, L., & Xingliang, L. (2019). A two-dimensional code encryption algorithm combining optimized AES and RSA algorithm. Journal of Shaanxi University of Science & Technology, 37(6)."},{"key":"1908_CR41","unstructured":"Wei, Y. (2010). Design principle of AES algorithm and improvement of key expansion algorithm [d]."},{"key":"1908_CR42","doi-asserted-by":"crossref","unstructured":"Qiu, M., Guo, M., Liu, M., Xue, C., Yang, L., & Sha, E. (2009, June). Loop scheduling and bank type assignment for heterogeneous multi-bank memory. Journal of Parallel and Distributed Computing, 69, 546\u2013558.","DOI":"10.1016\/j.jpdc.2009.02.005"},{"key":"1908_CR43","unstructured":"Gao, Y., Iqbal, S., Zhang, P., & Qiu, M. (2015, August). Performance and power analysis of high-density multi-GPGPU architectures: A preliminary case study."},{"key":"1908_CR44","doi-asserted-by":"crossref","unstructured":"Qiu, M., Chen, Z., Niu, J., Quan, G., Qin, X., & Yang, L. (2015, December). Data allocation for hybrid memory with genetic algorithm. IEEE Transactions on Emerging Topics in Computing,3, 1\u20131.","DOI":"10.1109\/TETC.2015.2398824"},{"key":"1908_CR45","unstructured":"WHO Obesity. (2000). Preventing and managing the global epidemic. Geneva. PhD thesis."},{"key":"1908_CR46","doi-asserted-by":"crossref","unstructured":"Nguyen, H.\u00a0A., Giordano, S., & Puiatti, A. (2007). Probabilistic routing protocol for intermittently connected mobile ad hoc network (PROPICMAN). 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (pp. 1\u20136). IEEE.","DOI":"10.1109\/WOWMOM.2007.4351696"},{"key":"1908_CR47","doi-asserted-by":"crossref","unstructured":"Huang, H., Quan, G., Fan, J., & Qiu, M. (2011, June). Throughput maximization for periodic real-time systems under the maximal temperature constraint. ACM Transactions on Embedded Computing Systems,13, 363\u2013368.","DOI":"10.1145\/2024724.2024811"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-023-01908-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11265-023-01908-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-023-01908-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,15]],"date-time":"2024-05-15T08:14:05Z","timestamp":1715760845000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11265-023-01908-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["1908"],"URL":"https:\/\/doi.org\/10.1007\/s11265-023-01908-1","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2]]},"assertion":[{"value":"8 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"For this type of study formal consent was not required. This manuscript does not contain any studies with human participants or animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The authors declare that they have no competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}