Cooperation-based location authentication scheme for crowdsensing applications

Utilizing mobile devices to collect location-related data in crowdsensing has the security problem of a location cheating attack.How to guarantee the quality of these sensitive data has become a challenge.In response to this, a location authentication scheme was proposed based on cooperation to dete...

Full description

Saved in:
Bibliographic Details
Main Authors: Youliang TIAN, Maoqing TIAN, Hongfeng GAO, Miao HE, Jinbo XIONG
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2022-09-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2022173/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Utilizing mobile devices to collect location-related data in crowdsensing has the security problem of a location cheating attack.How to guarantee the quality of these sensitive data has become a challenge.In response to this, a location authentication scheme was proposed based on cooperation to detect malicious users who submit false locations.Firstly, users with mobile devices were used to generate location proofs for each other, and a location verification scheme was designed based on distance bounding protocols for obtaining new information by multiple collisions of the same random number, which ensured the user’s location should be unforgeable and achieved the purpose of improving the quality of collected data.In addition, a location proof cooperator select method based on region division and reputation model was proposed which effectively prevented collusion attack and solved the problem of concentration of equity.Meanwhile, the incentive mechanism based on reputation value and task completion time was designed to effectively improve the location proof cooperator efficiency of task completion.Finally, security analysis and performance evaluation indicate that the scheme has proved to be correctness and secure, and the advantages in computational cost and communication overhead.
ISSN:1000-436X