Forgot your password: Correlation dilution
Name
Medard_Forgot your.pdf
Size
310.69 KB
Format
Adobe PDF
Checksum (MD5)
82871b309c3c41ead2aa4d04f00b5d8e
Author(s)
Medard, Muriel
Makhdoumi Kakhaki, Ali
Calmon, Flavio du Pin
Date Issued
October 2015
Journal
2015 IEEE International Symposium on Information Theory (ISIT)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Makhdoumi, Ali, Flavio P. Calmon, and Muriel Medard. "Forgot Your Password: Correlation Dilution." 2015 IEEE International Symposium on Information Theory (ISIT), 14-19 June, 2015, Hong Kong, China, IEEE, 2015, pp. 2944–48.
Version
Author's final manuscript
Abstract
We consider the problem of diluting common randomness from correlated observations by separated agents. This problem creates a new framework to study statistical privacy, in which a legitimate party, Alice, has access to a random variable X, whereas an attacker, Bob, has access to a random variable Y dependent on X drawn from a joint distribution p[subscript X,Y]. Alice's goal is to produce a non-trivial function of her available information that is uncorrelated with (has small correlation with) any function that Bob can produce based on his available information. This problem naturally admits a minimax formulation where Alice plays first and Bob follows her. We define dilution coefficient as the smallest value of correlation achieved by the best strategy available to Alice, and characterize it in terms of the minimum principal inertia components of the joint probability distribution p[subscript X,Y]. We then explicitly find the optimal function that Alice must choose to achieve this limit. We also establish a connection between differential privacy and dilution coefficient and show that if Y is ε-differentially private from X, then dilution coefficient can be upper bounded in terms of ε. Finally, we extend to the setting where Alice and Bob have access to i.i.d. copies of (X[subscript i], Y[subscript i]), i = 1, ..., n and show that the dilution coefficient vanishes exponentially with n. In other words, Alice can achieve better privacy as the number of her observations grows.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2015.7282996
