Inan, AliGursoy, Mehmet EmreSaygin, Yucel2025-01-062025-01-0620201545-59711941-001810.1109/TDSC.2017.27346642-s2.0-85028910018https://doi.org/10.1109/TDSC.2017.2734664https://hdl.handle.net/20.500.14669/2234Differential privacy (DP) has gained significant attention lately as the state of the art in privacy protection. It achieves privacy by adding noise to query answers. We study the problem of privately and accurately answering a set of statistical range queries in batch mode (i.e., under non-interactive DP). The noise magnitude in DP depends directly on the sensitivity of a query set, and calculating sensitivity was proven to be NP-hard. Therefore, efficiently bounding the sensitivity of a given query set is still an open research problem. In this work, we propose upper bounds on sensitivity that are tighter than those in previous work. We also propose a formulation to exactly calculate sensitivity for a set of COUNT queries. However, it is impractical to implement these bounds without sophisticated methods. We therefore introduce methods that build a graph model G based on a query set Q, such that implementing the aforementioned bounds can be achieved by solving two well-known clique problems on G. We make use of the literature in solving these clique problems to realize our bounds efficiently. Experimental results show that for query sets with a few hundred queries, it takes only a few seconds to obtain results.eninfo:eu-repo/semantics/closedAccessDifferential privacyclique problemsstatistical database securitySQLrange queriesArticle2071Q119417WOS:000535700500013Q1