{"id":"https://openalex.org/W2048151401","doi":"https://doi.org/10.1145/2539150.2539215","title":"Sensitive and Neighborhood Privacy on Shortest Paths in the Cloud","display_name":"Sensitive and Neighborhood Privacy on Shortest Paths in the Cloud","publication_year":2013,"publication_date":"2013-12-02","ids":{"openalex":"https://openalex.org/W2048151401","doi":"https://doi.org/10.1145/2539150.2539215","mag":"2048151401"},"language":"en","primary_location":{"id":"doi:10.1145/2539150.2539215","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2539150.2539215","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of International Conference on Information Integration and Web-based Applications & Services","raw_type":"proceedings-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/A5051734633","display_name":"Shyue-Liang Wang","orcid":"https://orcid.org/0000-0001-9197-4350"},"institutions":[{"id":"https://openalex.org/I192168892","display_name":"National University of Kaohsiung","ror":"https://ror.org/013zjb662","country_code":"TW","type":"education","lineage":["https://openalex.org/I192168892"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Shyue-Liang Wang","raw_affiliation_strings":["Department of Information Management, National University of Kaohsiung"],"affiliations":[{"raw_affiliation_string":"Department of Information Management, National University of Kaohsiung","institution_ids":["https://openalex.org/I192168892"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100362822","display_name":"Jiawei Chen","orcid":"https://orcid.org/0000-0002-8195-1582"},"institutions":[{"id":"https://openalex.org/I192168892","display_name":"National University of Kaohsiung","ror":"https://ror.org/013zjb662","country_code":"TW","type":"education","lineage":["https://openalex.org/I192168892"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Jia-Wei Chen","raw_affiliation_strings":["Department of Information Management, National University of Kaohsiung"],"affiliations":[{"raw_affiliation_string":"Department of Information Management, National University of Kaohsiung","institution_ids":["https://openalex.org/I192168892"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004721205","display_name":"I\u2010Hsien Ting","orcid":"https://orcid.org/0000-0002-6587-2438"},"institutions":[{"id":"https://openalex.org/I192168892","display_name":"National University of Kaohsiung","ror":"https://ror.org/013zjb662","country_code":"TW","type":"education","lineage":["https://openalex.org/I192168892"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"I-Hsien Ting","raw_affiliation_strings":["Department of Information Management, National University of Kaohsiung"],"affiliations":[{"raw_affiliation_string":"Department of Information Management, National University of Kaohsiung","institution_ids":["https://openalex.org/I192168892"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057105630","display_name":"Tzung\u2010Pei Hong","orcid":"https://orcid.org/0000-0001-7305-6492"},"institutions":[{"id":"https://openalex.org/I192168892","display_name":"National University of Kaohsiung","ror":"https://ror.org/013zjb662","country_code":"TW","type":"education","lineage":["https://openalex.org/I192168892"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Tzung-Pei Hong","raw_affiliation_strings":["Dept. of Computer Science and Information Engineering, National University of Kaohsiung","[Department of Computer Science and Information Engineering, National University of Kaohsiung]"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Information Engineering, National University of Kaohsiung","institution_ids":["https://openalex.org/I192168892"]},{"raw_affiliation_string":"[Department of Computer Science and Information Engineering, National University of Kaohsiung]","institution_ids":["https://openalex.org/I192168892"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5051734633"],"corresponding_institution_ids":["https://openalex.org/I192168892"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08675914,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"555","last_page":"559"},"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.9998000264167786,"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.9998000264167786,"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.9991999864578247,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9955000281333923,"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.8173379898071289},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7410550117492676},{"id":"https://openalex.org/keywords/cloud-computing","display_name":"Cloud computing","score":0.6484998464584351},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6271088123321533},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5200785994529724},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.476174533367157},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4471641778945923},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.44292333722114563},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43338656425476074},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4243188202381134},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3803223669528961},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3008609414100647},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20089399814605713}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8173379898071289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7410550117492676},{"id":"https://openalex.org/C79974875","wikidata":"https://www.wikidata.org/wiki/Q483639","display_name":"Cloud computing","level":2,"score":0.6484998464584351},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6271088123321533},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5200785994529724},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.476174533367157},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4471641778945923},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.44292333722114563},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43338656425476074},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4243188202381134},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3803223669528961},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3008609414100647},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20089399814605713},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2539150.2539215","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2539150.2539215","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of International Conference on Information Integration and Web-based Applications & Services","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6600000262260437,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1495267192","https://openalex.org/W1516134969","https://openalex.org/W1587629899","https://openalex.org/W1980683432","https://openalex.org/W1991514581","https://openalex.org/W1998091733","https://openalex.org/W2009448154","https://openalex.org/W2072485026","https://openalex.org/W2096296626","https://openalex.org/W2124849257","https://openalex.org/W2128558301","https://openalex.org/W2138682683"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2347245430","https://openalex.org/W4293054712","https://openalex.org/W2391130892","https://openalex.org/W4200172719","https://openalex.org/W1617152041","https://openalex.org/W2198982833","https://openalex.org/W2368964068","https://openalex.org/W2562562750","https://openalex.org/W2597144308"],"abstract_inverted_index":{"Efficient":[0],"shortest":[1,41,83,89,100,131],"path":[2,101],"calculation":[3,38],"has":[4,21],"been":[5],"studied":[6],"extensively,":[7],"in":[8,10,17,31,43,91],"particular,":[9],"the":[11,18,32,37,62,92,96,113,136],"distributed":[12],"environment.":[13,94],"However,":[14],"preserving":[15],"privacy":[16,30,120],"cloud":[19,93],"environment":[20],"just":[22],"attracted":[23],"latest":[24],"attention.":[25],"To":[26],"preserve":[27],"fixed-pattern":[28],"one-neighborhood":[29,119],"cloud,":[33],"current":[34],"approach":[35,115,140],"requires":[36],"of":[39,98,138],"all-pairs":[40],"paths":[42,55,90],"advance,":[44],"which":[45],"is":[46],"time":[47],"consuming":[48],"for":[49,87,129],"large":[50],"graphs.":[51],"In":[52,71],"addition,":[53],"specific":[54],"that":[56],"are":[57,67,141],"sensitive":[58,88,103,130],"and":[59,64,81,109,126],"require":[60],"hiding":[61],"source":[63],"destination":[65],"vertices":[66],"not":[68,116],"well":[69],"addressed.":[70],"this":[72],"work,":[73],"we":[74],"propose":[75],"a":[76],"new":[77],"flexible":[78],"k-neighborhood":[79],"privacy-protection":[80],"efficient":[82,124],"distance":[84],"computation":[85],"scheme":[86],"Combining":[95],"construction":[97],"k-skip":[99],"sub-graphs,":[102],"vertex":[104,106],"adjustment,":[105],"hierarchy":[107],"labeling":[108],"bottom-up":[110],"partitioning":[111,125],"techniques,":[112],"proposed":[114,139],"only":[117],"subsumes":[118],"but":[121],"also":[122],"provides":[123],"query":[127],"processing":[128],"paths.":[132],"Numerical":[133],"experiments":[134],"demonstrating":[135],"characteristics":[137],"presented.":[142]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}