Sparse Mobile Crowdsensing With Differential and Distortion Location Privacy

计算机科学 混淆 差别隐私 推论 失真(音乐) 数据挖掘 信息隐私 架空(工程) 算法 人工智能 计算机安全 计算机网络 放大器 带宽(计算) 操作系统
作者
Leye Wang,Daqing Zhang,Dingqi Yang,Brian Y. Lim,Xiao Han,Xiaojuan Ma
出处
期刊:IEEE Transactions on Information Forensics and Security [Institute of Electrical and Electronics Engineers]
卷期号:15: 2735-2749 被引量:127
标识
DOI:10.1109/tifs.2020.2975925
摘要

Sparse Mobile Crowdsensing (MCS) has become a compelling approach to acquire and infer urban-scale sensing data. However, participants risk their location privacy when reporting data with their actual sensing positions. To address this issue, we propose a novel location obfuscation mechanism combining \\epsilon -differential-privacy and \\delta -distortion-privacy in Sparse MCS. More specifically, differential privacy bounds adversaries' relative information gain regardless of their prior knowledge, while distortion privacy ensures that the expected inference error is larger than a threshold under an assumption of adversaries' prior knowledge. To reduce the data quality loss incurred by location obfuscation, we design a differential-and-distortion privacy-preserving framework with three components. First, we learn a data adjustment function to fit the original sensing data to the obfuscated location. Second, we apply a linear program to select an optimal location obfuscation function. The linear program aims to minimize the uncertainty in data adjustment under the constraints of \\epsilon -differential-privacy, \\delta -distortion-privacy, and evenly-distributed obfuscation. We also design an approximated method to reduce the required computation resources. Third, we propose an uncertainty-aware inference algorithm to improve the inference accuracy for the obfuscated data. Evaluations with real environment and traffic datasets show that our optimal method reduces the data quality loss by up to 42% compared to the state-of-the-art methods with the same level of privacy protection; the approximated method incurs < 3% additional quality loss than the optimal method, but only needs < 1% of the computation time. © 2005-2012 IEEE.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
1秒前
2秒前
Zh发布了新的文献求助10
2秒前
2秒前
lee完成签到,获得积分20
2秒前
2秒前
czm完成签到,获得积分10
3秒前
就喜欢喝百事完成签到,获得积分10
3秒前
传奇3应助Redger采纳,获得10
3秒前
蒋俊杰完成签到,获得积分10
3秒前
3秒前
3秒前
4秒前
TT发布了新的文献求助10
4秒前
ding应助帅气冰蝶采纳,获得10
4秒前
阔达岂愈发布了新的文献求助10
4秒前
4秒前
5秒前
5秒前
wanci应助ssjc采纳,获得10
5秒前
kkyy完成签到,获得积分20
5秒前
木牛牛马发布了新的文献求助10
5秒前
5秒前
XHONG完成签到 ,获得积分10
5秒前
科研通AI6.4应助Zhang采纳,获得10
5秒前
lee发布了新的文献求助10
5秒前
谭yuanjun发布了新的文献求助10
6秒前
6秒前
刘奎冉完成签到,获得积分10
6秒前
6秒前
7秒前
LISHUO完成签到,获得积分10
7秒前
wanci应助胡萝卜采纳,获得20
7秒前
paddi发布了新的文献求助10
7秒前
中中发布了新的文献求助10
7秒前
7秒前
7秒前
7秒前
liuy03发布了新的文献求助10
8秒前
高分求助中
Principles of Economics, 11th Edition 10000
University Physics with Modern Physics, 16th edition 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Molecular Mechanisms of Photosynthesis, 4th Edition 1000
Organic Reactions, Volume 116 1000
Matrix Methods in Data Mining and Pattern Recognition 510
Social Skills Improvement System-Rating Scales--Chinese Version 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7255412
求助须知:如何正确求助?哪些是违规求助? 8877482
关于积分的说明 18747034
捐赠科研通 6935778
什么是DOI,文献DOI怎么找? 3200374
关于科研通互助平台的介绍 2374907
邀请新用户注册赠送积分活动 2175592