{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T12:29:06Z","timestamp":1770812946791,"version":"3.50.1"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T00:00:00Z","timestamp":1770768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T00:00:00Z","timestamp":1770768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100018822","name":"Western Sydney University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100018822","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Graph-structured data are integral to applications like social networks, biological systems, cybersecurity, and fraud detection. Outsourcing these data to public clouds offers scalability but raises privacy concerns, as encryption is required before outsourcing, making traditional graph similarity search and access control challenging. This paper presents a novel solution for privacy-preserving full graph similarity search with fine-grained access control in cloud environments. To the best of our knowledge, this is the first work to integrate privacy-preserving graph similarity search in a multi-user\/multi-query setting with attribute-based access control (ABAC). This enables scalable and secure access in realistic, collaborative environments. The graph owner leverages the neural Graph2vec model to create feature indexes for encrypted graph data. Simultaneously, a secure transfer learning mechanism enables graph users to generate query feature indexes in the same latent space, ensuring privacy while accurately capturing the user\u2019s query intent. ABAC is employed to enforce flexible, fine-grained access policies. We conduct a formal security analysis under known-ciphertext and known-background threat models, demonstrating strong privacy guarantees. Experimental evaluations on real-world datasets show that our scheme achieves high semantic accuracy, lower search latency, and reduced storage overhead, outperforming existing approaches.<\/jats:p>","DOI":"10.1186\/s42400-025-00457-3","type":"journal-article","created":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T02:02:01Z","timestamp":1770775321000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Privacy-preserving graph similarity search with attribute-based access control"],"prefix":"10.1186","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5952-8502","authenticated-orcid":false,"given":"Shawal","family":"Khan","sequence":"first","affiliation":[]},{"given":"Shahzad","family":"Khan","sequence":"additional","affiliation":[]},{"given":"Weisheng","family":"Si","sequence":"additional","affiliation":[]},{"given":"Bahman","family":"Javadi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,11]]},"reference":[{"key":"457_CR1","doi-asserted-by":"crossref","unstructured":"Adhikari B, Zhang Y, Ramakrishnan N, Prakash BA (2017) Distributed representations of subgraphs. In: 2017 IEEE International conference on data mining workshops (ICDMW). pp. 111\u2013117. IEEE","DOI":"10.1109\/ICDMW.2017.20"},{"key":"457_CR2","volume-title":"Elementary linear algebra: applications version","author":"H Anton","year":"2013","unstructured":"Anton H, Rorres C (2013) Elementary linear algebra: applications version. John Wiley & Sons"},{"key":"457_CR3","doi-asserted-by":"crossref","unstructured":"Bethencourt J, Sahai A, Waters B (2007) Ciphertext-policy attribute-based encryption. In: 2007 IEEE symposium on security and privacy (SP\u201907). pp. 321\u2013334. IEEE","DOI":"10.1109\/SP.2007.11"},{"key":"457_CR4","doi-asserted-by":"crossref","unstructured":"Boneh D, Boyen X (2004) Efficient selective-id secure identity-based encryption without random oracles. In: International conference on the theory and applications of cryptographic techniques. pp. 223\u2013238. Springer","DOI":"10.1007\/978-3-540-24676-3_14"},{"issue":"4","key":"457_CR5","doi-asserted-by":"publisher","first-page":"2150","DOI":"10.3906\/elk-1402-315","volume":"24","author":"M BULUT","year":"2016","unstructured":"BULUT M (2016) Reducedcbt and supercbt: two new and improved complete binary tree structures. Turkish J Electric Eng Comput Sci 24(4):2150\u20132162","journal-title":"Turkish J Electric Eng Comput Sci"},{"key":"457_CR6","unstructured":"\u00c7akmak M (2023) Shallow transfer learning models. In: Engineering sciences in a globalizing world, pp. 53\u201355. Duvar Publishing, Istanbul, 1st edn"},{"issue":"1","key":"457_CR7","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1109\/TPDS.2013.45","volume":"25","author":"N Cao","year":"2013","unstructured":"Cao N, Wang C, Li M, Ren K, Lou W (2013) Privacy-preserving multi-keyword ranked search over encrypted cloud data. IEEE Trans Parallel Distrib Syst 25(1):222\u2013233","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"457_CR8","doi-asserted-by":"crossref","unstructured":"Cao N, Yang Z, Wang C, Ren K, Lou W (2011) Privacy-preserving query over encrypted graph-structured data in cloud computing. In: 2011 31st International conference on distributed computing systems. pp. 393\u2013402. IEEE","DOI":"10.1109\/ICDCS.2011.84"},{"key":"457_CR9","doi-asserted-by":"crossref","unstructured":"Chase M, Kamara S (2010) Structured encryption and controlled disclosure. In: International conference on the theory and application of cryptology and information security. pp. 577\u2013594. Springer","DOI":"10.1007\/978-3-642-17373-8_33"},{"key":"457_CR10","doi-asserted-by":"crossref","unstructured":"Chor B (1998) O. goldreich, e. kushilevitz, and m. sudan. private information retrieval. In: 36th annual symposium on foundations of computer science. pp. 41\u201350","DOI":"10.1109\/SFCS.1995.492461"},{"issue":"10","key":"457_CR11","doi-asserted-by":"publisher","first-page":"1367","DOI":"10.1109\/TPAMI.2004.75","volume":"26","author":"LP Cordella","year":"2004","unstructured":"Cordella LP, Foggia P, Sansone C, Vento M (2004) A (sub) graph isomorphism algorithm for matching large graphs. IEEE Trans Pattern Anal Mach Intell 26(10):1367\u20131372","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"457_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2019.102442","volume":"147","author":"H Dai","year":"2019","unstructured":"Dai H, Dai X, Yi X, Yang G, Huang H (2019) Semantic-aware multi-keyword ranked search scheme over encrypted cloud data. J Netw Comput Appl 147:102442","journal-title":"J Netw Comput Appl"},{"key":"457_CR13","doi-asserted-by":"crossref","unstructured":"Delfs H, Knebl H (2015) Public-key cryptography. In: Introduction to cryptography, pp. 49\u2013106. Springer","DOI":"10.1007\/978-3-662-47974-2_3"},{"key":"457_CR14","doi-asserted-by":"crossref","unstructured":"Du M, Wu S, Wang Q, Chen D, Jiang P, Mohaisen A (2020) Graphshield: dynamic large graphs for secure queries with forward privacy. In: IEEE Transactions on Knowledge and Data Engineering","DOI":"10.1109\/TKDE.2020.3024883"},{"issue":"4","key":"457_CR15","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1109\/TSC.2013.42","volume":"7","author":"Z Fan","year":"2013","unstructured":"Fan Z, Peng Y, Choi B, Xu J, Bhowmick SS (2013) Towards efficient authenticated subgraph query service in outsourced graph databases. IEEE Trans Serv Comput 7(4):696\u2013713","journal-title":"IEEE Trans Serv Comput"},{"key":"457_CR16","doi-asserted-by":"crossref","unstructured":"Fan Z, Choi B, Xu J, Bhowmick SS (2015) Asymmetric structure-preserving subgraph queries for large graphs. In: 2015 IEEE 31st International conference on data engineering. pp. 339\u2013350. IEEE","DOI":"10.1109\/ICDE.2015.7113296"},{"key":"457_CR17","doi-asserted-by":"crossref","unstructured":"Gabryel M, Dama\u0161evi\u010dius R, Przybyszewski K (2018) Application of the bag-of-words algorithm in classification the quality of sales leads. In: International conference on artificial intelligence and soft computing. pp. 615\u2013622. Springer","DOI":"10.1007\/978-3-319-91253-0_57"},{"key":"457_CR18","doi-asserted-by":"crossref","unstructured":"Gao J, Yu JX, Jin R, Zhou J, Wang T, Yang D (2011) Neighborhood-privacy protected shortest distance computing in cloud. In: Proceedings of the 2011 ACM SIGMOD international conference on management of data. pp. 409\u2013420","DOI":"10.1145\/1989323.1989367"},{"issue":"1","key":"457_CR19","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1109\/TSMC.2021.3073542","volume":"52","author":"X Ge","year":"2021","unstructured":"Ge X, Yu J, Zhang H, Bai J, Fan J, Xiong NN (2021) Spps: a search pattern privacy system for approximate shortest distance query of encrypted graphs in iiot. IEEE Trans Syst Man Cybern Syst 52(1):136\u2013150","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"457_CR20","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) node2vec: Scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining. pp. 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"key":"457_CR21","doi-asserted-by":"crossref","unstructured":"Han WS, Lee J, Lee JH (2013) Turboiso: towards ultrafast and robust subgraph isomorphism search in large graph databases. In: Proceedings of the 2013 ACM SIGMOD international conference on management of data. pp. 337\u2013348","DOI":"10.1145\/2463676.2465300"},{"key":"457_CR22","doi-asserted-by":"crossref","unstructured":"He X, Vaidya J, Shafiq B, Adam N, Lin X (2010) Reachability analysis in privacy-preserving perturbed graphs. In: 2010 IEEE\/WIC\/ACM international conference on web intelligence and intelligent agent technology. vol.\u00a01, pp. 691\u2013694. IEEE","DOI":"10.1109\/WI-IAT.2010.216"},{"key":"457_CR23","volume":"77","author":"L Huang","year":"2023","unstructured":"Huang L, Xue J, Wang Y, Liu Z, Chen J, Kong Z (2023) Whgdroid: Effective android malware detection based on weighted heterogeneous graph. J Inform Secur Appl 77:103556","journal-title":"J Inform Secur Appl"},{"issue":"11","key":"457_CR24","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.14778\/3402707.3402749","volume":"4","author":"V Karwa","year":"2011","unstructured":"Karwa V, Raskhodnikova S, Smith A, Yaroslavtsev G (2011) Private analysis of graph structure. Proceed VLDB Endowment 4(11):1146\u20131157","journal-title":"Proceed VLDB Endowment"},{"key":"457_CR25","doi-asserted-by":"crossref","unstructured":"Khan S, Abbas H, Iqbal W (2024) Verifiable privacy-preserving image retrieval in multi-owner multi-user settings. IEEE Transactions on emerging topics in computational intelligence","DOI":"10.1109\/TETCI.2024.3353612"},{"key":"457_CR26","unstructured":"Kundu A, Atallah M, Bertino E (2012) Efficient leakage-free authentication of trees, graphs and forests. Cryptology ePrint Archive"},{"key":"457_CR27","unstructured":"Le Q, Mikolov T (2014) Distributed representations of sentences and documents. In: International conference on machine learning. pp. 1188\u20131196. PMLR"},{"key":"457_CR28","doi-asserted-by":"crossref","unstructured":"Liang Y, Zhao P (2017) Similarity search in graph databases: A multi-layered indexing approach. In: 2017 IEEE 33rd international conference on data engineering (ICDE). pp. 783\u2013794. IEEE","DOI":"10.1109\/ICDE.2017.129"},{"issue":"11","key":"457_CR29","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1002\/sec.738","volume":"7","author":"Y Liu","year":"2014","unstructured":"Liu Y, Peng W, Su J (2014) A study of ip prefix hijacking in cloud computing networks. Secur Commun Netw 7(11):2201\u20132210","journal-title":"Secur Commun Netw"},{"key":"457_CR30","doi-asserted-by":"crossref","unstructured":"Mouratidis K, Yiu ML (2012) Shortest path computation with no information leakage. arXiv preprint arXiv:1204.6076","DOI":"10.14778\/2212351.2212352"},{"key":"457_CR31","unstructured":"Narayanan A, Chandramohan M, Chen L, Liu Y, Saminathan S (2016) subgraph2vec: Learning distributed representations of rooted sub-graphs from large graphs. arXiv preprint arXiv:1606.08928"},{"key":"457_CR32","unstructured":"Narayanan A, Chandramohan M, Venkatesan R, Chen L, Liu Y, Jaiswal S (2017) graph2vec: Learning distributed representations of graphs. arXiv preprint arXiv:1707.05005"},{"key":"457_CR33","doi-asserted-by":"crossref","unstructured":"Ostrovsky R, Sahai A, Waters B (2007) Attribute-based encryption with non-monotonic access structures. In: Proceedings of the 14th ACM conference on computer and communications security. pp. 195\u2013203","DOI":"10.1145\/1315245.1315270"},{"key":"457_CR34","unstructured":"\u0158eh\u016f\u0159ek R, Sojka P (May 2010) Software Framework for Topic Modelling with Large Corpora. In: Proceedings of the LREC 2010 workshop on new challenges for NLP frameworks. pp. 45\u201350. ELRA, Valletta, Malta"},{"key":"457_CR35","doi-asserted-by":"crossref","unstructured":"Sahai A, Waters B (2005) Fuzzy identity-based encryption. In: Annual international conference on the theory and applications of cryptographic techniques. pp. 457\u2013473. Springer","DOI":"10.1007\/11426639_27"},{"issue":"1","key":"457_CR36","doi-asserted-by":"publisher","first-page":"364","DOI":"10.14778\/1453856.1453899","volume":"1","author":"H Shang","year":"2008","unstructured":"Shang H, Zhang Y, Lin X, Yu JX (2008) Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. Proceed VLDB Endowment 1(1):364\u2013375","journal-title":"Proceed VLDB Endowment"},{"key":"457_CR37","unstructured":"Song DX, Wagner D, Perrig A (2000) Practical techniques for searches on encrypted data. In: Proceeding 2000 IEEE symposium on security and privacy. S &P 2000. pp. 44\u201355. IEEE"},{"key":"457_CR38","first-page":"145","volume":"40","author":"L Sun","year":"2018","unstructured":"Sun L, Xu C, Zhang Y (2018) A dynamic and non-interactive Boolean searchable symmetric encryption in multi-client setting. J Inform Secur Appl 40:145\u2013155","journal-title":"J Inform Secur Appl"},{"key":"457_CR39","doi-asserted-by":"crossref","unstructured":"Sun W, Wang B, Cao N, Li M, Lou W, Hou YT, Li H (2013) Privacy-preserving multi-keyword text search in the cloud supporting similarity-based ranking. In: Proceedings of the 8th ACM SIGSAC symposium on information, computer and communications security. pp. 71\u201382","DOI":"10.1145\/2484313.2484322"},{"issue":"1","key":"457_CR40","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann JR (1976) An algorithm for subgraph isomorphism. J ACM (JACM) 23(1):31\u201342","journal-title":"J ACM (JACM)"},{"key":"457_CR41","doi-asserted-by":"publisher","first-page":"3179","DOI":"10.1109\/TIFS.2022.3201392","volume":"17","author":"S Wang","year":"2022","unstructured":"Wang S, Zheng Y, Jia X, Yi X (2022) Pegraph: A system for privacy-preserving and efficient search over encrypted social graphs. IEEE Trans Inf Forensics Secur 17:3179\u20133194","journal-title":"IEEE Trans Inf Forensics Secur"},{"issue":"10","key":"457_CR42","doi-asserted-by":"publisher","first-page":"10478","DOI":"10.1109\/TKDE.2023.3266449","volume":"35","author":"S Wang","year":"2023","unstructured":"Wang S, Zheng Y, Jia X, Huang H, Wang C (2023) Prigsim: towards privacy-preserving graph similarity search as a cloud service. IEEE Trans Knowl Data Eng 35(10):10478\u201310496","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"457_CR43","doi-asserted-by":"crossref","unstructured":"Wong WK, Cheung DWl, Kao B, Mamoulis N (2009) Secure knn computation on encrypted databases. In: Proceedings of the 2009 ACM SIGMOD international conference on management of data. pp. 139\u2013152","DOI":"10.1145\/1559845.1559862"},{"key":"457_CR44","doi-asserted-by":"crossref","unstructured":"Yanardag P, Vishwanathan S (2015) Deep graph kernels. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining. pp. 1365\u20131374","DOI":"10.1145\/2783258.2783417"},{"key":"457_CR45","doi-asserted-by":"publisher","unstructured":"Yan X, Han J (2002) gspan: graph-based substructure pattern mining. In: 2002 IEEE international conference on data mining, 2002. Proceedings. pp. 721\u2013724 . https:\/\/doi.org\/10.1109\/ICDM.2002.1184038","DOI":"10.1109\/ICDM.2002.1184038"},{"key":"457_CR46","doi-asserted-by":"crossref","unstructured":"Yan X, Yu PS, Han J (2004) Graph indexing: a frequent structure-based approach. In: Proceedings of the 2004 ACM SIGMOD international conference on management of data. pp. 335\u2013346","DOI":"10.1145\/1007568.1007607"},{"key":"457_CR47","doi-asserted-by":"crossref","unstructured":"Yi P, Fan Z, Yin S (2014) Privacy-preserving reachability query services for sparse graphs. In: 2014 IEEE 30th international conference on data engineering workshops. pp. 32\u201335. IEEE","DOI":"10.1109\/ICDEW.2014.6818298"},{"key":"457_CR48","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.ins.2019.07.082","volume":"506","author":"C Zhang","year":"2020","unstructured":"Zhang C, Zhu L, Xu C, Sharif K, Zhang C, Liu X (2020) Pgas: Privacy-preserving graph encryption for accurate constrained shortest distance queries. Inf Sci 506:325\u2013345","journal-title":"Inf Sci"},{"issue":"8","key":"457_CR49","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1109\/TKDE.2019.2906608","volume":"32","author":"Y Zhu","year":"2019","unstructured":"Zhu Y, Qin L, Yu JX, Cheng H (2019) Answering top-$$k$$ graph similarity queries in graph databases. IEEE Trans Knowl Data Eng 32(8):1459\u20131474","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"457_CR50","doi-asserted-by":"crossref","unstructured":"Zhu H, Wu B, Xie M, Cui Z, Wu Z (2016) Secure shortest path search over encrypted graph supporting synonym query in cloud computing. In: 2016 IEEE Trustcom\/BigDataSE\/ISPA. pp. 497\u2013504. IEEE","DOI":"10.1109\/TrustCom.2016.0102"},{"key":"457_CR51","unstructured":"Zuo X, Li L, Peng H, Luo S, Yang Y (2020) Privacy-preserving subgraph matching scheme with authentication in social networks. IEEE Transactions on cloud computing"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00457-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00457-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00457-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T02:02:13Z","timestamp":1770775333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s42400-025-00457-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,11]]},"references-count":51,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["457"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00457-3","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,11]]},"assertion":[{"value":"19 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no conflict of interest.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"27"}}