ridm@nrct.go.th   ระบบคลังข้อมูลงานวิจัยไทย   รายการโปรดที่คุณเลือกไว้

Low-rank mechanism : optimizing batch queries under differential privacy

หน่วยงาน Nanyang Technological University, Singapore

รายละเอียด

ชื่อเรื่อง : Low-rank mechanism : optimizing batch queries under differential privacy
นักวิจัย : Yuan, Ganzhao , Zhang, Zhenjie , Winslett, Marianne , Xiao, Xiaokui , Yang, Yin , Hao, Zhifeng
คำค้น : DRNTU::Engineering::Computer science and engineering.
หน่วยงาน : Nanyang Technological University, Singapore
ผู้ร่วมงาน : -
ปีพิมพ์ : 2555
อ้างอิง : Yuan, G., Zhang, Z., Winslett, M., Xiao X., Yang, Y., & Hao, F. (2012). Low-rank mechanism : optimizing batch queries under differential privacy. Proceedings of the VLDB Endowment, 5(11), 1352-1363. , http://hdl.handle.net/10220/18932 , http://arxiv.org/abs/1208.0094
ที่มา : -
ความเชี่ยวชาญ : -
ความสัมพันธ์ : Proceedings of the VLDB endowment
ขอบเขตของเนื้อหา : -
บทคัดย่อ/คำอธิบาย :

Differential privacy is a promising privacy-preserving paradigm for statistical query processing over sensitive data. It works by injecting random noise into each query result, such that it is provably hard for the adversary to infer the presence or absence of any individual record from the published noisy results. The main objective in differentially private query processing is to maximize the accuracy of the query results, while satisfying the privacy guarantees. Previous work, notably the matrix mechanism, has suggested that processing a batch of correlated queries as a whole can potentially achieve considerable accuracy gains, compared to answering them individually. However, as we point out in this paper, the matrix mechanism is mainly of theoretical interest; in particular, several inherent problems in its design limit its accuracy in practice, which almost never exceeds that of naive methods. In fact, we are not aware of any existing solution that can effectively optimize a query batch under differential privacy. Motivated by this, we propose the Low-Rank Mechanism (LRM), the first practical differentially private technique for answering batch queries with high accuracy, based on a low rank approximation of the workload matrix. We prove that the accuracy provided by LRM is close to the theoretical lower bound for any mechanism to answer a batch of queries under differential privacy. Extensive experiments using real data demonstrate that LRM consistently outperforms state-of-the-art query processing solutions under differential privacy, by large margins.

บรรณานุกรม :
Yuan, Ganzhao , Zhang, Zhenjie , Winslett, Marianne , Xiao, Xiaokui , Yang, Yin , Hao, Zhifeng . (2555). Low-rank mechanism : optimizing batch queries under differential privacy.
    กรุงเทพมหานคร : Nanyang Technological University, Singapore.
Yuan, Ganzhao , Zhang, Zhenjie , Winslett, Marianne , Xiao, Xiaokui , Yang, Yin , Hao, Zhifeng . 2555. "Low-rank mechanism : optimizing batch queries under differential privacy".
    กรุงเทพมหานคร : Nanyang Technological University, Singapore.
Yuan, Ganzhao , Zhang, Zhenjie , Winslett, Marianne , Xiao, Xiaokui , Yang, Yin , Hao, Zhifeng . "Low-rank mechanism : optimizing batch queries under differential privacy."
    กรุงเทพมหานคร : Nanyang Technological University, Singapore, 2555. Print.
Yuan, Ganzhao , Zhang, Zhenjie , Winslett, Marianne , Xiao, Xiaokui , Yang, Yin , Hao, Zhifeng . Low-rank mechanism : optimizing batch queries under differential privacy. กรุงเทพมหานคร : Nanyang Technological University, Singapore; 2555.