{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T07:12:48Z","timestamp":1763968368318},"reference-count":25,"publisher":"Privacy Enhancing Technologies Symposium Advisory Board","issue":"1","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Differential privacy provides strong privacy guarantees simultaneously enabling useful insights from sensitive datasets. However, it provides the same level of protection for all elements (individuals and attributes) in the data. There are practical scenarios where some data attributes need more\/less protection than others. In this paper, we consider dX -privacy, an instantiation of the privacy notion introduced in [6], which allows this flexibility by specifying a separate privacy budget for each pair of elements in the data domain. We describe a systematic procedure to tailor any existing differentially private mechanism that assumes a query set and a sensitivity vector as input into its <jats:italic>d<\/jats:italic>\n                  <jats:italic>\n                     <jats:sub>X<\/jats:sub>\n                  <\/jats:italic> -private variant, specifically focusing on linear queries. Our proposed meta procedure has broad applications as linear queries form the basis of a range of data analysis and machine learning algorithms, and the ability to define a more flexible privacy budget across the data domain results in improved privacy\/utility tradeoff in these applications. We propose several <jats:italic>d<\/jats:italic>\n                  <jats:italic>\n                     <jats:sub>X<\/jats:sub>\n                  <\/jats:italic> -private mechanisms, and provide theoretical guarantees on the trade-off between utility and privacy. We also experimentally demonstrate the effectiveness of our procedure, by evaluating our proposed <jats:italic>d<\/jats:italic>\n                  <jats:italic>\n                     <jats:sub>X<\/jats:sub>\n                  <\/jats:italic> -private Laplace mechanism on both synthetic and real datasets using a set of randomly generated linear queries.<\/jats:p>","DOI":"10.2478\/popets-2020-0007","type":"journal-article","created":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T09:30:40Z","timestamp":1578475840000},"page":"103-125","source":"Crossref","is-referenced-by-count":6,"title":["Not All Attributes are Created Equal: <i>d<\/i>\n                  <i>\n                     <sub>X<\/sub>\n                  <\/i> -Private Mechanisms for Linear Queries"],"prefix":"10.56553","volume":"2020","author":[{"given":"Parameswaran","family":"Kamalaruban","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (work done while Kamalaruban was a Postgraduate Researcher at Data61, CSIRO)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Victor","family":"Perrier","sequence":"additional","affiliation":[{"name":"ISAE-SUPAERO & Data61, CSIRO"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hassan Jameel","family":"Asghar","sequence":"additional","affiliation":[{"name":"Macquarie University & Data61 , CSIRO"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed Ali","family":"Kaafar","sequence":"additional","affiliation":[{"name":"Macquarie University & Data61 , CSIRO"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"35752","published-online":{"date-parts":[[2020,1,7]]},"reference":[{"key":"2022061009191285159_j_popets-2020-0007_ref_001_w2aab3b7c14b1b6b1ab1ab1Aa","unstructured":"[1] M. Alaggan, S. Gambs, and A. M. Kermarrec. Heterogeneous differential privacy. arXiv preprint arXiv:1504.06998, 2015."},{"key":"2022061009191285159_j_popets-2020-0007_ref_002_w2aab3b7c14b1b6b1ab1ab2Aa","doi-asserted-by":"crossref","unstructured":"[2] M. E. Andr\u00e9s, N. E. Bordenabe, K. Chatzikokolakis, and C. Palamidessi. Geo-indistinguishability: Differential privacy for location-based systems. Proceedings of the ACM SIGSAC conference on Computer & communications security, pages 901\u2013914, 2013.10.1145\/2508859.2516735","DOI":"10.1145\/2508859.2516735"},{"key":"2022061009191285159_j_popets-2020-0007_ref_003_w2aab3b7c14b1b6b1ab1ab3Aa","doi-asserted-by":"crossref","unstructured":"[3] B. Barak, K. Chaudhuri, C. Dwork, S. Kale, F. McSherry, and K. Talwar. Privacy, accuracy, and consistency too: a holistic solution to contingency table release. Proceedings of the ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 273\u2013282, 2007.10.1145\/1265530.1265569","DOI":"10.1145\/1265530.1265569"},{"key":"2022061009191285159_j_popets-2020-0007_ref_004_w2aab3b7c14b1b6b1ab1ab4Aa","doi-asserted-by":"crossref","unstructured":"[4] A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: the SuLQ framework. Proceedings of the ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, pages 128\u2013138, 2005.10.1145\/1065167.1065184","DOI":"10.1145\/1065167.1065184"},{"key":"2022061009191285159_j_popets-2020-0007_ref_005_w2aab3b7c14b1b6b1ab1ab5Aa","doi-asserted-by":"crossref","unstructured":"[5] A. Blum, K. Ligett, and A. Roth. A learning theory approach to noninteractive database privacy. Journal of the ACM (JACM), 60(2):12, 2013.10.1145\/2450142.2450148","DOI":"10.1145\/2450142.2450148"},{"key":"2022061009191285159_j_popets-2020-0007_ref_006_w2aab3b7c14b1b6b1ab1ab6Aa","doi-asserted-by":"crossref","unstructured":"[6] K. Chatzikokolakis, M. E. Andr\u00e9s, N. E. Bordenabe, and C. Palamidessi. Broadening the scope of differential privacy using metrics. International Symposium on Privacy Enhancing Technologies Symposium, pages 82\u2013102, 2013.10.1007\/978-3-642-39077-7_5","DOI":"10.1007\/978-3-642-39077-7_5"},{"key":"2022061009191285159_j_popets-2020-0007_ref_007_w2aab3b7c14b1b6b1ab1ab7Aa","doi-asserted-by":"crossref","unstructured":"[7] C. Dwork, M. Hardt, T. Pitassi, O. Reingold, and R. Zemel. Fairness through awareness. Proceedings of the Innovations in Theoretical Computer Science Conference, pages 214\u2013226, 2012.10.1145\/2090236.2090255","DOI":"10.1145\/2090236.2090255"},{"key":"2022061009191285159_j_popets-2020-0007_ref_008_w2aab3b7c14b1b6b1ab1ab8Aa","doi-asserted-by":"crossref","unstructured":"[8] C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating Noise to Sensitivity in Private Data Analysis. Proceedings of the Conference on Theory of Cryptography, pages 265\u2013284, 2006.10.1007\/11681878_14","DOI":"10.1007\/11681878_14"},{"key":"2022061009191285159_j_popets-2020-0007_ref_009_w2aab3b7c14b1b6b1ab1ab9Aa","doi-asserted-by":"crossref","unstructured":"[9] C. Dwork, and A. Roth. The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science, pages 211\u2013407, 2014.10.1561\/0400000042","DOI":"10.1561\/0400000042"},{"key":"2022061009191285159_j_popets-2020-0007_ref_010_w2aab3b7c14b1b6b1ab1ac10Aa","doi-asserted-by":"crossref","unstructured":"[10] S. E. Fienberg, A. Rinaldo, and X. Yang. Differential privacy and the risk-utility tradeoff for multi-dimensional contingency tables. In International Conference on Privacy in Statistical Databases, pages 187\u2013199, 2010.10.1007\/978-3-642-15838-4_17","DOI":"10.1007\/978-3-642-15838-4_17"},{"key":"2022061009191285159_j_popets-2020-0007_ref_011_w2aab3b7c14b1b6b1ab1ac11Aa","doi-asserted-by":"crossref","unstructured":"[11] A. Ghosh, and A. Roth. Selling privacy at auction. Games and Economic Behavior, pages 334\u2013346, 2015.10.1016\/j.geb.2013.06.013","DOI":"10.1016\/j.geb.2013.06.013"},{"key":"2022061009191285159_j_popets-2020-0007_ref_012_w2aab3b7c14b1b6b1ab1ac12Aa","doi-asserted-by":"crossref","unstructured":"[12] A. Ghosh, T. Roughgarden, and M. Sundararajan. Universally utility-maximizing privacy mechanisms. SIAM Journal on Computing, pages 1673\u20131693, 2012.10.1137\/09076828X","DOI":"10.1137\/09076828X"},{"key":"2022061009191285159_j_popets-2020-0007_ref_013_w2aab3b7c14b1b6b1ab1ac13Aa","doi-asserted-by":"crossref","unstructured":"[13] S. Haney, A. Machanavajjhala, and B. Ding. Design of policy-aware differentially private algorithms. Proceedings of the VLDB Endowment, pages 264\u2013275, 2015.10.14778\/2856318.2856322","DOI":"10.14778\/2856318.2856322"},{"key":"2022061009191285159_j_popets-2020-0007_ref_014_w2aab3b7c14b1b6b1ab1ac14Aa","unstructured":"[14] M. Hardt, K. Ligett, and F. McSherry. A simple and practical algorithm for differentially private data release. Advances in Neural Information Processing Systems, pages 2339\u20132347, 2012."},{"key":"2022061009191285159_j_popets-2020-0007_ref_015_w2aab3b7c14b1b6b1ab1ac15Aa","doi-asserted-by":"crossref","unstructured":"[15] M. Hardt, and K. Talwar. On the geometry of differential privacy. Proceedings of the ACM symposium on Theory of computing, pages 705\u2013714, 2010.10.1145\/1806689.1806786","DOI":"10.1145\/1806689.1806786"},{"key":"2022061009191285159_j_popets-2020-0007_ref_016_w2aab3b7c14b1b6b1ab1ac16Aa","doi-asserted-by":"crossref","unstructured":"[16] X. He, A. Machanavajjhala, and B. Ding. Blowfish privacy: Tuning privacy-utility trade-offs using policies. Proceedings of the ACM SIGMOD international conference on Management of data, pages 1447\u20131458, 2014.10.1145\/2588555.2588581","DOI":"10.1145\/2588555.2588581"},{"key":"2022061009191285159_j_popets-2020-0007_ref_017_w2aab3b7c14b1b6b1ab1ac17Aa","doi-asserted-by":"crossref","unstructured":"[17] Z. Jorgensen, T. Yu, and G. Cormode. Conservative or liberal? Personalized differential privacy. International Conference on Data Engineering, pages 1023\u20131034, 2015.10.1109\/ICDE.2015.7113353","DOI":"10.1109\/ICDE.2015.7113353"},{"key":"2022061009191285159_j_popets-2020-0007_ref_018_w2aab3b7c14b1b6b1ab1ac18Aa","unstructured":"[18] C. Li, and G. Miklau. Efficient batch query answering under differential privacy. arXiv preprint arXiv:1103.1367, 2011."},{"key":"2022061009191285159_j_popets-2020-0007_ref_019_w2aab3b7c14b1b6b1ab1ac19Aa","doi-asserted-by":"crossref","unstructured":"[19] C. Li, and G. Miklau. An adaptive mechanism for accurate query answering under differential privacy. Proceedings of the VLDB Endowment, pages 514\u2013525, 2012.10.14778\/2168651.2168653","DOI":"10.14778\/2168651.2168653"},{"key":"2022061009191285159_j_popets-2020-0007_ref_020_w2aab3b7c14b1b6b1ab1ac20Aa","unstructured":"[20] Google Maps. Google Elevation API. https:\/\/developers.google.com\/maps\/documentation\/elevation\/intro, 2018."},{"key":"2022061009191285159_j_popets-2020-0007_ref_021_w2aab3b7c14b1b6b1ab1ac21Aa","doi-asserted-by":"crossref","unstructured":"[21] F. McSherry, and K. Talwar. Mechanism design via differential privacy. In Foundations of Computer Science, pages 94\u2013103, 2007.10.1109\/FOCS.2007.66","DOI":"10.1109\/FOCS.2007.66"},{"key":"2022061009191285159_j_popets-2020-0007_ref_022_w2aab3b7c14b1b6b1ab1ac22Aa","doi-asserted-by":"crossref","unstructured":"[22] V. Vadhan. The complexity of Differential Privacy. Tutorials on the Foundations of Cryptography, pages 347\u2013450, Springer, 2017.10.1007\/978-3-319-57048-8_7","DOI":"10.1007\/978-3-319-57048-8_7"},{"key":"2022061009191285159_j_popets-2020-0007_ref_023_w2aab3b7c14b1b6b1ab1ac23Aa","unstructured":"[23] SimpleMaps. United States Cities Database. https:\/\/simplemaps.com\/data\/us-cities, 2018."},{"key":"2022061009191285159_j_popets-2020-0007_ref_024_w2aab3b7c14b1b6b1ab1ac24Aa","doi-asserted-by":"crossref","unstructured":"[24] S. J. Wright. Coordinate descent algorithms. Mathematical Programming, pages 3\u201334, 2015.10.1007\/s10107-015-0892-3","DOI":"10.1007\/s10107-015-0892-3"},{"key":"2022061009191285159_j_popets-2020-0007_ref_025_w2aab3b7c14b1b6b1ab1ac25Aa","doi-asserted-by":"crossref","unstructured":"[25] Y. Xu, and W. Yin. A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM Journal on imaging sciences, pages 1758\u20131789, 2013.10.1137\/120887795","DOI":"10.1137\/120887795"}],"container-title":["Proceedings on Privacy Enhancing Technologies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/content.sciendo.com\/view\/journals\/popets\/2020\/1\/article-p103.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.sciendo.com\/pdf\/10.2478\/popets-2020-0007","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T16:30:45Z","timestamp":1658334645000},"score":1,"resource":{"primary":{"URL":"https:\/\/petsymposium.org\/popets\/2020\/popets-2020-0007.php"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,1]]},"references-count":25,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1,7]]},"published-print":{"date-parts":[[2020,1,1]]}},"alternative-id":["10.2478\/popets-2020-0007"],"URL":"https:\/\/doi.org\/10.2478\/popets-2020-0007","relation":{},"ISSN":["2299-0984"],"issn-type":[{"value":"2299-0984","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,1]]}}}