{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T12:01:21Z","timestamp":1747224081801,"version":"3.40.5"},"reference-count":28,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"abstract":"<jats:p>Trust relation in this work refers to permission that is given to a user at a source-host to access another user at a target-host through an authentication key with a unique fingerprint. The database owner can form a directed graph out of these trust relations, such that user-host pairs are considered nodes and fingerprints as arrows. The authors of this article present a novel protocol to query the shortest path from node A to node B, in a privacy preserving manner. The authors would like to use a cloud to perform such queries, but they do not allow the cloud to learn any information about the graph, nor the query. Also, the database owner is prevented from learning any information about the query, except that it happened.<\/jats:p>","DOI":"10.4018\/ijertcs.2019070106","type":"journal-article","created":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:45:04Z","timestamp":1559835904000},"page":"86-100","source":"Crossref","is-referenced-by-count":1,"title":["Privacy-Protecting Algorithms for Digraph Shortest Path Queries"],"prefix":"10.4018","volume":"10","author":[{"given":"Sara","family":"Ramezanian","sequence":"first","affiliation":[{"name":"University of Helsinki, Helsinki, Finland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7708-4308","authenticated-orcid":true,"given":"Tommi","family":"Meskanen","sequence":"additional","affiliation":[{"name":"University of Helsinki, Helsinki, Finland"}]},{"given":"Valtteri","family":"Niemi","sequence":"additional","affiliation":[{"name":"University of Helsinki, Helsinki, Finland"}]}],"member":"2432","reference":[{"key":"IJERTCS.2019070106-0","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-002-0120-1"},{"key":"IJERTCS.2019070106-1","doi-asserted-by":"publisher","DOI":"10.1007\/11593447_13"},{"key":"IJERTCS.2019070106-2","doi-asserted-by":"crossref","unstructured":"Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A. & Wiener, J. (2000). Graph structure in the web. Computer networks, 33(1-6), 309-320.","DOI":"10.1016\/S1389-1286(00)00083-9"},{"key":"IJERTCS.2019070106-3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27800-9_5"},{"key":"IJERTCS.2019070106-4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-0602-4_18"},{"journal-title":"Introduction to algorithms","year":"2009","author":"T. H.Cormen","key":"IJERTCS.2019070106-5"},{"key":"IJERTCS.2019070106-6","doi-asserted-by":"publisher","DOI":"10.1109\/ARES.2008.141"},{"key":"IJERTCS.2019070106-7","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"IJERTCS.2019070106-8","unstructured":"Gasarch, W. (2004). A survey on private information retrieval. The Bulletin of the EATCS, 82(72-107), 1."},{"key":"IJERTCS.2019070106-9","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802212"},{"key":"IJERTCS.2019070106-10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6515-8_13"},{"key":"IJERTCS.2019070106-11","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2018.2880981"},{"key":"IJERTCS.2019070106-12","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813672"},{"key":"IJERTCS.2019070106-13","doi-asserted-by":"publisher","DOI":"10.1109\/Trustcom.2015.414"},{"key":"IJERTCS.2019070106-14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-48000-6_14"},{"key":"IJERTCS.2019070106-15","doi-asserted-by":"publisher","DOI":"10.1109\/NTMS.2018.8328714"},{"key":"IJERTCS.2019070106-16","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"IJERTCS.2019070106-17","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2012.04.015"},{"key":"IJERTCS.2019070106-18","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902291"},{"key":"IJERTCS.2019070106-19","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2774451"},{"key":"IJERTCS.2019070106-20","first-page":"1","article-title":"Announcing the advanced encryption standard (AES).","volume":"197","author":"N. F.Standard","year":"2001","journal-title":"Federal Information Processing Standards Publication"},{"key":"IJERTCS.2019070106-21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2010.07.006"},{"key":"IJERTCS.2019070106-22","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2001.917152"},{"key":"IJERTCS.2019070106-23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85053-3_6"},{"key":"IJERTCS.2019070106-24","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.186"},{"key":"IJERTCS.2019070106-25","doi-asserted-by":"crossref","unstructured":"Wu, D. J., Zimmerman, J., Planul, J., & Mitchell, J. C. (2016). Privacy-preserving shortest path computation. arXiv:1601.02281","DOI":"10.14722\/ndss.2016.23052"},{"key":"IJERTCS.2019070106-26","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526816"},{"key":"IJERTCS.2019070106-27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59870-3_13"}],"container-title":["International Journal of Embedded and Real-Time Communication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=231462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T00:10:29Z","timestamp":1651795829000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJERTCS.2019070106"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":28,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.4018\/ijertcs.2019070106","relation":{},"ISSN":["1947-3176","1947-3184"],"issn-type":[{"type":"print","value":"1947-3176"},{"type":"electronic","value":"1947-3184"}],"subject":[],"published":{"date-parts":[[2019,7]]}}}