A trajectory privacy protection method using cached candidate result sets

IF 3.4 3区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS
{"title":"A trajectory privacy protection method using cached candidate result sets","authors":"","doi":"10.1016/j.jpdc.2024.104965","DOIUrl":null,"url":null,"abstract":"<div><p>A trajectory privacy protection method using cached candidate result sets (TPP-CCRS) is proposed for the user trajectory privacy leakage problem. First, the user's area is divided into a grid to lock the user's trajectory range, and a cache area is set on the user's mobile side to cache the candidate result sets queried from the user's area. Second, a security center is deployed to register users securely and assign public and private keys for verifying location information. The same user's location information is randomly divided into <em>M</em> copies and sent to multi-anonymizers. Then, the random concurrent <em>k</em>-anonymization mechanism with multi-anonymizers is used to concurrently <em>k</em>-anonymize <em>M</em> copies of location information. Finally, the prefix tree is added on the location-based service (LBS) server side, and the location information is encrypted using the clustered data fusion privacy protection algorithm. The optimal binary tree algorithm queries user interest points. Security analysis and experimental verification show that the TPP-CCRS can effectively protect user trajectory privacy and improve location information query efficiency.</p></div>","PeriodicalId":54775,"journal":{"name":"Journal of Parallel and Distributed Computing","volume":null,"pages":null},"PeriodicalIF":3.4000,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Parallel and Distributed Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0743731524001291","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

Abstract

A trajectory privacy protection method using cached candidate result sets (TPP-CCRS) is proposed for the user trajectory privacy leakage problem. First, the user's area is divided into a grid to lock the user's trajectory range, and a cache area is set on the user's mobile side to cache the candidate result sets queried from the user's area. Second, a security center is deployed to register users securely and assign public and private keys for verifying location information. The same user's location information is randomly divided into M copies and sent to multi-anonymizers. Then, the random concurrent k-anonymization mechanism with multi-anonymizers is used to concurrently k-anonymize M copies of location information. Finally, the prefix tree is added on the location-based service (LBS) server side, and the location information is encrypted using the clustered data fusion privacy protection algorithm. The optimal binary tree algorithm queries user interest points. Security analysis and experimental verification show that the TPP-CCRS can effectively protect user trajectory privacy and improve location information query efficiency.

Abstract Image

使用缓存候选结果集的轨迹隐私保护方法
针对用户轨迹隐私泄露问题,提出了一种使用缓存候选结果集的轨迹隐私保护方法(TPP-CCRS)。首先,将用户区域划分成网格,锁定用户的轨迹范围,并在用户移动端设置缓存区域,缓存从用户区域查询到的候选结果集。其次,部署一个安全中心,对用户进行安全注册,并分配用于验证位置信息的公钥和私钥。同一用户的位置信息会被随机分成若干份,发送给多个匿名者。然后,使用多匿名器的随机并发匿名机制对位置信息副本进行并发匿名。最后,在基于位置的服务(LBS)服务器端添加前缀树,并使用聚类数据融合隐私保护算法对位置信息进行加密。最优二叉树算法查询用户兴趣点。安全分析和实验验证表明,TPP-CCRS 能有效保护用户轨迹隐私,提高位置信息查询效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Parallel and Distributed Computing
Journal of Parallel and Distributed Computing 工程技术-计算机:理论方法
CiteScore
10.30
自引率
2.60%
发文量
172
审稿时长
12 months
期刊介绍: This international journal is directed to researchers, engineers, educators, managers, programmers, and users of computers who have particular interests in parallel processing and/or distributed computing. The Journal of Parallel and Distributed Computing publishes original research papers and timely review articles on the theory, design, evaluation, and use of parallel and/or distributed computing systems. The journal also features special issues on these topics; again covering the full range from the design to the use of our targeted systems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信