Title :
Privacy Preserving Computation of Shortest Path in Presence of a Single Convex Polygonal Obstacle
Author :
Das, Ananda Swarup ; Srinathan, Kannan ; Tiwari, Ritesh Kumar ; Srivastava, Vaibhav
Author_Institution :
Center for Security Theor. & Algorithmic Res., Int. Inst. of Inf. Technol., Hyderabad
Abstract :
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.
Keywords :
graph theory; optimisation; privacy preserving computation; shortest path computation; single convex polygonal obstacle; Circuits; Galois fields; Information security; Information technology; Privacy; Protocols; Public key; Public key cryptography; Sliding mode control; Wires;
Conference_Titel :
Mobile Data Management, 2007 International Conference on
Conference_Location :
Mannheim
Print_ISBN :
1-4244-1241-2
DOI :
10.1109/MDM.2007.52
