Multi-factor Dummy Location Selection Algorithm in Location-based Service

In view of the existing dummy location selection methods in LBS snapshot location privacy protection,the background knowledge attack caused by the time factor of the location itself is ignored,and the sensitive locations are treated equally.Based on this,a multi-factor dummy location selection algorithm(MFDLS) is proposed,which comprehensively considers the factors that affect privacy leakage,including background knowledge such as geographical attributes,semantic attributes,time attributes of the location and query probability as well as the users' sensitive preferences.To ensure that the selected dummy locations can not only effectively resist location homogeneity attack,location semantic attack and query probability distribution attack,but also deal with multiple threats such as location distribution attack,sensitive homogeneity attack and link attack.The algorithm selects the dummy locations that meet the requirements of query probability close to the initiating time,semantic diversification,large anonymous space and relatively consistent time,non-outlier and central point.Compared with the existing dummy location selection algorithm,the security analysis and simulation results show that the proposed algorithm improves the adversary error by at least 16% and reduces the quality loss by at least 30%,which can more effectively resist the background knowledge attack and meet the users' privacy requirements.

Institutions

Publication Details

Journal
SHILAP Revista de lepidopterología
Published
2025-05-01
DOI
https://doi.org/10.11896/jsjkx.240200067
Primary Topic
Consumer Attitudes and Food Labeling
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-factor Dummy Location Selection Algorithm in Location-based Service

SHILAP Revista de lepidopterología
Consumer Attitudes and Food Labeling
article

Multi-factor Dummy Location Selection Algorithm in Location-based Service

article en

Abstract

In view of the existing dummy location selection methods in LBS snapshot location privacy protection,the background knowledge attack caused by the time factor of the location itself is ignored,and the sensitive locations are treated equally.Based on this,a multi-factor dummy location selection algorithm(MFDLS) is proposed,which comprehensively considers the factors that affect privacy leakage,including background knowledge such as geographical attributes,semantic attributes,time attributes of the location and query probability as well as the users' sensitive preferences.To ensure that the selected dummy locations can not only effectively resist location homogeneity attack,location semantic attack and query probability distribution attack,but also deal with multiple threats such as location distribution attack,sensitive homogeneity attack and link attack.The algorithm selects the dummy locations that meet the requirements of query probability close to the initiating time,semantic diversification,large anonymous space and relatively consistent time,non-outlier and central point.Compared with the existing dummy location selection algorithm,the security analysis and simulation results show that the proposed algorithm improves the adversary error by at least 16% and reduces the quality loss by at least 30%,which can more effectively resist the background knowledge attack and meet the users' privacy requirements.

SHILAP Revista de lepidopterología
Zhongyuan University of Technology (CN)
Peace, Justice and strong institutions
Openalex Percentile: Top 37%
Consumer Attitudes and Food Labeling
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.