Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/102393
Full metadata record
DC FieldValueLanguage
dc.contributor.authorYuan, Ganzhaoen
dc.contributor.authorZhang, Zhenjieen
dc.contributor.authorWinslett, Marianneen
dc.contributor.authorXiao, Xiaokuien
dc.contributor.authorYang, Yinen
dc.contributor.authorHao, Zhifengen
dc.date.accessioned2014-03-20T09:10:18Zen
dc.date.accessioned2019-12-06T20:54:15Z-
dc.date.available2014-03-20T09:10:18Zen
dc.date.available2019-12-06T20:54:15Z-
dc.date.copyright2012en
dc.date.issued2012en
dc.identifier.citationYuan, 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.en
dc.identifier.urihttps://hdl.handle.net/10356/102393-
dc.description.abstractDifferential 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.en
dc.language.isoenen
dc.relation.ispartofseriesProceedings of the VLDB endowmenten
dc.rights© 2012 VLDB Endowment.en
dc.subjectDRNTU::Engineering::Computer science and engineeringen
dc.titleLow-rank mechanism : optimizing batch queries under differential privacyen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Computer Engineeringen
dc.identifier.urlhttp://arxiv.org/abs/1208.0094en
item.grantfulltextnone-
item.fulltextNo Fulltext-
Appears in Collections:SCSE Journal Articles

Page view(s) 20

601
Updated on Feb 7, 2023

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.