Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Shortest Path Computation with No Information Leakage   Shortest path computation is one of the most common queries in location-based
services (LBSs). Although particularly useful, such queries raise serious
privacy concerns. Exposing to a (potentially untrusted) LBS the client's
position and her destination may reveal personal information, such as social
habits, health condition, shopping preferences, lifestyle choices, etc. The
only existing method for privacy-preserving shortest path computation follows
the obfuscation paradigm; it prevents the LBS from inferring the source and
destination of the query with a probability higher than a threshold. This
implies, however, that the LBS still deduces some information (albeit not
exact) about the client's location and her destination. In this paper we aim at
strong privacy, where the adversary learns nothing about the shortest path
query. We achieve this via established private information retrieval
techniques, which we treat as black-box building blocks. Experiments on real,
large-scale road networks assess the practicality of our schemes.

16
The categories of this paper are: stat
24
The categories of this paper are: dg-ga
2
The categories of this paper are: math
3
The categories of this paper are: physics
26
The categories of this paper are: bayes-an
17
The categories of this paper are: q-fin
10
The categories of this paper are: q-bio
32
The categories of this paper are: atom-ph
6
The categories of this paper are: astro-ph
20
The categories of this paper are: acc-phys
4
The categories of this paper are: cond-mat
37
The categories of this paper are: supr-con
23
The categories of this paper are: solv-int
13
The categories of this paper are: quant-ph
8
The categories of this paper are: hep-ex
7
The categories of this paper are: hep-th