Privacy Preserving Computation of Shortest Path in Presence of a Single Convex Polygonal Obstacle

摘要

Shortest path computation has always been a subject of study and research in the history of computer science. In this paper we introduce and initiate the study of the problem of finding the shortest path in a privacy preserving manner, in presence of single convex polygonal obstacle. We also propose an efficient, elegant and simple solution for the problem.