{"id":"https://openalex.org/W4376851522","doi":"https://doi.org/10.1109/tdsc.2023.3276360","title":"Privacy-Preserving Graph Matching Query Supporting Quick Subgraph Extraction","display_name":"Privacy-Preserving Graph Matching Query Supporting Quick Subgraph Extraction","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376851522","doi":"https://doi.org/10.1109/tdsc.2023.3276360"},"language":"en","primary_location":{"id":"doi:10.1109/tdsc.2023.3276360","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tdsc.2023.3276360","pdf_url":null,"source":{"id":"https://openalex.org/S133795288","display_name":"IEEE Transactions on Dependable and Secure Computing","issn_l":"1545-5971","issn":["1545-5971","1941-0018","2160-9209"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Dependable and Secure Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076532467","display_name":"Xinrui Ge","orcid":"https://orcid.org/0000-0003-0274-9691"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xinrui Ge","raw_affiliation_strings":["College of Computer Science and Technology, Qingdao University, Qingdao, China"],"raw_orcid":"https://orcid.org/0000-0003-0274-9691","affiliations":[{"raw_affiliation_string":"College of Computer Science and Technology, Qingdao University, Qingdao, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056578494","display_name":"Jia Yu","orcid":"https://orcid.org/0000-0002-0574-7803"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jia Yu","raw_affiliation_strings":["College of Computer Science and Technology, Qingdao University, Qingdao, China"],"raw_orcid":"https://orcid.org/0000-0002-0574-7803","affiliations":[{"raw_affiliation_string":"College of Computer Science and Technology, Qingdao University, Qingdao, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014158729","display_name":"Rong Hao","orcid":"https://orcid.org/0000-0002-2878-6661"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rong Hao","raw_affiliation_strings":["College of Computer Science and Technology, Qingdao University, Qingdao, China"],"raw_orcid":"https://orcid.org/0000-0002-2878-6661","affiliations":[{"raw_affiliation_string":"College of Computer Science and Technology, Qingdao University, Qingdao, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":3.1343,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.93182078,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"21","issue":"3","first_page":"1286","last_page":"1300"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.8268004655838013},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.7067155241966248},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.6935378313064575},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.5984829664230347},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.5898658633232117},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5701679587364197},{"id":"https://openalex.org/keywords/graph-database","display_name":"Graph database","score":0.5672929286956787},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4417503774166107},{"id":"https://openalex.org/keywords/graph-homomorphism","display_name":"Graph homomorphism","score":0.4404476284980774},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42899036407470703},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.42552947998046875},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3598365783691406},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3354220986366272},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.32537633180618286},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.32342517375946045}],"concepts":[{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.8268004655838013},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.7067155241966248},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.6935378313064575},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.5984829664230347},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.5898658633232117},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5701679587364197},{"id":"https://openalex.org/C176225458","wikidata":"https://www.wikidata.org/wiki/Q595971","display_name":"Graph database","level":3,"score":0.5672929286956787},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4417503774166107},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.4404476284980774},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42899036407470703},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.42552947998046875},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3598365783691406},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3354220986366272},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.32537633180618286},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.32342517375946045}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tdsc.2023.3276360","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tdsc.2023.3276360","pdf_url":null,"source":{"id":"https://openalex.org/S133795288","display_name":"IEEE Transactions on Dependable and Secure Computing","issn_l":"1545-5971","issn":["1545-5971","1941-0018","2160-9209"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Dependable and Secure Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.47999998927116394,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G1229659982","display_name":null,"funder_award_id":"2022CXG C020102","funder_id":"https://openalex.org/F4320329857","funder_display_name":"Major Scientific and Technological Innovation Project of Shandong Province"},{"id":"https://openalex.org/G7748622017","display_name":null,"funder_award_id":"62172245","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320329857","display_name":"Major Scientific and Technological Innovation Project of Shandong Province","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1965427702","https://openalex.org/W1983438361","https://openalex.org/W1986770642","https://openalex.org/W2004107885","https://openalex.org/W2036265926","https://openalex.org/W2102415185","https://openalex.org/W2126359798","https://openalex.org/W2146828512","https://openalex.org/W2147405597","https://openalex.org/W2254833717","https://openalex.org/W2354652977","https://openalex.org/W2400905995","https://openalex.org/W2423652555","https://openalex.org/W2613159091","https://openalex.org/W2750225748","https://openalex.org/W2770638201","https://openalex.org/W2914539352","https://openalex.org/W2950424810","https://openalex.org/W2952675638","https://openalex.org/W2954758077","https://openalex.org/W2956647878","https://openalex.org/W3030004290","https://openalex.org/W3046468956","https://openalex.org/W3046847842","https://openalex.org/W3173361933","https://openalex.org/W3174947271","https://openalex.org/W3184859216","https://openalex.org/W3196571345","https://openalex.org/W4205505117","https://openalex.org/W4211037365","https://openalex.org/W4281613391","https://openalex.org/W4313419844","https://openalex.org/W6688927509","https://openalex.org/W6760926680","https://openalex.org/W6797270356"],"related_works":["https://openalex.org/W2953496651","https://openalex.org/W2886672068","https://openalex.org/W2542507283","https://openalex.org/W2393701947","https://openalex.org/W167435155","https://openalex.org/W2252464404","https://openalex.org/W2359640428","https://openalex.org/W2946681422","https://openalex.org/W872425053","https://openalex.org/W3151217588"],"abstract_inverted_index":{"Graph":[0,179],"matching,":[1,31],"as":[2],"one":[3],"of":[4,16,23,29,67,150,156,212,221,235],"the":[5,20,27,37,41,50,75,84,93,102,106,145,154,168,186,197,219,233,236],"most":[6],"fundamental":[7],"problems":[8],"in":[9,110,131,173,223],"graph":[10,24,30,32,45,59,88,109,123,175,191,194,207,239],"database,":[11],"has":[12,90],"a":[13,121,163],"wide":[14],"range":[15],"applications.":[17],"Due":[18],"to":[19,35,40,57,79,91,100,115,143,166,189],"large":[21],"scale":[22],"database":[25,231],"and":[26,176,183],"hardness":[28],"user":[33,89,180],"tends":[34],"outsource":[36],"encrypted":[38,63],"graphs":[39],"cloud.":[42,51],"The":[43,87,209,226],"complex":[44,94],"matching":[46,60,124,146,169,240],"is":[47,204],"performed":[48],"by":[49],"Several":[52],"schemes":[53],"have":[54],"been":[55],"proposed":[56,237],"support":[58],"query":[61,125,177,190,224],"over":[62],"graphs.":[64,157],"However,":[65],"none":[66],"them":[68,151],"can":[69,152,181],"realize":[70],"efficient":[71],"subgraph":[72,77,95,104,129,187,201,213],"extraction":[73,130,214],"when":[74],"matched":[76,107,164,198],"needs":[78],"be":[80],"exactly":[81],"located":[82],"at":[83],"data":[85,108,174,193],"graph.":[86,178,225],"perform":[92],"isomorphism":[96,202],"(NP-complete":[97],"problem)":[98],"operation":[99,147,203],"extract":[101,185],"isomorphic":[103,188],"from":[105,192],"state-of-the-art":[111],"schemes.":[112],"In":[113,134],"order":[114],"solve":[116],"this":[117,132],"problem,":[118],"we":[119],"propose":[120],"privacy-preserving":[122,238],"scheme":[126],"supporting":[127],"quick":[128],"paper.":[133],"our":[135,216],"design,":[136],"two":[137],"non-colluding":[138],"cloud":[139,159],"servers":[140,160],"are":[141],"adopted":[142],"accomplish":[144],"jointly.":[148],"Neither":[149],"infer":[153],"plaintexts":[155],"Two":[158],"jointly":[161],"get":[162],"matrix":[165],"represent":[167],"relationship":[170],"between":[171],"vertices":[172,222],"directly":[182],"quickly":[184],"based":[195],"on":[196],"matrix.":[199],"No":[200],"involved":[205],"for":[206],"user.":[208],"time":[210],"complexity":[211],"is$O(m^{2})$in":[215],"scheme,":[217],"where$m$is":[218],"number":[220],"extensive":[227],"experiments":[228],"with":[229],"real-world":[230],"demonstrate":[232],"efficiency":[234],"scheme.":[241]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":16},{"year":2023,"cited_by_count":2}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}