{"id":"https://openalex.org/W7151263034","doi":"https://doi.org/10.1145/3786695","title":"Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC","display_name":"Scalable Privacy-Preserving Shortest Path Distance Computation via 2-Hop Labeling in MPC","publication_year":2026,"publication_date":"2026-04-02","ids":{"openalex":"https://openalex.org/W7151263034","doi":"https://doi.org/10.1145/3786695"},"language":"en","primary_location":{"id":"doi:10.1145/3786695","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3786695","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","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/A5133084838","display_name":"Huizhong Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Huizhong Wang","raw_affiliation_strings":["The Chinese University of Hong Kong, Shenzhen, Shenzhen, China"],"raw_orcid":"https://orcid.org/0009-0007-2133-5271","affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, China","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047852241","display_name":"Yuanyuan Zeng","orcid":"https://orcid.org/0000-0002-3764-6476"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuanyuan Zeng","raw_affiliation_strings":["The Chinese University of Hong Kong, Shenzhen, Shenzhen, China"],"raw_orcid":"https://orcid.org/0000-0002-3764-6476","affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, China","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133090844","display_name":"Kun Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kun Chen","raw_affiliation_strings":["Ant Group, Beijing, China"],"raw_orcid":"https://orcid.org/0000-0003-2370-5372","affiliations":[{"raw_affiliation_string":"Ant Group, Beijing, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133108872","display_name":"Wei Dong","orcid":null},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Wei Dong","raw_affiliation_strings":["Nanyang Technological University, Singapore, Singapore"],"raw_orcid":"https://orcid.org/0000-0002-0394-4125","affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5133141842","display_name":"Chenhao Ma","orcid":null},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chenhao Ma","raw_affiliation_strings":["The Chinese University of Hong Kong, Shenzhen, Shenzhen, China"],"raw_orcid":"https://orcid.org/0000-0002-3243-8512","affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong, Shenzhen, Shenzhen, China","institution_ids":["https://openalex.org/I4210116924"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"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.38632505,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"4","issue":"1","first_page":"1","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.7843999862670898,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.7843999862670898,"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/T10237","display_name":"Cryptography and Data Security","score":0.07050000131130219,"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.03150000050663948,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6830999851226807},{"id":"https://openalex.org/keywords/differential-privacy","display_name":"Differential privacy","score":0.6676999926567078},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5601999759674072},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5509999990463257},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5166000127792358},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.48339998722076416},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.460099995136261},{"id":"https://openalex.org/keywords/information-privacy","display_name":"Information privacy","score":0.43549999594688416}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7980999946594238},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6830999851226807},{"id":"https://openalex.org/C23130292","wikidata":"https://www.wikidata.org/wiki/Q5275358","display_name":"Differential privacy","level":2,"score":0.6676999926567078},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5942999720573425},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5601999759674072},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5509999990463257},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5166000127792358},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.48339998722076416},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.460099995136261},{"id":"https://openalex.org/C123201435","wikidata":"https://www.wikidata.org/wiki/Q456632","display_name":"Information privacy","level":2,"score":0.43549999594688416},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.37139999866485596},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3659999966621399},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.34369999170303345},{"id":"https://openalex.org/C18396474","wikidata":"https://www.wikidata.org/wiki/Q2465888","display_name":"Secure multi-party computation","level":3,"score":0.33160001039505005},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32120001316070557},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31859999895095825},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.2928999960422516},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2840999960899353},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.2655999958515167},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3786695","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3786695","pdf_url":null,"source":{"id":"https://openalex.org/S4387289859","display_name":"Proceedings of the ACM on Management of Data","issn_l":"2836-6573","issn":["2836-6573"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Management of Data","raw_type":"journal-article"},{"id":"pmh:oai:dr.ntu.edu.sg:10356/215455","is_oa":false,"landing_page_url":"https://hdl.handle.net/10356/215455","pdf_url":null,"source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5665746331214905,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W84835382","https://openalex.org/W125936143","https://openalex.org/W1524288918","https://openalex.org/W1567397627","https://openalex.org/W1965492831","https://openalex.org/W1988374166","https://openalex.org/W1994727615","https://openalex.org/W2005945380","https://openalex.org/W2006453614","https://openalex.org/W2024197950","https://openalex.org/W2027471022","https://openalex.org/W2041416609","https://openalex.org/W2045717693","https://openalex.org/W2080911030","https://openalex.org/W2082773934","https://openalex.org/W2083355299","https://openalex.org/W2155720185","https://openalex.org/W2242625908","https://openalex.org/W2402235285","https://openalex.org/W2538876901","https://openalex.org/W2764587448","https://openalex.org/W2889320527","https://openalex.org/W2946046356","https://openalex.org/W2948227434","https://openalex.org/W3093021001","https://openalex.org/W3141585064","https://openalex.org/W3174212678","https://openalex.org/W3207689161","https://openalex.org/W3214260160","https://openalex.org/W4308361276","https://openalex.org/W4385270481","https://openalex.org/W4401352061","https://openalex.org/W4413844986"],"related_works":[],"abstract_inverted_index":{"Shortest":[0],"distance":[1],"computation":[2,42,67],"is":[3,30],"a":[4,47,98,108,137],"fundamental":[5],"problem":[6],"in":[7,14,107,177],"graph":[8,28,120,129],"data":[9,29],"analysis,":[10],"with":[11,84,105,151],"critical":[12],"applications":[13],"financial":[15],"fraud":[16],"detection,":[17],"website":[18],"ranking,":[19],"and":[20,63,77,180],"social":[21],"network":[22],"analysis.":[23],"In":[24,111,131],"real-world":[25,158],"settings,":[26],"however,":[27],"often":[31],"distributed":[32,58],"across":[33],"multiple":[34],"mutually":[35],"untrusted":[36],"organizations,":[37],"making":[38],"accurate":[39],"shortest":[40],"path":[41],"under":[43],"strict":[44],"privacy":[45,61,145,152,164],"constraints":[46],"major":[48],"challenge.":[49],"Existing":[50],"solutions":[51],"face":[52],"two":[53],"key":[54],"limitations:":[55],"(1)":[56],"traditional":[57],"algorithms":[59],"lack":[60],"protection;":[62],"(2)":[64],"secure":[65],"multi-party":[66],"(MPC)-based":[68],"methods,":[69],"though":[70],"privacy-preserving,":[71],"suffer":[72],"from":[73],"high":[74],"computational":[75],"overhead":[76],"poor":[78],"scalability,":[79],"restricting":[80],"them":[81],"to":[82,122,126,146,167,172,183],"graphs":[83],"only":[85],"tens":[86],"of":[87,89],"thousands":[88],"nodes.":[90],"To":[91],"address":[92],"these":[93],"challenges,":[94],"we":[95],"propose":[96],"PrivHop,":[97],"novel":[99],"algorithm":[100],"that":[101,161],"integrates":[102],"2-hop":[103],"labeling":[104],"MPC":[106],"two-phase":[109],"framework.":[110],"the":[112,132],"offline":[113],"phase,":[114,134],"PrivHop":[115,162],"constructs":[116],"an":[117],"optimized":[118],"boundary":[119,128],"index":[121],"reduce":[123,148],"global":[124],"queries":[125],"small-scale":[127],"queries.":[130],"online":[133],"it":[135],"introduces":[136],"privacy-aware":[138],"dynamic":[139],"pruning":[140],"strategy":[141],"based":[142],"on":[143,156],"differential":[144],"substantially":[147],"iteration":[149],"complexity":[150],"guarantees.":[153],"Extensive":[154],"experiments":[155],"eight":[157],"datasets":[159],"show":[160],"preserves":[163],"while":[165],"scaling":[166],"million-node":[168],"graphs,":[169],"achieving":[170],"up":[171],"10":[173],"6":[174],"x":[175],"reductions":[176],"both":[178],"runtime":[179],"communication":[181],"compared":[182],"state-of-the-art":[184],"methods.":[185]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2026-04-08T00:00:00"}