{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T16:30:35Z","timestamp":1781022635276,"version":"3.54.1"},"reference-count":196,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T00:00:00Z","timestamp":1709337600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T00:00:00Z","timestamp":1709337600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB4501500"],"award-info":[{"award-number":["2022YFB4501500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Mach. Learn. &amp; Cyber."],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1007\/s13042-024-02106-6","type":"journal-article","created":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T20:01:33Z","timestamp":1709409693000},"page":"3513-3532","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Survey and open problems in privacy-preserving knowledge graph: merging, query, representation, completion, and applications"],"prefix":"10.1007","volume":"15","author":[{"given":"Chaochao","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fei","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jamie","family":"Cui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuwei","family":"Cao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guanfeng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,3,2]]},"reference":[{"key":"2106_CR1","doi-asserted-by":"crossref","unstructured":"Abadi M, Chu A, Goodfellow I et\u00a0al (2016) Deep learning with differential privacy. In: Proceedings of the 2016 ACM SIGSAC conference on computer and communications security, pp 308\u2013318","DOI":"10.1145\/2976749.2978318"},{"issue":"1","key":"2106_CR2","first-page":"111","volume":"9","author":"S Ahmed","year":"2019","unstructured":"Ahmed S, Zaman A, Zhang Z et al (2019) Semi-order preserving encryption technique for numeric database. Int J Netw Comput 9(1):111\u2013129","journal-title":"Int J Netw Comput"},{"key":"2106_CR3","first-page":"1483","volume":"2019","author":"A Ali","year":"2019","unstructured":"Ali A, Lepoint T, Patel S et al (2019) Communication-computation trade-offs in pir. IACR Cryptol ePrint Arch 2019:1483","journal-title":"IACR Cryptol ePrint Arch"},{"key":"2106_CR4","doi-asserted-by":"crossref","unstructured":"Angel S, Chen H, Laine K et\u00a0al (2018) Pir with compressed queries and amortized query processing. In: 2018 IEEE symposium on security and privacy (SP), pp 962\u2013979","DOI":"10.1109\/SP.2018.00062"},{"key":"2106_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3104031","volume":"50","author":"R Angles","year":"2017","unstructured":"Angles R, Arenas M, Barcel\u00f3 P et al (2017) Foundations of modern query languages for graph databases. ACM Comput Surv (CSUR) 50:1\u201340","journal-title":"ACM Comput Surv (CSUR)"},{"key":"2106_CR6","doi-asserted-by":"crossref","unstructured":"Aono Y, Hayashi T, Trieu\u00a0Phong L et\u00a0al (2016) Scalable and secure logistic regression via homomorphic encryption. In: Proceedings of the sixth ACM conference on data and application security and privacy, pp 142\u2013144","DOI":"10.1145\/2857705.2857731"},{"key":"2106_CR7","doi-asserted-by":"crossref","unstructured":"Barcel\u00f3 P (2013) Querying graph databases. In: PODS \u201913","DOI":"10.1145\/2463664.2465216"},{"key":"2106_CR8","unstructured":"Besta M, Peter E, Gerstenberger R et\u00a0al (2019) Demystifying graph databases: analysis and taxonomy of data organization, system designs, and graph queries. arXiv:1910.09017"},{"key":"2106_CR9","doi-asserted-by":"crossref","unstructured":"Blanton M, Steele A, Alisagari M (2013) Data-oblivious graph algorithms for secure computation and outsourcing. In: Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security, pp 207\u2013218","DOI":"10.1145\/2484313.2484341"},{"key":"2106_CR10","doi-asserted-by":"crossref","unstructured":"Bollacker K, Evans C, Paritosh P et\u00a0al (2008) Freebase: a collaboratively created graph database for structuring human knowledge. In: Proceedings of the 2008 ACM SIGMOD international conference on Management of data, pp 1247\u20131250","DOI":"10.1145\/1376616.1376746"},{"key":"2106_CR11","doi-asserted-by":"crossref","unstructured":"Bonawitz K, Ivanov V, Kreuter B et\u00a0al (2017) Practical secure aggregation for privacy-preserving machine learning. In: proceedings of the 2017 ACM SIGSAC conference on computer and communications security, pp 1175\u20131191","DOI":"10.1145\/3133956.3133982"},{"key":"2106_CR12","doi-asserted-by":"crossref","unstructured":"Bordes A, Weston J, Collobert R et\u00a0al (2011) Learning structured embeddings of knowledge bases. In: Twenty-fifth AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v25i1.7917"},{"key":"2106_CR13","unstructured":"Bordes A, Usunier N, Garcia-Duran A et\u00a0al (2013) Translating embeddings for modeling multi-relational data. In: Advances in neural information processing system 26"},{"key":"2106_CR14","doi-asserted-by":"crossref","unstructured":"Bornea MA, Dolby J, Kementsietsidis A et\u00a0al (2013) Building an efficient rdf store over a relational database. In: Proceedings of the 2013 ACM SIGMOD international conference on management of data, pp 121\u2013132","DOI":"10.1145\/2463676.2463718"},{"key":"2106_CR15","first-page":"567","volume":"2017","author":"E Boyle","year":"2017","unstructured":"Boyle E, Ishai Y, Pass R et al (2017) Can we access a database both locally and privately? IACR Cryptol ePrint Arch 2017:567","journal-title":"IACR Cryptol ePrint Arch"},{"key":"2106_CR16","volume":"2023","author":"P Buddhavarapu","year":"2020","unstructured":"Buddhavarapu P, Knox A, Mohassel P et al (2020) Private matching for compute. IACR Cryptol ePrint Arch 2023:12","journal-title":"IACR Cryptol ePrint Arch"},{"key":"2106_CR17","doi-asserted-by":"publisher","unstructured":"Bunn P, Ostrovsky R (2007) Secure two-party k-means clustering. In: Ning P, di\u00a0Vimercati SDC, Syverson PF (eds) Proceedings of the 2007 ACM conference on computer and communications security, CCS 2007, Alexandria, Virginia, USA, October 28\u201331, 2007. ACM, pp 486\u2013497. https:\/\/doi.org\/10.1145\/1315245.1315306","DOI":"10.1145\/1315245.1315306"},{"key":"2106_CR18","doi-asserted-by":"crossref","unstructured":"Buzmakov A, Kuznetsov S, Napoli A (2015) Revisiting pattern structure projections. ArXiv: 1506.05018","DOI":"10.1007\/978-3-319-19545-2_13"},{"issue":"9","key":"2106_CR19","doi-asserted-by":"crossref","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai H, Zheng VW, Chang KCC (2018) A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans Knowl Data Eng 30(9):1616\u20131637","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2106_CR20","doi-asserted-by":"crossref","unstructured":"Caldarola D, Mancini M, Galasso F et\u00a0al (2021) Cluster-driven graph federated learning over multiple domains. In: CVPR workshops, pp 2749\u20132758","DOI":"10.1109\/CVPRW53098.2021.00309"},{"key":"2106_CR21","doi-asserted-by":"crossref","unstructured":"Calvanese D, Giacomo GD, Lenzerini M et\u00a0al (1999) Rewriting of regular expressions and regular path queries. In: PODS \u201999","DOI":"10.1145\/303976.303996"},{"key":"2106_CR22","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/959060.959076","volume":"32","author":"D Calvanese","year":"2003","unstructured":"Calvanese D, Giacomo GD, Lenzerini M et al (2003) Reasoning on regular path queries. SIGMOD Rec 32:83\u201392","journal-title":"SIGMOD Rec"},{"key":"2106_CR23","first-page":"568","volume":"2017","author":"R Canetti","year":"2017","unstructured":"Canetti R, Holmgren J, Richelson S (2017) Towards doubly efficient private information retrieval. IACR Cryptol ePrint Arch 2017:568","journal-title":"IACR Cryptol ePrint Arch"},{"key":"2106_CR24","doi-asserted-by":"crossref","unstructured":"Cao Y, Wang X, He X et\u00a0al (2019) Unifying knowledge graph learning and recommendation: towards a better understanding of user preferences. In: The World Wide Web conference, pp 151\u2013161","DOI":"10.1145\/3308558.3313705"},{"key":"2106_CR25","doi-asserted-by":"crossref","unstructured":"Cao Y, Peng H, Yu PS (2020) Multi-information source hin for medical concept embedding. In: Advances in knowledge discovery and data mining: 24th Pacific-Asia conference, PAKDD 2020, Singapore, May 11\u201314, 2020, Proceedings, Part II 24, Springer, pp 396\u2013408","DOI":"10.1007\/978-3-030-47436-2_30"},{"key":"2106_CR26","doi-asserted-by":"crossref","unstructured":"Cao Y, Yang L, Wang C et\u00a0al (2023) Multi-task item-attribute graph pre-training for strict cold-start item recommendation. RecSys 2023","DOI":"10.1145\/3604915.3608806"},{"key":"2106_CR27","unstructured":"Carta S, Giuliani A, Piano L et\u00a0al (2023) Iterative zero-shot llm prompting for knowledge graph construction. arXiv:2307.01128"},{"key":"2106_CR28","doi-asserted-by":"crossref","unstructured":"Cash D, Jarecki S, Jutla C et\u00a0al (2013) Highly-scalable searchable symmetric encryption with support for Boolean queries. In: Annual cryptology conference. Springer, pp 353\u2013373","DOI":"10.1007\/978-3-642-40041-4_20"},{"key":"2106_CR29","first-page":"762","volume":"2017","author":"M Chase","year":"2017","unstructured":"Chase M, Gilad-Bachrach R, Laine K et al (2017) Private collaborative neural network learning. IACR Cryptol ePrint Arch 2017:762","journal-title":"IACR Cryptol ePrint Arch"},{"key":"2106_CR30","unstructured":"Chen C, Li L, Wu B et\u00a0al (2020) Secure social recommendation based on secret sharing. In: 24th European conference on artificial intelligence, frontiers in artificial intelligence and applications, vol 325. IOS Press, pp 506\u2013512"},{"key":"2106_CR31","doi-asserted-by":"publisher","unstructured":"Chen C, Zhou J, Wang L et\u00a0al (2021) When homomorphic encryption marries secret sharing: secure large-scale sparse logistic regression and applications in risk control. In: Zhu F, Ooi BC, Miao C (eds) KDD \u201921: the 27th ACM SIGKDD conference on knowledge discovery and data mining, virtual event, Singapore, August 14\u201318, 2021. ACM, pp 2652\u20132662. https:\/\/doi.org\/10.1145\/3447548.3467210","DOI":"10.1145\/3447548.3467210"},{"key":"2106_CR32","doi-asserted-by":"publisher","unstructured":"Chen C, Zhou J, Zheng L et\u00a0al (2022) Vertically federated graph neural network for privacy-preserving node classification. In: Raedt LD (ed) Proceedings of the thirty-first international joint conference on artificial intelligence, IJCAI 2022, Vienna, Austria, 23\u201329 July 2022. ijcai.org, pp 1959\u20131965. https:\/\/doi.org\/10.24963\/ijcai.2022\/272","DOI":"10.24963\/ijcai.2022\/272"},{"issue":"8","key":"2106_CR33","doi-asserted-by":"crossref","first-page":"1775","DOI":"10.1109\/TPDS.2021.3125565","volume":"33","author":"F Chen","year":"2022","unstructured":"Chen F, Li P, Miyazaki T et al (2022) Fedgraph: federated graph learning with intelligent sampling. IEEE Trans Parallel Distrib Syst 33(8):1775\u20131786","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2106_CR34","doi-asserted-by":"crossref","unstructured":"Chen H, Laine K, Rindal P (2017) Fast private set intersection from homomorphic encryption. In: Proceedings of the 2017 ACM SIGSAC conference on computer and communications security, pp 1243\u20131255","DOI":"10.1145\/3133956.3134061"},{"key":"2106_CR35","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.neucom.2017.11.064","volume":"294","author":"H Chen","year":"2018","unstructured":"Chen H, Wei B, Liu Y et al (2018) Bilinear joint learning of word and entity embeddings for entity linking. Neurocomputing 294:12\u201318","journal-title":"Neurocomputing"},{"key":"2106_CR36","doi-asserted-by":"crossref","unstructured":"Chen W, Xiong W, Yan X et\u00a0al (2018) Variational knowledge graph reasoning. In: Proceedings of NAACL-HLT, pp 1823\u20131832","DOI":"10.18653\/v1\/N18-1165"},{"key":"2106_CR37","doi-asserted-by":"crossref","unstructured":"Chen X, Zhang N, Li L et\u00a0al (2022) Hybrid transformer with multi-level fusion for multimodal knowledge graph completion. In: Proceedings of the 45th international ACM SIGIR conference on research and development in information retrieval, pp 904\u2013915","DOI":"10.1145\/3477495.3531992"},{"key":"2106_CR38","doi-asserted-by":"crossref","unstructured":"Chen Y, Bin G, Huang X (2018) On evaluation of graph pattern matching in large databases. In: 2018 international conference on computational science and computational intelligence (CSCI), pp 1242\u20131247","DOI":"10.1109\/CSCI46756.2018.00240"},{"key":"2106_CR39","doi-asserted-by":"crossref","unstructured":"Chen Y, Wu L, Zaki MJ (2019) Bidirectional attentive memory networks for question answering over knowledge bases. In: NAACL, pp 2913\u20132923","DOI":"10.18653\/v1\/N19-1299"},{"key":"2106_CR40","doi-asserted-by":"crossref","unstructured":"Cheng D, Tu Y, Ma ZW et\u00a0al (2019) Risk assessment for networked-guarantee loans using high-order graph attention representation. In: IJCAI, pp 5822\u20135828","DOI":"10.24963\/ijcai.2019\/807"},{"key":"2106_CR41","doi-asserted-by":"crossref","unstructured":"Cheng J, Yu J, Ding B et\u00a0al (2008) Fast graph pattern matching. In: 2008 IEEE 24th international conference on data engineering, pp 913\u2013922","DOI":"10.1109\/ICDE.2008.4497500"},{"key":"2106_CR42","doi-asserted-by":"crossref","unstructured":"Cheon JH, Kim A, Kim M et\u00a0al (2017) Homomorphic encryption for arithmetic of approximate numbers. In: Advances in cryptology\u2014ASIACRYPT 2017: 23rd international conference on the theory and applications of cryptology and information security, Hong Kong, China, December 3\u20137, 2017, Proceedings, Part I 23. Springer, pp 409\u2013437","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"2106_CR43","doi-asserted-by":"crossref","unstructured":"Chor B, Goldreich O, Kushilevitz E et\u00a0al (1995) Private information retrieval. In: Proceedings of IEEE 36th annual foundations of computer science. IEEE, pp 41\u201350","DOI":"10.1109\/SFCS.1995.492461"},{"key":"2106_CR44","doi-asserted-by":"publisher","unstructured":"Cong K, Moreno RC, da\u00a0Gama MB et\u00a0al (2021) Labeled PSI from homomorphic encryption with reduced computation and communication. In: CCS \u201921: 2021 ACM SIGSAC conference on computer and communications security, virtual event, Republic of Korea, November 15\u201319, 2021. ACM, pp 1135\u20131150. https:\/\/doi.org\/10.1145\/3460120.3484760","DOI":"10.1145\/3460120.3484760"},{"key":"2106_CR45","doi-asserted-by":"crossref","unstructured":"Consens MP, Mendelzon A (1990) Graphlog: a visual formalism for real life recursion. In: PODS \u201990","DOI":"10.1145\/298514.298591"},{"key":"2106_CR46","doi-asserted-by":"crossref","unstructured":"Cui J, Chen C, Wang L (2020) Highly-scalable protected graph database search with oblivious filter. Cryptology ePrint Archive, Report 2020\/1415. https:\/\/eprint.iacr.org\/2020\/1415","DOI":"10.1149\/MA2020-01251415mtgabs"},{"key":"2106_CR47","first-page":"10524","volume":"34","author":"J Cui","year":"2021","unstructured":"Cui J, Chen C, Lyu L et al (2021) Exploiting data sparsity in secure cross-platform social recommendation. Adv Neural Inf Process Syst 34:10524\u201310534","journal-title":"Adv Neural Inf Process Syst"},{"key":"2106_CR48","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd I, Escudero D, Frederiksen T et\u00a0al (2019) New primitives for actively-secure mpc over rings with applications to private machine learning. In: 2019 IEEE S &P, IEEE, pp 1102\u20131120","DOI":"10.1109\/SP.2019.00078"},{"key":"2106_CR49","doi-asserted-by":"crossref","unstructured":"De\u00a0Cristofaro E, Tsudik G (2010) Practical private set intersection protocols with linear complexity. In: International conference on financial cryptography and data security. Springer, pp 143\u2013159","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"2106_CR50","doi-asserted-by":"crossref","unstructured":"Demmler D, Schneider T, Zohner M (2015) Aby-a framework for efficient mixed-protocol secure two-party computation. In: NDSS","DOI":"10.14722\/ndss.2015.23113"},{"key":"2106_CR51","doi-asserted-by":"crossref","unstructured":"Dettmers T, Minervini P, Stenetorp P et\u00a0al (2018) Convolutional 2d knowledge graph embeddings. In: 32nd AAAI conference on artificial intelligence, AAAI 2018, AAI Publications, pp 1811\u20131818","DOI":"10.1609\/aaai.v32i1.11573"},{"issue":"1","key":"2106_CR52","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1007\/s10489-021-02460-w","volume":"52","author":"P Do","year":"2022","unstructured":"Do P, Phan TH (2022) Developing a bert based triple classification model using knowledge graph embedding for question answering system. Appl Intell 52(1):636\u2013651","journal-title":"Appl Intell"},{"key":"2106_CR53","doi-asserted-by":"crossref","unstructured":"Dong T, Wang Z, Li J et\u00a0al (2019) Triple classification using regions and fine-grained entity typing. In: Proceedings of the AAAI conference on artificial intelligence, pp 77\u201385","DOI":"10.1609\/aaai.v33i01.330177"},{"key":"2106_CR54","doi-asserted-by":"crossref","unstructured":"Dong X, Gabrilovich E, Heitz G et\u00a0al (2014) Knowledge vault: a web-scale approach to probabilistic knowledge fusion. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining, pp 601\u2013610","DOI":"10.1145\/2623330.2623623"},{"key":"2106_CR55","doi-asserted-by":"crossref","unstructured":"Dou Y, Liu Z, Sun L et\u00a0al (2020) Enhancing graph neural network-based fraud detectors against camouflaged fraudsters. In: Proceedings of the 29th ACM international conference on information & knowledge management, pp 315\u2013324","DOI":"10.1145\/3340531.3411903"},{"key":"2106_CR56","doi-asserted-by":"crossref","unstructured":"Dwork C (2006) Differential privacy. In: International colloquium on automata, languages, and programming. Springer, pp 1\u201312","DOI":"10.1007\/11787006_1"},{"key":"2106_CR57","first-page":"144","volume":"2012","author":"J Fan","year":"2012","unstructured":"Fan J, Vercauteren F (2012) Somewhat practical fully homomorphic encryption. IACR Cryptol ePrint Arch 2012:144","journal-title":"IACR Cryptol ePrint Arch"},{"key":"2106_CR58","doi-asserted-by":"crossref","unstructured":"Fan W (2012) Graph pattern matching revised for social network analysis. In: ICDT \u201912","DOI":"10.1145\/2274576.2274578"},{"key":"2106_CR59","unstructured":"Fang W, Chen C, Tan J et\u00a0al (2020) A hybrid-domain framework for secure gradient tree boosting. arXiv:2005.08479"},{"key":"2106_CR60","unstructured":"Ferr\u00e9 S (2018) A sparql 1.1 query builder for the data analytics of vanilla rdf graphs. PhD thesis, IRISA Rennes Bretagne Atlantique, \u00e9quipe LIS"},{"key":"2106_CR61","doi-asserted-by":"crossref","unstructured":"Francis N, Green A, Guagliardo P et\u00a0al (2018) Cypher: an evolving query language for property graphs. In: Proceedings of the 2018 international conference on management of data, pp 1433\u20131445","DOI":"10.1145\/3183713.3190657"},{"key":"2106_CR62","doi-asserted-by":"crossref","unstructured":"Francis-Landau M, Durrett G, Klein D (2016) Capturing semantic similarity for entity linking with convolutional neural networks. In: Proceedings of the 2016 conference of the North American chapter of the Association for Computational Linguistics: human language technologies, pp 1256\u20131261","DOI":"10.18653\/v1\/N16-1150"},{"key":"2106_CR63","doi-asserted-by":"crossref","unstructured":"Fuchs P, Boncz P, Ghit B (2020) Edgeframe: worst-case optimal joins for graph-pattern matching in spark. In: Proceedings of the 3rd joint international workshop on graph data management experiences & systems (GRADES) and network data analytics (NDA)","DOI":"10.1145\/3398682.3399162"},{"key":"2106_CR64","doi-asserted-by":"publisher","unstructured":"Galkin M, Trivedi P, Maheshwari G et\u00a0al (2020) Message passing for hyper-relational knowledge graphs. In: Webber B, Cohn T, He Y et\u00a0al (eds) Proceedings of the 2020 conference on empirical methods in natural language processing, EMNLP 2020, Online, November 16\u201320, 2020. Association for Computational Linguistics, pp 7346\u20137359, https:\/\/doi.org\/10.18653\/V1\/2020.EMNLP-MAIN.596,","DOI":"10.18653\/V1\/2020.EMNLP-MAIN.596"},{"key":"2106_CR65","doi-asserted-by":"crossref","unstructured":"Gardner M, Talukdar P, Krishnamurthy J et\u00a0al (2014) Incorporating vector space similarity in random walk inference over knowledge bases. In: Proceedings of the 2014 conference on empirical methods in natural language processing (EMNLP), pp 397\u2013406","DOI":"10.3115\/v1\/D14-1044"},{"key":"2106_CR66","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/1666420.1666444","volume":"53","author":"C Gentry","year":"2010","unstructured":"Gentry C (2010) Computing arbitrary functions of encrypted data. Commun ACM 53:97\u2013105","journal-title":"Commun ACM"},{"key":"2106_CR67","unstructured":"Gentry C, Boneh D (2009) A fully homomorphic encryption scheme. Stanford University 20(9)"},{"key":"2106_CR68","unstructured":"Geyer RC, Klein T, Nabi M (2017) Differentially private federated learning: a client level perspective. arXiv:1712.07557"},{"key":"2106_CR69","unstructured":"Gilad-Bachrach R, Dowlin N, Laine K et\u00a0al (2016) Cryptonets: applying neural networks to encrypted data with high throughput and accuracy. In: International conference on machine learning. PMLR, pp 201\u2013210"},{"key":"2106_CR70","doi-asserted-by":"crossref","unstructured":"Gondree M, Mohassel P (2009) Longest common subsequence as private search. In: Proceedings of the 8th ACM workshop on Privacy in the electronic society, pp 81\u201390","DOI":"10.1145\/1655188.1655200"},{"key":"2106_CR71","doi-asserted-by":"crossref","unstructured":"Guan S, Jin X, Wang Y et\u00a0al (2018) Shared embedding based neural networks for knowledge graph completion. In: Proceedings of the 27th ACM international conference on information and knowledge management, pp 247\u2013256","DOI":"10.1145\/3269206.3271704"},{"key":"2106_CR72","doi-asserted-by":"crossref","unstructured":"Guo S, Wang Q, Wang L et\u00a0al (2016) Jointly embedding knowledge graphs and logical rules. In: Proceedings of the 2016 conference on empirical methods in natural language processing, pp 192\u2013202","DOI":"10.18653\/v1\/D16-1019"},{"key":"2106_CR73","unstructured":"Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: Advances in neural information processing systems, pp 1024\u20131034"},{"key":"2106_CR74","doi-asserted-by":"crossref","unstructured":"Han X, Liu Z, Sun M (2018) Neural knowledge acquisition via mutual attention between knowledge graph and text. In: Thirty-second AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v32i1.11927"},{"key":"2106_CR75","unstructured":"Harris S, Gibbins N (2003) 3store: efficient bulk rdf storage. In: International workshop on practical and scalable semantic systems"},{"issue":"4","key":"2106_CR76","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad J, Impagliazzo R, Levin LA et al (1999) A pseudorandom generator from any one-way function. SIAM J Comput 28(4):1364\u20131396","journal-title":"SIAM J Comput"},{"key":"2106_CR77","unstructured":"He C, Balasubramanian K, Ceyani E et\u00a0al (2021) Fedgraphnn: a federated learning system and benchmark for graph neural networks. CoRR arXiv: 2104.07145"},{"key":"2106_CR78","unstructured":"He X (2011) Privacy preserving analysis of graph structured data. PhD thesis, Rutgers University-Graduate School-Newark"},{"key":"2106_CR79","doi-asserted-by":"crossref","unstructured":"He X, Shafiq B, Vaidya J et\u00a0al (2008) Privacy-preserving link discovery. In: SAC \u201908","DOI":"10.1145\/1363686.1363895"},{"key":"2106_CR80","unstructured":"Hoffmann R, Zhang C, Ling X et\u00a0al (2011) Knowledge-based weak supervision for information extraction of overlapping relations. In: Proceedings of the 49th annual meeting of the association for computational linguistics: human language technologies, pp 541\u2013550"},{"key":"2106_CR81","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1109\/TBDATA.2022.3205705","volume":"9","author":"W Huang","year":"2022","unstructured":"Huang W, Liu J, Li T et al (2022) Fedcke: cross-domain knowledge graph embedding in federated learning. IEEE Trans Big Data 9:792\u2013804","journal-title":"IEEE Trans Big Data"},{"key":"2106_CR82","doi-asserted-by":"crossref","unstructured":"Huang X, Zhang J, Li D et\u00a0al (2019) Knowledge graph embedding based question answering. In: Proceedings of the twelfth ACM international conference on web search and data mining, pp 105\u2013113","DOI":"10.1145\/3289600.3290956"},{"key":"2106_CR83","unstructured":"Huang Y, Evans D, Katz J (2012) Private set intersection: are garbled circuits better than custom protocols? In: NDSS"},{"key":"2106_CR84","unstructured":"Huang Z, Lu W, Hong C et\u00a0al (2022) Cheetah: lean and fast secure two-party deep neural network inference. In: Butler KRB, Thomas K (eds) 31st USENIX security symposium, USENIX Security 2022, Boston, MA, USA, August 10\u201312, 2022. USENIX Association, pp 809\u2013826. https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/huang-zhicong"},{"key":"2106_CR85","unstructured":"Huang Z, Lu Wj, Hong C et\u00a0al (2022) Cheetah: lean and fast secure $$\\{$$two-party$$\\}$$ deep neural network inference. In: 31st USENIX security symposium (USENIX Security 22), pp 809\u2013826"},{"key":"2106_CR86","unstructured":"Igamberdiev T, Habernal I (2021) Privacy-preserving graph convolutional networks for text classification. LREC 2022"},{"key":"2106_CR87","doi-asserted-by":"crossref","unstructured":"Ishai Y, Prabhakaran M, Sahai A (2008) Founding cryptography on oblivious transfer-efficiently. In: Advances in cryptology\u2014CRYPTO 2008: 28th annual international cryptology conference, Santa Barbara, CA, USA, August 17\u201321, 2008. Proceedings 28. Springer, pp 572\u2013591","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"2106_CR88","unstructured":"Jenatton R, Roux NL, Bordes A et\u00a0al (2012) A latent factor model for highly multi-relational data. In: Advances in neural information processing systems, pp 3167\u20133175"},{"issue":"2","key":"2106_CR89","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1109\/TNNLS.2021.3070843","volume":"33","author":"S Ji","year":"2022","unstructured":"Ji S, Pan S, Cambria E et al (2022) A survey on knowledge graphs: representation, acquisition, and applications. IEEE Trans Neural Netw Learn Syst 33(2):494\u2013514. https:\/\/doi.org\/10.1109\/TNNLS.2021.3070843","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"2106_CR90","unstructured":"Juvekar C, Vaikuntanathan V, Chandrakasan A (2018) $$\\{$$GAZELLE$$\\}$$: a low latency framework for secure neural network inference. In: 27th USENIX security symposium (USENIX Security 18), pp 1651\u20131669"},{"issue":"1\u20132","key":"2106_CR91","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000083","volume":"14","author":"P Kairouz","year":"2021","unstructured":"Kairouz P, McMahan HB, Avent B et al (2021) Advances and open problems in federated learning. Found Trends Mach Learn 14(1\u20132):1\u2013210. https:\/\/doi.org\/10.1561\/2200000083","journal-title":"Found Trends Mach Learn"},{"key":"2106_CR92","first-page":"222","volume":"2015","author":"A Kiayias","year":"2015","unstructured":"Kiayias A, Leonardos N, Lipmaa H et al (2015) Optimal rate private information retrieval from homomorphic encryption. Proc Priv Enhanc Technol 2015:222\u2013243","journal-title":"Proc Priv Enhanc Technol"},{"key":"2106_CR93","unstructured":"Kipf TN, Welling M (2017) Semi-supervised classification with graph convolutional networks. In: 5th international conference on learning representations, ICLR 2017, Toulon, France, April 24\u201326, 2017, conference track proceedings. OpenReview.net. https:\/\/openreview.net\/forum?id=SJU4ayYgl"},{"key":"2106_CR94","unstructured":"Koncel-Kedziorski R, Bekal D, Luan Y et\u00a0al (2019) Text generation from knowledge graphs with graph transformers. arXiv:1904.02342"},{"key":"2106_CR95","doi-asserted-by":"crossref","unstructured":"Lai S, Yuan X, Sun SF et\u00a0al (2019) Graphse$$^2$$: an encrypted graph database for privacy-preserving social search. In: Proceedings of the 2019 ACM Asia conference on computer and communications security, pp 41\u201354","DOI":"10.1145\/3321705.3329803"},{"issue":"1","key":"2106_CR96","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10994-010-5205-8","volume":"81","author":"N Lao","year":"2010","unstructured":"Lao N, Cohen WW (2010) Relational retrieval using a combination of path-constrained random walks. Mach Learn 81(1):53\u201367","journal-title":"Mach Learn"},{"key":"2106_CR97","unstructured":"Le Q, Mikolov T (2014) Distributed representations of sentences and documents. In: International conference on machine learning, pp 1188\u20131196"},{"key":"2106_CR98","doi-asserted-by":"crossref","unstructured":"Li Q, Huang Z, Lu W et\u00a0al (2020) Homopai: a secure collaborative machine learning platform based on homomorphic encryption. In: 2020 IEEE 36th international conference on data engineering (ICDE). IEEE, pp 1713\u20131717","DOI":"10.1109\/ICDE48307.2020.00152"},{"key":"2106_CR99","unstructured":"Li Y, Tarlow D, Brockschmidt M et\u00a0al (2015) Gated graph sequence neural networks. arXiv:1511.05493"},{"key":"2106_CR100","doi-asserted-by":"crossref","unstructured":"Lin Y, Liu Z, Sun M et\u00a0al (2015) Learning entity and relation embeddings for knowledge graph completion. In: Twenty-ninth AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"2106_CR101","doi-asserted-by":"crossref","unstructured":"Lin Z, Pan W, Ming Z (2021) Fr-fmss: federated recommendation via fake marks and secret sharing. In: Fifteenth ACM conference on recommender systems, pp 668\u2013673","DOI":"10.1145\/3460231.3478855"},{"issue":"1","key":"2106_CR102","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1145\/3387108","volume":"64","author":"Y Lindell","year":"2020","unstructured":"Lindell Y (2020) Secure multiparty computation. Commun ACM 64(1):86\u201396","journal-title":"Commun ACM"},{"key":"2106_CR103","unstructured":"Liu Y, Chen C, Zheng L et al (2020) Privacy preserving PCA for multiparty modeling. arXiv:2002.02091"},{"key":"2106_CR104","doi-asserted-by":"crossref","unstructured":"Liu Y, Wan Y, He L et\u00a0al (2021) Kg-bart: knowledge graph-augmented bart for generative commonsense reasoning. In: Proceedings of the AAAI conference on artificial intelligence, pp 6418\u20136425","DOI":"10.1609\/aaai.v35i7.16796"},{"key":"2106_CR105","doi-asserted-by":"crossref","unstructured":"Liu Z, Chen C, Yang X et\u00a0al (2018) Heterogeneous graph neural networks for malicious account detection. In: Proceedings of the 27th ACM international conference on information and knowledge management, pp 2077\u20132085","DOI":"10.1145\/3269206.3272010"},{"key":"2106_CR106","doi-asserted-by":"crossref","unstructured":"Liu Z, Chen C, Li L et\u00a0al (2019) Geniepath: graph neural networks with adaptive receptive paths. In: Proceedings of the AAAI conference on artificial intelligence, pp 4424\u20134431","DOI":"10.1609\/aaai.v33i01.33014424"},{"issue":"4","key":"2106_CR107","first-page":"1","volume":"13","author":"Z Liu","year":"2022","unstructured":"Liu Z, Yang L, Fan Z et al (2022) Federated social recommendation with graph neural network. ACM Trans Intell Syst Technol (TIST) 13(4):1\u201324","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"key":"2106_CR108","doi-asserted-by":"crossref","unstructured":"Logan\u00a0IV RL, Liu NF, Peters ME et\u00a0al (2019) Barack\u2019s wife Hillary: using knowledge-graphs for fact-aware language modeling. In: ACL, pp 5962\u20135971","DOI":"10.18653\/v1\/P19-1598"},{"key":"2106_CR109","doi-asserted-by":"crossref","first-page":"104292","DOI":"10.1016\/j.jbi.2023.104292","volume":"138","author":"M Lu","year":"2023","unstructured":"Lu M, Zhang Y, Zhang S et al (2023) Knowledge-aware patient representation learning for multiple disease subtypes. J Biomed Inform 138:104292","journal-title":"J Biomed Inform"},{"key":"2106_CR110","unstructured":"Ma J, Zheng Y, Feng J et\u00a0al (2023) Secretflow-spu: a performant and user-friendly framework for privacy-preserving machine learning. In: Lawall J, Williams D (eds) 2023 USENIX annual technical conference, USENIX ATC 2023, Boston, MA, USA, July 10\u201312, 2023. USENIX Association, pp 17\u201333. https:\/\/www.usenix.org\/conference\/atc23\/presentation\/ma"},{"key":"2106_CR111","doi-asserted-by":"crossref","unstructured":"Malaviya C, Bhagavatula C, Bosselut A et\u00a0al (2020) Commonsense knowledge base completion with structural and semantic context. In: Proceedings of the AAAI conference on artificial intelligence, pp 2925\u20132933","DOI":"10.1609\/aaai.v34i03.5684"},{"key":"2106_CR112","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez C, Valiente G (1997) An algorithm for graph pattern-matching. In: Proceedings of Fourth South American workshop on string processing, pp 180\u2013197","DOI":"10.1515\/9780773591400-017"},{"key":"2106_CR113","unstructured":"McMahan B, Moore E, Ramage D et\u00a0al (2017) Communication-efficient learning of deep networks from decentralized data. In: Artificial intelligence and statistics. PMLR, pp 1273\u20131282"},{"key":"2106_CR114","unstructured":"Mehta H, Thakurta AG, Kurakin A et\u00a0al (2023) Towards large scale transfer learning for differentially private image classification. Trans Mach Learn Res 2023. https:\/\/openreview.net\/forum?id=Uu8WwCFpQv"},{"key":"2106_CR115","doi-asserted-by":"crossref","unstructured":"Meng C, Rambhatla S, Liu Y (2021) Cross-node federated graph neural network for spatio-temporal data modeling. In: SIGKDD, pp 1202\u20131211","DOI":"10.1145\/3447548.3467371"},{"key":"2106_CR116","doi-asserted-by":"crossref","unstructured":"Mennicke S, Kalo JC, Nagel D et\u00a0al (2019) Fast dual simulation processing of graph database queries. In: 2019 IEEE 35th international conference on data engineering (ICDE), pp 244\u2013255","DOI":"10.1109\/ICDE.2019.00030"},{"key":"2106_CR117","doi-asserted-by":"crossref","unstructured":"Meyer LP, Stadler C, Frey J et al (2023) LLM-assisted knowledge graph engineering: experiments with ChatGPT. AI-Tomorrow-23","DOI":"10.1007\/978-3-658-43705-3_8"},{"key":"2106_CR118","unstructured":"Mikolov T, Sutskever I, Chen K et\u00a0al (2013) Distributed representations of words and phrases and their compositionality. In: Advances in neural information processing systems, pp 3111\u20133119"},{"issue":"11","key":"2106_CR119","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/219717.219748","volume":"38","author":"GA Miller","year":"1995","unstructured":"Miller GA (1995) Wordnet: a lexical database for English. Commun ACM 38(11):39\u201341","journal-title":"Commun ACM"},{"key":"2106_CR120","doi-asserted-by":"crossref","unstructured":"Mohassel P, Zhang Y (2017) Secureml: a system for scalable privacy-preserving machine learning. In: 2017 IEEE symposium on security and privacy (SP). IEEE, pp 19\u201338","DOI":"10.1109\/SP.2017.12"},{"key":"2106_CR121","doi-asserted-by":"publisher","first-page":"414","DOI":"10.2478\/popets-2020-0080","volume":"4","author":"P Mohassel","year":"2020","unstructured":"Mohassel P, Rosulek M, Trieu N (2020) Practical privacy-preserving k-means clustering. Proc Priv Enhanc Technol 4:414\u2013433. https:\/\/doi.org\/10.2478\/popets-2020-0080","journal-title":"Proc Priv Enhanc Technol"},{"key":"2106_CR122","doi-asserted-by":"crossref","unstructured":"Moon C, Jones P, Samatova NF (2017) Learning entity type embeddings for knowledge graph completion. In: Proceedings of the 2017 ACM on conference on information and knowledge management, pp 2215\u20132218","DOI":"10.1145\/3132847.3133095"},{"key":"2106_CR123","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1162\/tacl_a_00179","volume":"2","author":"A Moro","year":"2014","unstructured":"Moro A, Raganato A, Navigli R (2014) Entity linking meets word sense disambiguation: a unified approach. Trans Assoc Comput Linguist 2:231\u2013244","journal-title":"Trans Assoc Comput Linguist"},{"key":"2106_CR124","doi-asserted-by":"crossref","unstructured":"Nathani D, Chauhan J, Sharma C et\u00a0al (2019) Learning attention-based embeddings for relation prediction in knowledge graphs. In: Proceedings of the 57th annual meeting of the Association for Computational Linguistics, pp 4710\u20134723","DOI":"10.18653\/v1\/P19-1466"},{"key":"2106_CR125","doi-asserted-by":"publisher","unstructured":"Neelakantan A, Roth B, McCallum A (2015) Compositional vector space models for knowledge base completion. In: Proceedings of the 53rd annual meeting of the Association for Computational Linguistics and the 7th international joint conference on natural language processing of the Asian Federation of Natural Language Processing, ACL 2015, July 26\u201331, 2015, Beijing, China, volume 1: long papers. The Association for Computer Linguistics, pp 156\u2013166. https:\/\/doi.org\/10.3115\/v1\/p15-1016","DOI":"10.3115\/v1\/p15-1016"},{"key":"2106_CR126","unstructured":"Nickel M, Tresp V, Kriegel HP (2011) A three-way model for collective learning on multi-relational data. In: Icml, pp 809\u2013816"},{"key":"2106_CR127","doi-asserted-by":"crossref","unstructured":"Nickel M, Rosasco L, Poggio TA et\u00a0al (2016) Holographic embeddings of knowledge graphs. In: AAAI, pp 1955\u20131961","DOI":"10.1609\/aaai.v30i1.10314"},{"key":"2106_CR128","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1109\/TKDE.2019.2941685","volume":"33","author":"PG Omran","year":"2019","unstructured":"Omran PG, Wang K, Wang Z (2019) An embedding-based approach to rule learning in knowledge graphs. IEEE Trans Knowl Data Eng 33:1348\u20131359","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2106_CR129","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: International conference on the theory and applications of cryptographic techniques. Springer, pp 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"2106_CR130","unstructured":"Pan JZ, Razniewski S, Kalo JC et\u00a0al (2023) Large language models and knowledge graphs: opportunities and challenges. arXiv:2308.06374"},{"key":"2106_CR131","unstructured":"Pan S, Luo L, Wang Y et\u00a0al (2023) Unifying large language models and knowledge graphs: a roadmap. arXiv:2306.08302"},{"issue":"1","key":"2106_CR132","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1667067.1667071","volume":"10","author":"H Pang","year":"2010","unstructured":"Pang H, Shen J, Krishnan R (2010) Privacy-preserving similarity-based text retrieval. ACM Trans Internet Technol (TOIT) 10(1):1\u201339","journal-title":"ACM Trans Internet Technol (TOIT)"},{"key":"2106_CR133","unstructured":"Papernot N, Song S, Mironov I et\u00a0al (2018) Scalable private learning with PATE. In: 6th international conference on learning representations, ICLR 2018, Vancouver, BC, Canada, April 30\u2013May 3, 2018, conference track proceedings. OpenReview.net. https:\/\/openreview.net\/forum?id=rkZB1XbRZ"},{"key":"2106_CR134","doi-asserted-by":"crossref","unstructured":"Patel S, Persiano G, Yeo K (2018) Private stateful information retrieval. In: Proceedings of the 2018 ACM SIGSAC conference on computer and communications security","DOI":"10.1145\/3243734.3243821"},{"key":"2106_CR135","doi-asserted-by":"crossref","unstructured":"Peng H, Li H, Song Y et\u00a0al (2021) Differentially private federated knowledge graphs embedding. In: CIKM, pp 1416\u20131425","DOI":"10.1145\/3459637.3482252"},{"issue":"5","key":"2106_CR136","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3447585","volume":"15","author":"H Peng","year":"2021","unstructured":"Peng H, Li J, Song Y et al (2021) Streaming social event detection and evolution discovery in heterogeneous information networks. ACM Trans Knowl Discov Data (TKDD) 15(5):1\u201333","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"issue":"4","key":"2106_CR137","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3490181","volume":"40","author":"H Peng","year":"2021","unstructured":"Peng H, Zhang R, Dou Y et al (2021) Reinforced neighborhood selection guided multi-relational graph neural networks. ACM Trans Inf Syst (TOIS) 40(4):1\u201346","journal-title":"ACM Trans Inf Syst (TOIS)"},{"issue":"1","key":"2106_CR138","doi-asserted-by":"crossref","first-page":"980","DOI":"10.1109\/TPAMI.2022.3144993","volume":"45","author":"H Peng","year":"2022","unstructured":"Peng H, Zhang R, Li S et al (2022) Reinforced, incremental and cross-lingual event detection from social messages. IEEE Trans Pattern Anal Mach Intell 45(1):980\u2013998","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"2106_CR139","doi-asserted-by":"publisher","unstructured":"Petroni F, Rockt\u00e4schel T, Riedel S et\u00a0al (2019) Language models as knowledge bases? In: Proceedings of the 2019 conference on empirical methods in natural language processing and the 9th international joint conference on natural language processing, EMNLP-IJCNLP 2019, Hong Kong, China, November 3\u20137, 2019. Association for Computational Linguistics, pp 2463\u20132473. https:\/\/doi.org\/10.18653\/v1\/D19-1250","DOI":"10.18653\/v1\/D19-1250"},{"issue":"2","key":"2106_CR140","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3154794","volume":"21","author":"B Pinkas","year":"2018","unstructured":"Pinkas B, Schneider T, Zohner M (2018) Scalable private set intersection based on ot extension. ACM Trans Priv Secur (TOPS) 21(2):1\u201335","journal-title":"ACM Trans Priv Secur (TOPS)"},{"key":"2106_CR141","unstructured":"PrudHommeaux E (2008) Sparql query language for rdf. http:\/\/www.w3.org\/TR\/rdf-sparql-query\/"},{"key":"2106_CR142","unstructured":"Rabin MO (2005) How to exchange secrets with oblivious transfer. IACR Cryptol ePrint Arch 2005(187)"},{"key":"2106_CR143","unstructured":"Reich D, Todoki A, Dowsley R et\u00a0al (2019) Privacy-preserving classification of personal text messages with secure multi-party computation. In: Advances in neural information processing systems, pp 3757\u20133769"},{"key":"2106_CR144","doi-asserted-by":"crossref","unstructured":"Ren J, Jiang L, Peng H et\u00a0al (2022) Cross-network social user embedding with hybrid differential privacy guarantees. In: Proceedings of the 31st ACM international conference on information & knowledge management, pp 1685\u20131695","DOI":"10.1145\/3511808.3557278"},{"key":"2106_CR145","doi-asserted-by":"crossref","unstructured":"Riazi MS, Weinert C, Tkachenko O et\u00a0al (2018) Chameleon: a hybrid secure computation framework for machine learning applications. In: Proceedings of the 2018 on Asia conference on computer and communications security, pp 707\u2013721","DOI":"10.1145\/3196494.3196522"},{"key":"2106_CR146","doi-asserted-by":"crossref","unstructured":"Rodriguez MA (2015) The gremlin graph traversal machine and language (invited talk). In: Proceedings of the 15th symposium on database programming languages, pp 1\u201310","DOI":"10.1145\/2815072.2815073"},{"key":"2106_CR147","unstructured":"Sasaki Y, Fletcher G, Onizuka M (2020) Structural indexing for conjunctive path queries. ArXiv: 2003.03079"},{"key":"2106_CR148","doi-asserted-by":"crossref","unstructured":"Schlichtkrull M, Kipf TN, Bloem P et\u00a0al (2018) Modeling relational data with graph convolutional networks. In: European semantic web conference. Springer, pp 593\u2013607","DOI":"10.1007\/978-3-319-93417-4_38"},{"issue":"11","key":"2106_CR149","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Commun ACM 22(11):612\u2013613","journal-title":"Commun ACM"},{"key":"2106_CR150","doi-asserted-by":"crossref","unstructured":"Shaneck M, Kim Y, Kumar V (2009) Privacy preserving nearest neighbor search. In: Machine learning in cyber trust. Springer, pp 247\u2013276","DOI":"10.1007\/978-0-387-88735-7_10"},{"key":"2106_CR151","doi-asserted-by":"crossref","unstructured":"Shang C, Tang Y, Huang J et\u00a0al (2019) End-to-end structure-aware convolutional networks for knowledge base completion. In: Proceedings of the AAAI conference on artificial intelligence, pp 3060\u20133067","DOI":"10.1609\/aaai.v33i01.33013060"},{"key":"2106_CR152","doi-asserted-by":"crossref","unstructured":"Sharma S, Powers J, Chen K (2016) Privacy-preserving spectral analysis of large graphs in public clouds. In: Proceedings of the 11th ACM on Asia conference on computer and communications security, pp 71\u201382","DOI":"10.1145\/2897845.2897857"},{"issue":"2","key":"2106_CR153","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1109\/TKDE.2014.2327028","volume":"27","author":"W Shen","year":"2014","unstructured":"Shen W, Wang J, Han J (2014) Entity linking with a knowledge base: Issues, techniques, and solutions. IEEE Trans Knowl Data Eng 27(2):443\u2013460","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2106_CR154","doi-asserted-by":"crossref","unstructured":"Shi B, Weninger T (2016) Proje: embedding projection for knowledge graph completion. arXiv:1611.05425","DOI":"10.1609\/aaai.v31i1.10677"},{"key":"2106_CR155","doi-asserted-by":"crossref","unstructured":"Shi B, Weninger T (2018) Open-world knowledge graph completion. Association for the Advancement of Artificial Intelligence","DOI":"10.1609\/aaai.v32i1.11535"},{"key":"2106_CR156","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1587\/transinf.2017FCP0005","volume":"101\u2013D","author":"T Shoudai","year":"2018","unstructured":"Shoudai T, Yoshimura Y, Suzuki Y et al (2018) Polynomial time learnability of graph pattern languages defined by cographs. IEICE Trans Inf Syst 101\u2013D:582\u2013592","journal-title":"IEICE Trans Inf Syst"},{"key":"2106_CR157","unstructured":"Socher R, Chen D, Manning CD et\u00a0al (2013) Reasoning with neural tensor networks for knowledge base completion. In: Advances in neural information processing systems, pp 926\u2013934"},{"key":"2106_CR158","doi-asserted-by":"crossref","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. IEEE, pp 44\u201355","DOI":"10.1109\/SECPRI.2000.848445"},{"key":"2106_CR159","doi-asserted-by":"crossref","unstructured":"Speer R, Chin J, Havasi C (2017) Conceptnet 5.5: an open multilingual graph of general knowledge. In: Proceedings of the AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v31i1.11164"},{"key":"2106_CR160","unstructured":"Sun J, Xu C, Tang L et\u00a0al (2023) Think-on-graph: deep and responsible reasoning of large language model with knowledge graph. arXiv:2307.07697"},{"key":"2106_CR161","doi-asserted-by":"crossref","unstructured":"Sun Z, Hu W, Li C (2017) Cross-lingual entity alignment via joint attribute-preserving embedding. In: International semantic web conference. Springer, pp 628\u2013644","DOI":"10.1007\/978-3-319-68288-4_37"},{"key":"2106_CR162","unstructured":"Vashishth S, Sanyal S, Nitin V et\u00a0al (2019) Composition-based multi-relational graph convolutional networks. In: International conference on learning representations"},{"key":"2106_CR163","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A et\u00a0al (2017) Graph attention networks. arXiv:1710.10903"},{"key":"2106_CR164","unstructured":"Vepakomma P, Gupta O, Swedish T et\u00a0al (2018) Split learning for health: distributed deep learning without sharing raw patient data. arXiv:1812.00564"},{"key":"2106_CR165","doi-asserted-by":"crossref","unstructured":"Vidal ME, Ruckhaus E, Lampo T et\u00a0al (2010) Efficiently joining group patterns in sparql queries. In: ESWC","DOI":"10.1007\/978-3-642-13486-9_16"},{"issue":"10","key":"2106_CR166","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/2629489","volume":"57","author":"D Vrande\u010di\u0107","year":"2014","unstructured":"Vrande\u010di\u0107 D, Kr\u00f6tzsch M (2014) Wikidata: a free collaborative knowledgebase. Commun ACM 57(10):78\u201385","journal-title":"Commun ACM"},{"key":"2106_CR167","doi-asserted-by":"publisher","first-page":"26","DOI":"10.2478\/popets-2019-0035","volume":"3","author":"S Wagh","year":"2019","unstructured":"Wagh S, Gupta D, Chandran N (2019) Securenn: 3-party secure computation for neural network training. Proc Priv Enhanc Technol 3:26\u201349. https:\/\/doi.org\/10.2478\/popets-2019-0035","journal-title":"Proc Priv Enhanc Technol"},{"key":"2106_CR168","doi-asserted-by":"crossref","unstructured":"Wang D, Lin J, Cui P et\u00a0al (2019) A semi-supervised graph attentive network for financial fraud detection. In: 2019 IEEE international conference on data mining (ICDM). IEEE, pp 598\u2013607","DOI":"10.1109\/ICDM.2019.00070"},{"issue":"12","key":"2106_CR169","doi-asserted-by":"crossref","first-page":"2724","DOI":"10.1109\/TKDE.2017.2754499","volume":"29","author":"Q Wang","year":"2017","unstructured":"Wang Q, Mao Z, Wang B et al (2017) Knowledge graph embedding: a survey of approaches and applications. IEEE Trans Knowl Data Eng 29(12):2724\u20132743","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2106_CR170","doi-asserted-by":"crossref","unstructured":"Wang X, He X, Cao Y et\u00a0al (2019) Kgat: knowledge graph attention network for recommendation. In: Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining, pp 950\u2013958","DOI":"10.1145\/3292500.3330989"},{"key":"2106_CR171","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1162\/tacl_a_00360","volume":"9","author":"X Wang","year":"2021","unstructured":"Wang X, Gao T, Zhu Z et al (2021) Kepler: a unified model for knowledge embedding and pre-trained language representation. Trans Assoc Comput Linguist 9:176\u2013194","journal-title":"Trans Assoc Comput Linguist"},{"key":"2106_CR172","unstructured":"Wang X, Yang Q, Qiu Y et\u00a0al (2023) Knowledgpt: enhancing large language models with retrieval and storage access on knowledge bases. arXiv:2308.11761"},{"key":"2106_CR173","doi-asserted-by":"crossref","unstructured":"Wang Y, Gemulla R, Li H (2018) On multi-relational link prediction with bilinear models. In: AAAI, pp 4227\u20134234","DOI":"10.1609\/aaai.v32i1.11738"},{"key":"2106_CR174","doi-asserted-by":"crossref","unstructured":"Wei Y, Fu X, Sun Q et\u00a0al (2022) Heterogeneous graph neural network for privacy-preserving recommendation. In: 2022 IEEE international conference on data mining (ICDM). IEEE, pp 528\u2013537","DOI":"10.1109\/ICDM54844.2022.00063"},{"key":"2106_CR175","unstructured":"Wilkinson K, Wilkinson K (2006) Jena property table implementation"},{"key":"2106_CR176","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1145\/2206869.2206879","volume":"41","author":"PT Wood","year":"2012","unstructured":"Wood PT (2012) Query languages for graph databases. SIGMOD Rec 41:50\u201360","journal-title":"SIGMOD Rec"},{"key":"2106_CR177","doi-asserted-by":"crossref","unstructured":"Wu C, Wu F, Cao Y et\u00a0al (2021) Fedgnn: federated graph neural network for privacy-preserving recommendation. arXiv:2102.04925","DOI":"10.1038\/s41467-022-30714-9"},{"key":"2106_CR178","unstructured":"Xie H, Ma J, Xiong L et\u00a0al (2021) Federated graph classification over non-iid graphs. NeurIPS"},{"key":"2106_CR179","doi-asserted-by":"crossref","unstructured":"Xie X, Zhang N, Li Z et\u00a0al (2022) From discrimination to generation: knowledge graph completion with generative transformer. In: Companion proceedings of the Web conference 2022. Association for Computing Machinery, New York, NY, USA, WWW \u201922, pp 162\u2013165","DOI":"10.1145\/3487553.3524238"},{"key":"2106_CR180","doi-asserted-by":"crossref","unstructured":"Xu C, Li R (2019) Relation embedding with dihedral group in knowledge graph. In: Proceedings of the 57th annual meeting of the Association for Computational Linguistics, pp 263\u2013272","DOI":"10.18653\/v1\/P19-1026"},{"key":"2106_CR181","doi-asserted-by":"crossref","unstructured":"Xu D, Xu T, Wu S et\u00a0al (2022) Relation-enhanced negative sampling for multimodal knowledge graph completion. In: Proceedings of the 30th ACM international conference on multimedia, pp 3857\u20133866","DOI":"10.1145\/3503161.3548388"},{"key":"2106_CR182","unstructured":"Xue Y, Yuan Y, Xu Z et\u00a0al (2018) Expanding holographic embeddings for knowledge completion. In: Advances in neural information processing systems, pp 4491\u20134501"},{"issue":"2","key":"2106_CR183","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3298981","volume":"10","author":"Q Yang","year":"2019","unstructured":"Yang Q, Liu Y, Chen T et al (2019) Federated machine learning: concept and applications. ACM Trans Intell Syst Technol (TIST) 10(2):1\u201319","journal-title":"ACM Trans Intell Syst Technol (TIST)"},{"key":"2106_CR184","doi-asserted-by":"crossref","unstructured":"Yao ACC (1986) How to generate and exchange secrets. In: 27th annual symposium on foundations of computer science. IEEE, pp 162\u2013167","DOI":"10.1109\/SFCS.1986.25"},{"key":"2106_CR185","first-page":"37309","volume":"35","author":"M Yasunaga","year":"2022","unstructured":"Yasunaga M, Bosselut A, Ren H et al (2022) Deep bidirectional language-knowledge graph pretraining. Adv Neural Inf Process Syst 35:37309\u201337323","journal-title":"Adv Neural Inf Process Syst"},{"key":"2106_CR186","doi-asserted-by":"publisher","unstructured":"Zhang K, Wang Y, Wang H et\u00a0al (2022) Efficient federated learning on knowledge graphs via privacy-preserving relation embedding aggregation. In: Goldberg Y, Kozareva Z, Zhang Y (eds) Findings of the Association for Computational Linguistics: EMNLP 2022, Abu Dhabi, United Arab Emirates, December 7\u201311, 2022. Association for Computational Linguistics, pp 613\u2013621. https:\/\/doi.org\/10.18653\/V1\/2022.FINDINGS-EMNLP.43","DOI":"10.18653\/V1\/2022.FINDINGS-EMNLP.43"},{"key":"2106_CR187","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2023.3325484","author":"R Zhang","year":"2023","unstructured":"Zhang R, Su Y, Trisedya BD et al (2023) Autoalign: fully automatic and effective knowledge graph alignment enabled by large language models. IEEE Trans Knowl Data Eng. https:\/\/doi.org\/10.1109\/TKDE.2023.3325484","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2106_CR188","unstructured":"Zhang W, Su J, Tan CL et\u00a0al (2010) Entity linking leveraging automatically generated annotation. In: Proceedings of the 23rd international conference on computational linguistics (Coling 2010), pp 1290\u20131298"},{"key":"2106_CR189","doi-asserted-by":"crossref","unstructured":"Zhang W, Paudel B, Zhang W et\u00a0al (2019) Interaction embeddings for prediction and explanation in knowledge graphs. In: Proceedings of the twelfth ACM international conference on web search and data mining, pp 96\u2013104","DOI":"10.1145\/3289600.3291014"},{"key":"2106_CR190","doi-asserted-by":"crossref","unstructured":"Zhang Y, Dai H, Kozareva Z et\u00a0al (2018) Variational reasoning for question answering with knowledge graph. In: Thirty-second AAAI conference on artificial intelligence","DOI":"10.1609\/aaai.v32i1.12057"},{"key":"2106_CR191","doi-asserted-by":"crossref","unstructured":"Zhang Z, Zhuang F, Zhu H et\u00a0al (2020) Relational graph neural network with hierarchical attention for knowledge graph completion. In: Proceedings of the AAAI conference on artificial intelligence, pp 9612\u20139619","DOI":"10.1609\/aaai.v34i05.6508"},{"key":"2106_CR192","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108609","volume":"245","author":"F Zheng","year":"2022","unstructured":"Zheng F, Chen C, Zheng X et al (2022) Towards secure and practical machine learning via secret sharing and random permutation. Knowl Based Syst 245:108609. https:\/\/doi.org\/10.1016\/j.knosys.2022.108609","journal-title":"Knowl Based Syst"},{"key":"2106_CR193","doi-asserted-by":"publisher","unstructured":"Zheng F, Chen C, Lyu L et\u00a0al (2023) Reducing communication for split learning by randomized top-k sparsification. In: Proceedings of the thirty-second international joint conference on artificial intelligence, IJCAI 2023, 19th\u201325th August 2023, Macao, SAR, China. ijcai.org, pp 4665\u20134673. https:\/\/doi.org\/10.24963\/ijcai.2023\/519","DOI":"10.24963\/ijcai.2023\/519"},{"issue":"3","key":"2106_CR194","doi-asserted-by":"crossref","first-page":"1692","DOI":"10.1007\/s12083-021-01074-w","volume":"14","author":"L Zheng","year":"2021","unstructured":"Zheng L, Zhou J, Chen C et al (2021) Asfgnn: automated separated-federated graph neural network. Peer-to-Peer Netw Appl 14(3):1692\u20131704","journal-title":"Peer-to-Peer Netw Appl"},{"key":"2106_CR195","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.neucom.2021.07.098","volume":"465","author":"H Zhu","year":"2021","unstructured":"Zhu H, Xu J, Liu S et al (2021) Federated learning on non-iid data: a survey. Neurocomputing 465:371\u2013390","journal-title":"Neurocomputing"},{"key":"2106_CR196","unstructured":"Zhu L, Liu Z, Han S (2019) Deep leakage from gradients. In: Advances in neural information processing systems 32"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02106-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13042-024-02106-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-024-02106-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T07:33:34Z","timestamp":1719992014000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13042-024-02106-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,2]]},"references-count":196,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2024,8]]}},"alternative-id":["2106"],"URL":"https:\/\/doi.org\/10.1007\/s13042-024-02106-6","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,2]]},"assertion":[{"value":"13 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}