On the Lift, Related Privacy Measures, and Applications to Privacy–Utility Trade-Offs

Author:

Zarrabian Mohammad Amin1ORCID,Ding Ni2ORCID,Sadeghi Parastoo3ORCID

Affiliation:

1. College of Engineering, Computing and Cybernetics, Australian National University, Canberra, ACT 2601, Australia

2. School of Computing and Information Systems, University of Melbourne, Parkville, VIC 3010, Australia

3. School of Engineering and Information Technology, University of New South Wales, Canberra, ACT 2600, Australia

Abstract

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’s 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 ℓ1-norm, χ2-privacy criterion, and α-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.

Funder

ARC Future Fellowship

Data61 CRP

Publisher

MDPI AG

Subject

General Physics and Astronomy

Reference40 articles.

1. Halevi, S., and Rabin, T. (2006). Theory of Cryptography, Springer.

2. Dwork, C. (2006, January 10–14). Differential Privacy. Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, part II (ICALP 2006), Venice, Italy.

3. Dwork, C. (2011). Encyclopedia of Cryptography and Security, Springer.

4. The algorithmic foundations of differential privacy;Dwork;Found. Trends Theor. Comput. Sci.,2014

5. What can we learn privately?;Kasiviswanathan;SIAM J. Comput.,2011

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Extremal Mechanisms for Pointwise Maximal Leakage;IEEE Transactions on Information Forensics and Security;2024

2. On the Privacy-Utility Trade-off With and Without Direct Access to the Private Data;IEEE Transactions on Information Theory;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3