Distansberäkning med homomorf kryptering för platsbaserade tjänster : En kvantitativ utvärdering av homomorf kryptering i integritetsskyddade platsbaserade tjänster

Location-based services (LBS) require a user’s coordinates to perform calculations. This introduces privacy risks as data needs to be decrypted in order for computations to be performed. This study explores homomorphic encryption (HE) as a method to enable these computations without the need for decryption. In this study, we develop an application with the Node-seal library to perform homomorphic encryptions and computations. Due to HE’s mathematical constraints, a Euclidean formula is used instead of more precise models such as Karney’s formula. We then perform a quantitative study on a large dataset of randomized coordinates where encrypted computation time and precision is compared against plaintext computation time, and distance computations are compared against Karney’s formula. The results show that computation time increases significantly for encrypted computations, but the precision and relative deviation from Karney’s formula were found to be within acceptable bounds for certain LBS scenarios. Future work may explore alternative HE libraries and support for more complex geodetic distance formulas.

Publication Details

Journal
University Library of Skövde (University of Skövde)
Published
2025-01-01
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distansberäkning med homomorf kryptering för platsbaserade tjänster : En kvantitativ utvärdering av homomorf kryptering i integritetsskyddade platsbaserade tjänster

University Library of Skövde (University of Skövde)
Cryptography and Data Security
article

Distansberäkning med homomorf kryptering för platsbaserade tjänster : En kvantitativ utvärdering av homomorf kryptering i integritetsskyddade platsbaserade tjänster

article en

Abstract

Location-based services (LBS) require a user’s coordinates to perform calculations. This introduces privacy risks as data needs to be decrypted in order for computations to be performed. This study explores homomorphic encryption (HE) as a method to enable these computations without the need for decryption. In this study, we develop an application with the Node-seal library to perform homomorphic encryptions and computations. Due to HE’s mathematical constraints, a Euclidean formula is used instead of more precise models such as Karney’s formula. We then perform a quantitative study on a large dataset of randomized coordinates where encrypted computation time and precision is compared against plaintext computation time, and distance computations are compared against Karney’s formula. The results show that computation time increases significantly for encrypted computations, but the precision and relative deviation from Karney’s formula were found to be within acceptable bounds for certain LBS scenarios. Future work may explore alternative HE libraries and support for more complex geodetic distance formulas.

University Library of Skövde (University of Skövde)
Peace, Justice and strong institutions
Openalex Percentile: Top 72%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.