cipherPath: Efficient Traversals over Homomorphically Encrypted Paths

Georg Bramm, Julian Schütte

2020

Abstract

We propose cipherPath, a novel graph encryption scheme that enables exact shortest distance queries on encrypted graphs. Shortest distance queries are very useful in a vast number of applications, including medical, social or geospatial. Our approach using somewhat homomorphic encryption in combination with structured encryption enables exact shortest distance queries on outsourced and encrypted graph data. Our approach upholds provable security against a semi-honest provider. We demonstrate our framework by means of two different shortest path algorithms on encrypted graphs: Dijkstra and Floyd. Finally, we evaluate the leakage profile of cipherPath.

Paper Citation

in Harvard Style

Bramm G. and Schütte J. (2020). cipherPath: Efficient Traversals over Homomorphically Encrypted Paths.In Proceedings of the 17th International Joint Conference on e-Business and Telecommunications - Volume 3: SECRYPT, ISBN 978-989-758-446-6, pages 271-278. DOI: 10.5220/0009777802710278

in Bibtex Style

@conference{secrypt20,
author={Georg Bramm and Julian Schütte},
title={cipherPath: Efficient Traversals over Homomorphically Encrypted Paths},
booktitle={Proceedings of the 17th International Joint Conference on e-Business and Telecommunications - Volume 3: SECRYPT,},
year={2020},
pages={271-278},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0009777802710278},
isbn={978-989-758-446-6},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 17th International Joint Conference on e-Business and Telecommunications - Volume 3: SECRYPT,
TI - cipherPath: Efficient Traversals over Homomorphically Encrypted Paths
SN - 978-989-758-446-6
AU - Bramm G.
AU - Schütte J.
PY - 2020
SP - 271
EP - 278
DO - 10.5220/0009777802710278