DBScholar

Back to papers

Shortest Path Computation with No Information Leakage

Summary: Zero-leakage shortest-path computation for location-based services (no source/destination/path inference). Uses private information retrieval as black-box building blocks; large-scale road-network experiments show practicality. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10700
Venue
VLDB
Year
2012
Pagerank
5.5377369e-05
Overall Rank
7,817 | 46.37%
DOI
10.14778/2212351.2212352

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{mouratidis_vldb12,
        title = {{Shortest Path Computation with No Information Leakage}},
        author = {Mouratidis, Kyriakos and Yiu, Man Lung},
        journal = {PVLDB},
        series = {{VLDB} '12},
        volume = {5},
        number = {8},
        pages = {692--703},
        doi = {10.14778/2212351.2212352},
        url = {https://doi.org/10.14778/2212351.2212352},
        year = {2012}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
5,444 Oblivious RAM: A Dissection and Experimental Evaluation 2016 VLDB 6.2174128e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers