Privacy-Utility Tradeoffs under Constrained Data Release Mechanisms

R. Sibson, “Information radius,” Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete , vol. 14, no. 2, pp. 149–160, 1969

1969

Earlier work this paper cites.

P. Gács and J. Körner, “Common information is far less than mutual information,” Problems of Control and Information Theory , vol. 2, no. 2, pp. 149–162, 1973

1973

Earlier work this paper cites.

R. Ahlswede and J. Körner, “On common information and related characteristics of correlated information sources,” in Proc. Prague Conf. on Information Theory , 1974

1974

Earlier work this paper cites.

A. Wyner, “The common information of two dependent random variables,” IEEE Transactions on Information Theory , vol. 21, no. 2, pp. 163–179, Mar. 1975

1975

Earlier work this paper cites.

H. S. Witsenhausen, “Indirect rate distortion problems,” IEEE Transactions on Information Theory , vol. 26, no. 5, pp. 518–521, 1980

1980

Earlier work this paper cites.

H. Yamamoto, “A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers,” IEEE Trans. on Information Theory , vol. 29, no. 6, pp. 918–923, 1983

1983

Earlier work this paper cites.

N. Tishby, F. C. Pereira, and W. Bialek, “The information bottleneck method,” in Allerton Conf. on Comm., Ctrl., and Comp. , 1999, pp. 368––377

1999

Earlier work this paper cites.

L. Sweeney, “Simple demographics often identify people uniquely,” Carnegie Mellon University, Data Privacy Working Paper , 2000

2000

Earlier work this paper cites.

L. Sweeney, “k-anonymity: A model for protecting privacy,” Intl. Journal of Uncertainty, Fuzziness and Knowledge-Based Systems , vol. 10, no. 5, pp. 557–570, 2002

2002

Cited alongside, same era.

C. Dwork, F. McSherry, K. Nissim, and A. Smith, “Calibrating noise to sensitivity in private data analysis,” in Theory of Cryptography . Springer, 2006, pp. 265–284

2006

Cited alongside, same era.

A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam, “l-diversity: Privacy beyond k-anonymity,” ACM Trans. on Knowledge Discovery from Data , vol. 1, no. 1, p. 3, 2007

2007

Cited alongside, same era.

N. Li, T. Li, and S. Venkatasubramanian, “t-closeness: Privacy beyond k-anonymity and l-diversity,” in IEEE Intl. Conf. on Data Eng. IEEE, 2007, pp. 106–115

2007

Cited alongside, same era.

A. Narayanan and V. Shmatikov, “Robust de-anonymization of large sparse datasets,” in IEEE Symp. on Security and Privacy . IEEE, 2008, pp. 111–125

D. Kifer and B.-R. Lin, “An axiomatic view of statistical privacy and utility,” Journal of Privacy and Confidentiality , vol. 4, no. 1, pp. 5–49, 2012

2012

Later among the works it cites.

T. M. Cover and J. A. Thomas, Elements of information theory , 2nd ed. John Wiley & Sons, 2012

2012

Later among the works it cites.

L. Sankar, S. R. Rajagopalan, and H. V. Poor, “Utility-privacy tradeoffs in databases: An information-theoretic approach,” IEEE Trans. on Information Forensics and Security , vol. 8, no. 6, pp. 838–852, 2013

2013

Later among the works it cites.

A. Makhdoumi, S. Salamatian, N. Fawaz, and M. Médard, “From the information bottleneck to the privacy funnel,” in IEEE Information Theory Workshop , 2014, pp. 501–505

2014

Later among the works it cites.

Y. O. Basciftci, Y. Wang, and P. Ishwar, “On privacy-utility tradeoffs for constrained data release mechanisms,” in Information Theory and Applications Workshop , Feb. 2016