Imperial College London

ProfessorJulieMcCann

Faculty of EngineeringDepartment of Computing

Professor of Computer Systems
 
 
 
//

Contact

 

+44 (0)20 7594 8375j.mccann Website

 
 
//

Location

 

258ACE ExtensionSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@inproceedings{Ren:2017:10.1109/CIT.2016.57,
author = {Ren, X and Yu, CM and Yu, W and Yang, S and Yang, X and McCann, J},
doi = {10.1109/CIT.2016.57},
pages = {226--233},
publisher = {IEEE},
title = {High-dimensional crowdsourced data distribution estimation with local privacy},
url = {http://dx.doi.org/10.1109/CIT.2016.57},
year = {2017}
}

RIS format (EndNote, RefMan)

TY  - CPAPER
AB - High-dimensional crowdsourced data collected from a large number of users may produc3 rich knowledge for our society but also bring unprecedented privacy threats to participants. Recently differential privacy has been proposed as an effective means to mitigate privacy concerns. However, existing work on differential privacy suffers from the 'curse of high-dimensionality' (data with multiple attributes) and high scalability (data with large scale records). Moreover, traditional methods of differential privacy were achieved via aggregation results, which cannot guarantee local privacy for distributed users in crowdsourced systems. To deal with these issues, in this paper we propose a novel scheme that can efficiently estimate multivariate joint distribution for high-dimensional data with local privacy. On the client side, we employ randomized response techniques to locally transform data from distributed users into privacy-preserving bit strings, which can prevent potential inside privacy attacks in crowdsourced systems. On the server side, the crowdsourced bit strings are aggregated for multivariate distribution estimation. Specifically, we first propose a multivariate version of the expectation maximization (EM) based algorithm to estimate the joint distribution of high dimensional data. To speed up the performance, unlike the EM-based method that needs to scan each user's bit string, we propose to use Lasso regression to obtain the distribution estimation from the aggregation information only once, which can significantly reduce the computation time for multivariate distribution estimation. Extensive experiments on real-world datasets demonstrate the efficiency of our multivariate distribution estimation scheme over existing estimation schemes.
AU - Ren,X
AU - Yu,CM
AU - Yu,W
AU - Yang,S
AU - Yang,X
AU - McCann,J
DO - 10.1109/CIT.2016.57
EP - 233
PB - IEEE
PY - 2017///
SP - 226
TI - High-dimensional crowdsourced data distribution estimation with local privacy
UR - http://dx.doi.org/10.1109/CIT.2016.57
UR - http://hdl.handle.net/10044/1/45919
ER -