Welcome to the InfoSci Platform
Reference Hub1
Privacy-Protecting Algorithms for Digraph Shortest Path Queries

Privacy-Protecting Algorithms for Digraph Shortest Path Queries

Sara Ramezanian, Tommi Meskanen, Valtteri Niemi
Copyright: © 2019 |Volume: 10 |Issue: 3 |Pages: 15
ISSN: 1947-3176|EISSN: 1947-3184|EISBN13: 9781522571988|DOI: 10.4018/IJERTCS.2019070106
Cite Article Cite Article

MLA

Ramezanian, Sara, et al. "Privacy-Protecting Algorithms for Digraph Shortest Path Queries." IJERTCS vol.10, no.3 2019: pp.86-100. http://doi.org/10.4018/IJERTCS.2019070106

APA

Ramezanian, S., Meskanen, T., & Niemi, V. (2019). Privacy-Protecting Algorithms for Digraph Shortest Path Queries. International Journal of Embedded and Real-Time Communication Systems (IJERTCS), 10(3), 86-100. http://doi.org/10.4018/IJERTCS.2019070106

Chicago

Ramezanian, Sara, Tommi Meskanen, and Valtteri Niemi. "Privacy-Protecting Algorithms for Digraph Shortest Path Queries," International Journal of Embedded and Real-Time Communication Systems (IJERTCS) 10, no.3: 86-100. http://doi.org/10.4018/IJERTCS.2019070106

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.