loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Georg Bramm and Julian Schütte

Affiliation: Fraunhofer AISEC, Lichtenbergstrasse 11, Garching near Munich, Germany

Keyword(s): Somewhat Homomorphic Encryption, Structured Encryption, Order Preserving Encryption, Geospatial Encryption, Dijkstra, Floyd, Shortest Path.

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.

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.145.33.230

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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 - SECRYPT; ISBN 978-989-758-446-6; ISSN 2184-7711, SciTePress, pages 271-278. DOI: 10.5220/0009777802710278

@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 - SECRYPT},
year={2020},
pages={271-278},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0009777802710278},
isbn={978-989-758-446-6},
issn={2184-7711},
}

TY - CONF

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