{"id":"https://openalex.org/W7127040181","doi":"https://doi.org/10.1145/3784833.3784839","title":"A Novel Scheme for Shortest Path Computation and Encrypted Search on Knowledge Graphs","display_name":"A Novel Scheme for Shortest Path Computation and Encrypted Search on Knowledge Graphs","publication_year":2025,"publication_date":"2025-11-12","ids":{"openalex":"https://openalex.org/W7127040181","doi":"https://doi.org/10.1145/3784833.3784839"},"language":null,"primary_location":{"id":"doi:10.1145/3784833.3784839","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3784833.3784839","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 11th International Conference on Communication and Information Processing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3784833.3784839","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5124717164","display_name":"Yue Zhao","orcid":null},"institutions":[{"id":"https://openalex.org/I1302611135","display_name":"Ministry of Public Security of the People's Republic of China","ror":"https://ror.org/00bt9we26","country_code":"CN","type":"government","lineage":["https://openalex.org/I1302611135"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yue Zhao","raw_affiliation_strings":["National Key Laboratory of Security Communication, Chengdu, China"],"raw_orcid":"https://orcid.org/0000-0003-0621-941X","affiliations":[{"raw_affiliation_string":"National Key Laboratory of Security Communication, Chengdu, China","institution_ids":["https://openalex.org/I1302611135"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124712565","display_name":"Jincheng Guo","orcid":null},"institutions":[{"id":"https://openalex.org/I4210102774","display_name":"Tianjin Research Institute of Water Transport Engineering","ror":"https://ror.org/018ha0a04","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210102774","https://openalex.org/I4210127216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jincheng Guo","raw_affiliation_strings":["CCCC Water Transport Planning and Design Institute Co., LTD, Dalian, China"],"raw_orcid":"https://orcid.org/0009-0008-8800-1361","affiliations":[{"raw_affiliation_string":"CCCC Water Transport Planning and Design Institute Co., LTD, Dalian, China","institution_ids":["https://openalex.org/I4210102774"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124726803","display_name":"Zhiqiang Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I4800084","display_name":"Southwest Jiaotong University","ror":"https://ror.org/00hn7w693","country_code":"CN","type":"education","lineage":["https://openalex.org/I4800084"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhiqiang Chen","raw_affiliation_strings":["Southwest Jiaotong University, Chengdu, China"],"raw_orcid":"https://orcid.org/0009-0002-3846-2377","affiliations":[{"raw_affiliation_string":"Southwest Jiaotong University, Chengdu, China","institution_ids":["https://openalex.org/I4800084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124722489","display_name":"Fei Teng","orcid":null},"institutions":[{"id":"https://openalex.org/I4800084","display_name":"Southwest Jiaotong University","ror":"https://ror.org/00hn7w693","country_code":"CN","type":"education","lineage":["https://openalex.org/I4800084"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Fei Teng","raw_affiliation_strings":["Southwest Jiaotong University, Chengdu, China"],"raw_orcid":"https://orcid.org/0000-0001-9535-7245","affiliations":[{"raw_affiliation_string":"Southwest Jiaotong University, Chengdu, China","institution_ids":["https://openalex.org/I4800084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5124742055","display_name":"Yuxiang Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I1302611135","display_name":"Ministry of Public Security of the People's Republic of China","ror":"https://ror.org/00bt9we26","country_code":"CN","type":"government","lineage":["https://openalex.org/I1302611135"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuxiang Chen","raw_affiliation_strings":["National Key Laboratory of Security Communication, Chengdu, China"],"raw_orcid":"https://orcid.org/0000-0002-9963-9554","affiliations":[{"raw_affiliation_string":"National Key Laboratory of Security Communication, Chengdu, China","institution_ids":["https://openalex.org/I1302611135"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5124722612","display_name":"Qingyi Zhu","orcid":null},"institutions":[{"id":"https://openalex.org/I10535382","display_name":"Chongqing University of Posts and Telecommunications","ror":"https://ror.org/03dgaqz26","country_code":"CN","type":"education","lineage":["https://openalex.org/I10535382"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qingyi Zhu","raw_affiliation_strings":["Chongqing University of Posts and Telecommunications, Chognqing, China"],"raw_orcid":"https://orcid.org/0000-0002-1168-1599","affiliations":[{"raw_affiliation_string":"Chongqing University of Posts and Telecommunications, Chognqing, China","institution_ids":["https://openalex.org/I10535382"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":6,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.8077711,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"206","last_page":"211"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.5874999761581421,"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"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.5874999761581421,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.06960000097751617,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.048900000751018524,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7609999775886536},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.57669997215271},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.5170000195503235},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.503600001335144},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4724999964237213},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.39730000495910645},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.3882000148296356},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3828999996185303}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7609999775886536},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6037999987602234},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.57669997215271},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5411999821662903},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.5170000195503235},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.503600001335144},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4724999964237213},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.39730000495910645},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.3882000148296356},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3828999996185303},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.37059998512268066},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36820000410079956},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.357699990272522},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35339999198913574},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3257000148296356},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3061999976634979},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.30059999227523804},{"id":"https://openalex.org/C158154518","wikidata":"https://www.wikidata.org/wiki/Q7310970","display_name":"Relevance (law)","level":2,"score":0.28630000352859497},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.2858000099658966},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.2728999853134155},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2712000012397766},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.258899986743927},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.25220000743865967}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3784833.3784839","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3784833.3784839","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 11th International Conference on Communication and Information Processing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3784833.3784839","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3784833.3784839","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2025 11th International Conference on Communication and Information Processing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1990798894","https://openalex.org/W2101867998","https://openalex.org/W2751806674","https://openalex.org/W3004729682","https://openalex.org/W3082494138","https://openalex.org/W3148981145","https://openalex.org/W3197645854","https://openalex.org/W4382724276","https://openalex.org/W4400120685"],"related_works":[],"abstract_inverted_index":{"The":[0],"paper":[1],"proposes":[2],"an":[3,24,37],"encrypted":[4,25],"knowledge":[5,26],"graph":[6,27],"shortest-path":[7],"computation":[8,120],"scheme":[9,102],"(EKG-SPC),":[10],"which":[11],"supports":[12],"the":[13,16,33,62,76,82,86,98,101,111,114],"calculation":[14],"of":[15,78,100,113],"shortest":[17,63,88,118],"association":[18],"path":[19,64,89,119],"between":[20],"two":[21],"entities":[22],"in":[23],"and":[28,46,92,97,121],"provides":[29],"verification":[30],"capabilities":[31],"for":[32],"computed":[34],"results.":[35,80],"Initially,":[36],"index":[38],"structure":[39],"based":[40,105],"on":[41,106],"adjacency":[42],"lists":[43],"is":[44,58,72,103,124],"designed,":[45],"accumulators":[47],"are":[48,95],"introduced":[49],"to":[50,60,74],"enable":[51],"result":[52],"verification.":[53],"A":[54],"secure":[55],"comparison":[56],"protocol":[57],"employed":[59],"facilitate":[61],"computation.":[65],"Furthermore,":[66],"a":[67],"novel":[68],"keyword-based":[69],"ranking":[70],"mechanism":[71],"integrated":[73],"ensure":[75],"relevance":[77],"search":[79,122],"Subsequently,":[81],"leakage":[83,108],"functions":[84],"during":[85],"construction,":[87],"computation,":[90],"search,":[91],"update":[93],"phases":[94],"analyzed,":[96],"security":[99],"proven":[104],"these":[107],"profiles.":[109],"Finally,":[110],"efficiency":[112],"scheme,":[115],"including":[116],"both":[117],"performance,":[123],"validated":[125],"through":[126],"experiments.":[127]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-03T00:00:00"}