Please use this identifier to cite or link to this item:
|Title:||Efficient and accurate strategies for differentially-private sliding window queries|
|Citation:||Cao, J.,Xiao, Q.,Ghinita, G.,Li, N.,Bertino, E.,Tan, K.-L. (2013). Efficient and accurate strategies for differentially-private sliding window queries. ACM International Conference Proceeding Series : 191-202. ScholarBank@NUS Repository. https://doi.org/10.1145/2452376.2452400|
|Abstract:||Regularly releasing the aggregate statistics about data streams in a privacy-preserving way not only serves valuable commercial and social purposes, but also protects the privacy of individuals. This problem has already been studied under differential privacy, but only for the case of a single continuous query that covers the entire time span, e.g., counting the number of tuples seen so far in the stream. However, most real-world applications are window-based, that is, they are interested in the statistical information about streaming data within a window, instead of the whole unbound stream. Furthermore, a Data Stream Management System (DSMS) may need to answer numerous correlated aggregated queries simultaneously, rather than a single one. To cope with these requirements, we study how to release differentially private answers for a set of sliding window aggregate queries. We propose two solutions, each consisting of query sampling and composition. We first selectively sample a subset of representative sliding window queries from the set of all the submitted ones. The representative queries are answered by adding Laplace noises in a way satisfying differential privacy. For each non-representative query, we compose its answer from the query results of those representatives. The experimental evaluation shows that our solutions are efficient and effective. © 2013 ACM.|
|Source Title:||ACM International Conference Proceeding Series|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2018
checked on Nov 2, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.