亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
11秒前
斯文败类应助科研通管家采纳,获得10
21秒前
22秒前
自由山槐完成签到,获得积分10
24秒前
真实的瑾瑜完成签到 ,获得积分10
24秒前
38秒前
49秒前
53秒前
56秒前
58秒前
1分钟前
puhong zhang完成签到,获得积分10
1分钟前
1分钟前
1分钟前
1分钟前
宁宁发布了新的文献求助10
1分钟前
1分钟前
邓明完成签到,获得积分10
1分钟前
1分钟前
布鲁彬完成签到 ,获得积分10
1分钟前
1分钟前
好好写论文完成签到,获得积分20
2分钟前
2分钟前
2分钟前
2分钟前
CodeCraft应助科研通管家采纳,获得10
2分钟前
3分钟前
葱饼完成签到 ,获得积分10
3分钟前
bkagyin应助吴梓豪采纳,获得10
3分钟前
爆米花应助Transecond采纳,获得10
4分钟前
4分钟前
Transecond完成签到,获得积分20
4分钟前
4分钟前
4分钟前
Transecond发布了新的文献求助10
4分钟前
Lan完成签到 ,获得积分10
4分钟前
情怀应助Transecond采纳,获得10
4分钟前
4分钟前
吴梓豪发布了新的文献求助10
4分钟前
滕皓轩完成签到 ,获得积分20
4分钟前
高分求助中
Principles of Economics, 11th Edition 10000
University Physics with Modern Physics, 16th edition 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Matrix Methods in Data Mining and Pattern Recognition 510
Social Skills Improvement System-Rating Scales--Chinese Version 500
Dynamische Polarisation von H-1 und B-11 in (CH-3)-3NBH-3 500
CLSI M07 2024 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7247659
求助须知:如何正确求助?哪些是违规求助? 8870694
关于积分的说明 18712095
捐赠科研通 6925798
什么是DOI,文献DOI怎么找? 3197998
关于科研通互助平台的介绍 2373718
邀请新用户注册赠送积分活动 2172844