ECC-LPM: Efficient k-Anonymity for Location Privacy

Location privacy is one of the major concerns in modern LBS applications. In this paper, we propose an efficient ECC-based Location Privacy Model referred to as ECC-LPM, which leverages the efficiency of ECC for strong k-anonymity protection. Further, we have provided performance evaluation details for the proposed ECC-LPM with conventional RSA-based approaches in detail. Accordingly, our experimental results show that the approach ECC-LPM performs considerably better than RSA in encryption and decryption operations for different k-anonymity levels and various data sizes. The time of operation in ECC-LPM is practically constant, irrespective of data size, when compared to much longer and slightly variable processing times of RSA, particularly in decryption. Our findings have important implications for the design of efficient and scalable location privacy systems, especially in resource-constrained environments such as mobile devices and IoT applications.

Authors

Institutions

Publication Details

Published
2024-12-06
DOI
https://doi.org/10.1109/cict64037.2024.10899664
Primary Topic
Privacy-Preserving Technologies in Data
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ECC-LPM: Efficient k-Anonymity for Location Privacy

Mustaffa Abdullah, Nemi Chandra Rathore
Privacy-Preserving Technologies in Data
article

ECC-LPM: Efficient k-Anonymity for Location Privacy

Mustaffa Abdullah, Nemi Chandra Rathore
article en

Abstract

Location privacy is one of the major concerns in modern LBS applications. In this paper, we propose an efficient ECC-based Location Privacy Model referred to as ECC-LPM, which leverages the efficiency of ECC for strong k-anonymity protection. Further, we have provided performance evaluation details for the proposed ECC-LPM with conventional RSA-based approaches in detail. Accordingly, our experimental results show that the approach ECC-LPM performs considerably better than RSA in encryption and decryption operations for different k-anonymity levels and various data sizes. The time of operation in ECC-LPM is practically constant, irrespective of data size, when compared to much longer and slightly variable processing times of RSA, particularly in decryption. Our findings have important implications for the design of efficient and scalable location privacy systems, especially in resource-constrained environments such as mobile devices and IoT applications.

Central University of South Bihar (IN)
Openalex Percentile: Top 74%
Privacy-Preserving Technologies in Data
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.