@article{Lin_Kifer_2014, title={Towards a Systematic Analysis of Privacy Definitions}, volume={5}, url={https://journalprivacyconfidentiality.org/index.php/jpc/article/view/631}, DOI={10.29012/jpc.v5i2.631}, abstractNote={<p>In statistical privacy, a privacy definition is regarded as a set of algorithms that are allowed to process sensitive data. It is often helpful to consider the complementary view that privacy definitions are also contracts that guide the behavior of algorithms that take in sensitive data and produce sanitized data. Historically, data privacy breaches have been the result of fundamental misunderstandings about what a particular privacy definition guarantees.</p> <p>Privacy definitions are often analyzed using a highly targeted approach: a <em>specific</em> attack strategy is evaluated to determine if a <em>specific</em> type of information can be inferred. If the attack works, one can conclude that the privacy definition is too weak. If it doesnâ€™t work, one often gains little information about its security (perhaps a slightly different attack would have worked?). Furthermore, these strategies will not identify cases where a privacy definition protects unnecessary pieces of information.</p> <p>On the other hand, technical results concerning generalizable and systematic analyses of privacy are few in number, but such results have significantly advanced our understanding of the design of privacy definitions. We add to this literature with a novel methodology for analyzing the Bayesian properties of a privacy definition. Its goal is to identify precisely the type of information being protected, hence making it easier to identify (and later remove) unnecessary data protections.</p> <p>Using privacy building blocks (which we refer to as axioms), we turn questions about semantics into mathematical problems -- the construction of a <em>consistent normal form</em> and the subsequent construction of the <em>row cone</em> (which is a geometric object that encapsulates Bayesian guarantees provided by a privacy definition).</p> <p>We apply these ideas to study randomized response, FRAPP/PRAM, and several algorithms that add integer-valued noise to their inputs; we show that their privacy properties can be stated in terms of the protection of various notions of parity of a dataset. Randomized response, in particular, provides unnecessarily strong protections for parity, and so we also show how our methodology can be used to relax privacy definitions.</p>}, number={2}, journal={Journal of Privacy and Confidentiality}, author={Lin, Bing-Rong and Kifer, Dan}, year={2014}, month={Feb.} }