{"id":"https://openalex.org/W3207689161","doi":"https://doi.org/10.3390/cryptography5040027","title":"Parallel Privacy-Preserving Shortest Path Algorithms","display_name":"Parallel Privacy-Preserving Shortest Path Algorithms","publication_year":2021,"publication_date":"2021-10-14","ids":{"openalex":"https://openalex.org/W3207689161","doi":"https://doi.org/10.3390/cryptography5040027","mag":"3207689161"},"language":"en","primary_location":{"id":"doi:10.3390/cryptography5040027","is_oa":true,"landing_page_url":"https://doi.org/10.3390/cryptography5040027","pdf_url":"https://www.mdpi.com/2410-387X/5/4/27/pdf?version=1636035826","source":{"id":"https://openalex.org/S4210223320","display_name":"Cryptography","issn_l":"2410-387X","issn":["2410-387X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cryptography","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/2410-387X/5/4/27/pdf?version=1636035826","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071676053","display_name":"Mohammad Anagreh","orcid":"https://orcid.org/0000-0001-7037-6562"},"institutions":[{"id":"https://openalex.org/I4210160054","display_name":"Cybernetica (Estonia)","ror":"https://ror.org/054gqc795","country_code":"EE","type":"company","lineage":["https://openalex.org/I4210160054"]},{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Mohammad Anagreh","raw_affiliation_strings":["Cybernetica AS, M\u00e4ealuse 2/1, 12618 Tallinn, Estonia","Institute of Computer Science, University of Tartu, Narva Mnt. 18, 51009 Tartu, Estonia"],"raw_orcid":"https://orcid.org/0000-0001-7037-6562","affiliations":[{"raw_affiliation_string":"Cybernetica AS, M\u00e4ealuse 2/1, 12618 Tallinn, Estonia","institution_ids":["https://openalex.org/I4210160054"]},{"raw_affiliation_string":"Institute of Computer Science, University of Tartu, Narva Mnt. 18, 51009 Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009632286","display_name":"Peeter Laud","orcid":"https://orcid.org/0000-0002-9030-8142"},"institutions":[{"id":"https://openalex.org/I4210160054","display_name":"Cybernetica (Estonia)","ror":"https://ror.org/054gqc795","country_code":"EE","type":"company","lineage":["https://openalex.org/I4210160054"]}],"countries":["EE"],"is_corresponding":true,"raw_author_name":"Peeter Laud","raw_affiliation_strings":["Cybernetica AS, M\u00e4ealuse 2/1, 12618 Tallinn, Estonia"],"raw_orcid":"https://orcid.org/0000-0002-9030-8142","affiliations":[{"raw_affiliation_string":"Cybernetica AS, M\u00e4ealuse 2/1, 12618 Tallinn, Estonia","institution_ids":["https://openalex.org/I4210160054"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034786931","display_name":"Eero Vainikko","orcid":"https://orcid.org/0000-0003-1902-9383"},"institutions":[{"id":"https://openalex.org/I56085075","display_name":"University of Tartu","ror":"https://ror.org/03z77qz90","country_code":"EE","type":"education","lineage":["https://openalex.org/I56085075"]}],"countries":["EE"],"is_corresponding":false,"raw_author_name":"Eero Vainikko","raw_affiliation_strings":["Institute of Computer Science, University of Tartu, Narva Mnt. 18, 51009 Tartu, Estonia"],"raw_orcid":"https://orcid.org/0000-0003-1902-9383","affiliations":[{"raw_affiliation_string":"Institute of Computer Science, University of Tartu, Narva Mnt. 18, 51009 Tartu, Estonia","institution_ids":["https://openalex.org/I56085075"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009632286"],"corresponding_institution_ids":["https://openalex.org/I4210160054"],"apc_list":{"value":1600,"currency":"CHF","value_usd":1732},"apc_paid":{"value":1600,"currency":"CHF","value_usd":1732},"fwci":1.3648,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.84566456,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"5","issue":"4","first_page":"27","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":1.0,"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":1.0,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9990000128746033,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/computer-science","display_name":"Computer science","score":0.8038734197616577},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.6842436194419861},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.6326552629470825},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.6214715838432312},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5895827412605286},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5218076705932617},{"id":"https://openalex.org/keywords/simd","display_name":"SIMD","score":0.4650754928588867},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.4508398473262787},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43985214829444885},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4287633001804352},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4203253984451294},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16948574781417847},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.11407232284545898},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09590676426887512}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8038734197616577},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6842436194419861},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.6326552629470825},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.6214715838432312},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5895827412605286},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5218076705932617},{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.4650754928588867},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.4508398473262787},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43985214829444885},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4287633001804352},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4203253984451294},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16948574781417847},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.11407232284545898},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09590676426887512},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/cryptography5040027","is_oa":true,"landing_page_url":"https://doi.org/10.3390/cryptography5040027","pdf_url":"https://www.mdpi.com/2410-387X/5/4/27/pdf?version=1636035826","source":{"id":"https://openalex.org/S4210223320","display_name":"Cryptography","issn_l":"2410-387X","issn":["2410-387X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cryptography","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:d8b8395b33084563be743aaa3986ae10","is_oa":true,"landing_page_url":"https://doaj.org/article/d8b8395b33084563be743aaa3986ae10","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cryptography, Vol 5, Iss 4, p 27 (2021)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/cryptography5040027","is_oa":true,"landing_page_url":"https://doi.org/10.3390/cryptography5040027","pdf_url":"https://www.mdpi.com/2410-387X/5/4/27/pdf?version=1636035826","source":{"id":"https://openalex.org/S4210223320","display_name":"Cryptography","issn_l":"2410-387X","issn":["2410-387X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cryptography","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W3207689161.pdf"},"referenced_works_count":55,"referenced_works":["https://openalex.org/W147290027","https://openalex.org/W150396298","https://openalex.org/W1485800369","https://openalex.org/W1520270249","https://openalex.org/W1525975689","https://openalex.org/W1550422670","https://openalex.org/W1554802999","https://openalex.org/W1567397627","https://openalex.org/W1967810725","https://openalex.org/W1973582892","https://openalex.org/W1988374166","https://openalex.org/W1997859100","https://openalex.org/W2003668524","https://openalex.org/W2024197950","https://openalex.org/W2027471022","https://openalex.org/W2036133214","https://openalex.org/W2036679956","https://openalex.org/W2040168265","https://openalex.org/W2041416609","https://openalex.org/W2045717693","https://openalex.org/W2047370889","https://openalex.org/W2049533325","https://openalex.org/W2056496054","https://openalex.org/W2057112598","https://openalex.org/W2080911030","https://openalex.org/W2128616365","https://openalex.org/W2134340933","https://openalex.org/W2141420453","https://openalex.org/W2143087446","https://openalex.org/W2143462372","https://openalex.org/W2160321046","https://openalex.org/W2169528473","https://openalex.org/W2174542393","https://openalex.org/W2181401201","https://openalex.org/W2227557434","https://openalex.org/W2237491325","https://openalex.org/W2242625908","https://openalex.org/W2269957429","https://openalex.org/W2497768360","https://openalex.org/W2498296354","https://openalex.org/W2626533970","https://openalex.org/W2795269061","https://openalex.org/W2891965504","https://openalex.org/W3113439565","https://openalex.org/W3132244447","https://openalex.org/W3141585064","https://openalex.org/W3157087073","https://openalex.org/W3194153688","https://openalex.org/W3195448463","https://openalex.org/W4205545369","https://openalex.org/W4248358572","https://openalex.org/W4255390010","https://openalex.org/W4299561649","https://openalex.org/W6749787562","https://openalex.org/W7005186112"],"related_works":["https://openalex.org/W2387223290","https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W143403600","https://openalex.org/W2761711678","https://openalex.org/W3180973535","https://openalex.org/W2170980056","https://openalex.org/W2886722595"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,63],"propose":[4],"and":[5,17,24,35,41,76,79,134,142],"present":[6],"secure":[7],"multiparty":[8],"computation":[9],"(SMC)":[10],"protocols":[11,28,94,126],"for":[12,37,44,131],"single-source":[13],"shortest":[14,19],"distance":[15,20],"(SSSD)":[16],"all-pairs":[18],"(APSD)":[21],"in":[22,85],"sparse":[23],"dense":[25],"graphs.":[26],"Our":[27],"follow":[29],"the":[30,47,70,80,98,106,120],"structure":[31,71],"of":[32,82,97],"classical":[33],"algorithms\u2014Bellman\u2013Ford":[34],"Dijkstra":[36],"SSSD;":[38],"Johnson,":[39],"Floyd\u2013Warshall,":[40],"transitive":[42],"closure":[43],"APSD.":[45],"As":[46],"computational":[48],"platforms":[49],"offered":[50,104],"by":[51,105],"SMC":[52,108],"protocol":[53,102],"sets":[54],"have":[55],"performance":[56,133,137],"profiles":[57],"that":[58],"differ":[59],"from":[60],"typical":[61],"processors,":[62],"had":[64],"to":[65,69,87,118],"perform":[66],"extensive":[67],"changes":[68],"(including":[72],"their":[73],"control":[74],"flow":[75],"memory":[77],"accesses)":[78],"details":[81],"these":[83],"algorithms":[84],"order":[86],"obtain":[88],"good":[89],"performance.":[90],"We":[91,123],"implemented":[92],"our":[93,125,136],"on":[95],"top":[96],"secret":[99],"sharing":[100],"based":[101],"set":[103],"Sharemind":[107],"platform,":[109],"using":[110],"single-instruction-multiple-data":[111],"(SIMD)":[112],"operations":[113],"as":[114,116],"much":[115],"possible":[117],"reduce":[119],"round":[121],"complexity.":[122],"benchmarked":[124],"under":[127],"several":[128],"different":[129],"parameters":[130],"network":[132],"compared":[135],"figures":[138],"against":[139],"each":[140],"other":[141],"with":[143],"ones":[144],"reported":[145],"previously.":[146]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":2}],"updated_date":"2026-05-22T06:13:13.366637","created_date":"2025-10-10T00:00:00"}