{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T17:02:15Z","timestamp":1787936535602,"version":"build-2784847793"},"reference-count":40,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T00:00:00Z","timestamp":1681776000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000923","name":"ARC Future Fellowship","doi-asserted-by":"publisher","award":["FT190100429"],"award-info":[{"award-number":["FT190100429"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"ARC Future Fellowship","doi-asserted-by":"publisher","award":["IT-PPUB"],"award-info":[{"award-number":["IT-PPUB"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008242","name":"Data61 CRP","doi-asserted-by":"publisher","award":["FT190100429"],"award-info":[{"award-number":["FT190100429"]}],"id":[{"id":"10.13039\/100008242","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008242","name":"Data61 CRP","doi-asserted-by":"publisher","award":["IT-PPUB"],"award-info":[{"award-number":["IT-PPUB"]}],"id":[{"id":"10.13039\/100008242","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>This paper investigates lift, the likelihood ratio between the posterior and prior belief about sensitive features in a dataset. Maximum and minimum lifts over sensitive features quantify the adversary\u2019s knowledge gain and should be bounded to protect privacy. We demonstrate that max- and min-lifts have a distinct range of values and probability of appearance in the dataset, referred to as lift asymmetry. We propose asymmetric local information privacy (ALIP) as a compatible privacy notion with lift asymmetry, where different bounds can be applied to min- and max-lifts. We use ALIP in the watchdog and optimal random response (ORR) mechanisms, the main methods to achieve lift-based privacy. It is shown that ALIP enhances utility in these methods compared to existing local information privacy, which ensures the same (symmetric) bounds on both max- and min-lifts. We propose subset merging for the watchdog mechanism to improve data utility and subset random response for the ORR to reduce complexity. We then investigate the related lift-based measures, including \u21131-norm, \u03c72-privacy criterion, and \u03b1-lift. We reveal that they can only restrict max-lift, resulting in significant min-lift leakage. To overcome this problem, we propose corresponding lift-inverse measures to restrict the min-lift. We apply these lift-based and lift-inverse measures in the watchdog mechanism. We show that they can be considered as relaxations of ALIP, where a higher utility can be achieved by bounding only average max- and min-lifts.<\/jats:p>","DOI":"10.3390\/e25040679","type":"journal-article","created":{"date-parts":[[2023,4,19]],"date-time":"2023-04-19T01:39:05Z","timestamp":1681868345000},"page":"679","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["On the Lift, Related Privacy Measures, and Applications to Privacy\u2013Utility Trade-Offs"],"prefix":"10.3390","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4918-2744","authenticated-orcid":false,"given":"Mohammad Amin","family":"Zarrabian","sequence":"first","affiliation":[{"name":"College of Engineering, Computing and Cybernetics, Australian National University, Canberra, ACT 2601, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1705-7380","authenticated-orcid":false,"given":"Ni","family":"Ding","sequence":"additional","affiliation":[{"name":"School of Computing and Information Systems, University of Melbourne, Parkville, VIC 3010, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9965-9483","authenticated-orcid":false,"given":"Parastoo","family":"Sadeghi","sequence":"additional","affiliation":[{"name":"School of Engineering and Information Technology, University of New South Wales, Canberra, ACT 2600, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2023,4,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Halevi, S., and Rabin, T. (2006). Theory of Cryptography, Springer.","DOI":"10.1007\/11681878"},{"key":"ref_2","unstructured":"Dwork, C. (2006, January 10\u201314). Differential Privacy. Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, part II (ICALP 2006), Venice, Italy."},{"key":"ref_3","unstructured":"Dwork, C. (2011). Encyclopedia of Cryptography and Security, Springer."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1561\/0400000042","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"Dwork","year":"2014","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1137\/090756090","article-title":"What can we learn privately?","volume":"40","author":"Kasiviswanathan","year":"2011","journal-title":"SIAM J. Comput."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Duchi, J.C., Jordan, M.I., and Wainwright, M.J. (2013, January 26\u201329). Local Privacy and Statistical Minimax Rates. Proceedings of the 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, Berkeley, CA, USA.","DOI":"10.1109\/FOCS.2013.53"},{"key":"ref_7","first-page":"2879","article-title":"Extremal mechanisms for local differential privacy","volume":"4","author":"Kairouz","year":"2014","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Sarwate, A.D., and Sankar, L. (October, January 30). A rate-disortion perspective on local differential privacy. Proceedings of the 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA.","DOI":"10.1109\/ALLERTON.2014.7028550"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2816","DOI":"10.1109\/TIFS.2018.2831619","article-title":"Robust Privacy-Utility Tradeoffs Under Differential Privacy and Hamming Distortion","volume":"13","author":"Kalantari","year":"2018","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1109\/TIFS.2013.2253320","article-title":"Utility-privacy tradeoffs in databases: An information-theoretic approach","volume":"8","author":"Sankar","year":"2013","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Jiang, B., Li, M., and Tandon, R. (June, January 30). Context-aware Data Aggregation with Localized Information Privacy. Proceedings of the 2018 IEEE Conference on Communications and Network Security (CNS), Beijing, China.","DOI":"10.1109\/CNS.2018.8433200"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Makhdoumi, A., Salamatian, S., Fawaz, N., and M\u00e9dard, M. (2014, January 2\u20135). From the Information Bottleneck to the Privacy Funnel. Proceedings of the 2014 IEEE Information Theory Workshop (ITW 2014), Hobart, TAS, Australia.","DOI":"10.1109\/ITW.2014.6970882"},{"key":"ref_13","unstructured":"Salamatian, S., du Pin Calmon, F., Fawaz, N., Makhdoumi, A., and M\u00e9dard, M. (2020, January 16). Privacy-Utility Tradeoff and Privacy Funnel. Available online: http:\/\/www.mit.edu\/~salmansa\/files\/privacy_TIFS.pdf."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Issa, I., Kamath, S., and Wagner, A.B. (2016, January 16\u201318). An operational measure of information leakage. Proceedings of the 2016 Annual Conference on Information Science and Systems (CISS), Princeton, NJ, USA.","DOI":"10.1109\/CISS.2016.7460507"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Issa, I., Kamath, S., and Wagner, A.B. (2016, January 10\u201315). Maximal leakage minimization for the Shannon cipher system. Proceedings of the 2016 IEEE International Symposium on Information Theory (ISIT), Barcelona, Spain.","DOI":"10.1109\/ISIT.2016.7541353"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1625","DOI":"10.1109\/TIT.2019.2962804","article-title":"An Operational Approach to Information Leakage","volume":"66","author":"Issa","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Liao, J., Kosut, O., Sankar, L., and Calmon, F.P. (2018, January 17\u201322). A tunable measure for information leakage. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Vail, CO, USA.","DOI":"10.1109\/ISIT.2018.8437307"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Du Pin Calmon, F., and Fawaz, N. (2012, January 1\u20135). Privacy against statistical inference. Proceedings of the 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton), Monticello, IL, USA.","DOI":"10.1109\/Allerton.2012.6483382"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Jiang, B., Li, M., and Tandon, R. (2019, January 20\u201324). Local Information Privacy with Bounded Prior. Proceedings of the 2019 IEEE International Conference on Communications (ICC), Shanghai, China.","DOI":"10.1109\/ICC.2019.8761176"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Seif, M., Tandon, R., and Li, M. (2019, January 25\u201328). Context Aware Laplacian Mechanism for Local Information Privacy. Proceedings of the 2019 IEEE Information Theory Workshop (ITW), Visby, Sweden.","DOI":"10.1109\/ITW44776.2019.8989402"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1918","DOI":"10.1109\/TDSC.2020.3041733","article-title":"Local Information Privacy and Its Application to Privacy-Preserving Data Aggregation","volume":"19","author":"Jiang","year":"2020","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"3694","DOI":"10.1109\/TIFS.2021.3087350","article-title":"Context-Aware Local Information Privacy","volume":"16","author":"Jiang","year":"2021","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Ding, N., Liu, Y., and Farokhi, F. (2021, January 12\u201320). A Linear Reduction Method for Local Differential Privacy and Log-lift. Proceedings of the 2021 IEEE International Symposium on Information Theory (ISIT), Melbourne, VIC, Australia.","DOI":"10.1109\/ISIT45174.2021.9517826"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Hsu, H., Asoodeh, S., and Calmon, F.P. (2019, January 7\u201312). Information-Theoretic Privacy Watchdogs. Proceedings of the 2019 IEEE International Symposium on Information Theory (ISIT), Paris, France.","DOI":"10.1109\/ISIT.2019.8849440"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Sadeghi, P., Ding, N., and Rakotoarivelo, T. (2020, January 11\u201315). On Properties and Optimization of Information-theoretic Privacy Watchdog. Proceedings of the 2020 IEEE Information Theory Workshop (ITW), Riva del Garda, Italy.","DOI":"10.1109\/ITW46852.2021.9457673"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Zarrabian, M.A., Ding, N., Sadeghi, P., and Rakotoarivelo, T. (2022, January 7\u201313). Enhancing utility in the watchdog privacy mechanism. Proceedings of the ICASSP 2022\u20142022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Virtual.","DOI":"10.1109\/ICASSP43922.2022.9747673"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Razeghi, B., Calmon, F., Gunduz, D., and Voloshynovskiy, S. (2020). On Perfect Obfuscation: Local Information Geometry Analysis. arXiv.","DOI":"10.1109\/WIFS49906.2020.9360888"},{"key":"ref_28","first-page":"162","article-title":"Data Sanitisation Protocols for the Privacy Funnel with Differential Privacy Guarantees","volume":"13","author":"Tong","year":"2021","journal-title":"Int. J. Adv. Secur."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Gehrke, J., and Srikant, R. (2003, January 9\u201312). Limiting Privacy Breaches in Privacy Preserving Data Mining. Proceedings of the Twenty-Second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS \u201903, San Diego, CA, USA.","DOI":"10.1145\/773153.773174"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Saeidian, S., Cervia, G., Oechtering, T.J., and Skoglund, M. (2022). Pointwise Maximal Leakage. arXiv.","DOI":"10.1109\/ISIT50566.2022.9834814"},{"key":"ref_31","unstructured":"Fernandes, N., McIver, A., and Sadeghi, P. (2022). Explaining epsilon in differential privacy through the lens of information theory. arXiv."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1109\/TIFS.2021.3137755","article-title":"Data Disclosure With Non-Zero Leakage and Non-Invertible Leakage Matrix","volume":"17","author":"Zamani","year":"2022","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"2312","DOI":"10.1109\/TIFS.2021.3053462","article-title":"A Design Framework for Strongly \u03c72-Private Data Disclosure","volume":"16","author":"Zamani","year":"2021","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Ding, N., Zarrabian, M.A., and Sadeghi, P. (2021, January 12\u201320). \u03b1-Information-theoretic Privacy Watchdog and Optimal Privatization Scheme. Proceedings of the 2021 IEEE International Symposium on Information Theory (ISIT), Melbourne, VIC, Australia.","DOI":"10.1109\/ISIT45174.2021.9518220"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1109\/TIFS.2019.2903658","article-title":"Optimal utility-privacy trade-off with total variation distance as a privacy measure","volume":"15","author":"Rassouli","year":"2019","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"1512","DOI":"10.1109\/TIT.2018.2865558","article-title":"Estimation efficiency under privacy constraints","volume":"65","author":"Asoodeh","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Rassouli, B., Rosas, F.E., and Gunduz, D. (2019). Data Disclosure under Perfect Sample Privacy. arXiv.","DOI":"10.1109\/WIFS.2018.8630780"},{"key":"ref_38","unstructured":"Becker, B., and Kohavi, R. (1996, January 05). Adult. UC Irvine Machine Learning Repository. Available online: https:\/\/archive-beta.ics.uci.edu\/dataset\/2\/adult."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"4653","DOI":"10.1109\/TIT.2020.2977916","article-title":"Capacity Theorems for Distributed Index Coding","volume":"66","author":"Liu","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"8025","DOI":"10.1109\/TIT.2019.2934414","article-title":"Privacy With Estimation Guarantees","volume":"65","author":"Wang","year":"2019","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/4\/679\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:18:33Z","timestamp":1760123913000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/4\/679"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,18]]},"references-count":40,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,4]]}},"alternative-id":["e25040679"],"URL":"https:\/\/doi.org\/10.3390\/e25040679","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,18]]}}}