Fetching the paper…
Reading the bibliography…
Consider a data publishing setting for a dataset composed by both private and non-private features.
D. Varodayan and A. Khisti, “Smart meter privacy using a rechargeable battery: Minimizing the rate of information leakage,” in
1935
Earlier work this paper cites.
C. E. Shannon, “Communication theory of secrecy systems,”
1949
Earlier work this paper cites.
H. G. Eggleston,
1958
Earlier work this paper cites.
S. L. Warner, “Randomized response: A survey technique for eliminating evasive answer bias,”
1965
Earlier work this paper cites.
J. F. Handler and M. K. Rosenheim, “Privacy in welfare: Public assistance and juvenile justice,”
1966
Earlier work this paper cites.
I. Csiszár, “Information-type measures of difference of probability distributions and indirect observations,”
1967
Earlier work this paper cites.
H. L. Royden,
1968
Earlier work this paper cites.
R. Sibson, “Information radius,”
1969
Earlier work this paper cites.
H. Witsenhausen and A. Wyner, “A conditional entropy bound for a pair of discrete random variables,”
1975
Earlier work this paper cites.
W. Rudin,
1976
Earlier work this paper cites.
S. Arimoto, “Information measures and capacity of order
1977
Earlier work this paper cites.
H. Yamamoto, “A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers,”
1983
Earlier work this paper cites.
M. J. Greenacre,
1984
Earlier work this paper cites.
G. B. Folland,
1984
Earlier work this paper cites.
W. Rudin,
1987
Earlier work this paper cites.
M. J. Kearns, U. V. Vazirani, and U. Vazirani,
1994
Earlier work this paper cites.
N. Tishby, F. C. Pereira, and W. Bialek, “The information bottleneck method,” in
1999
Earlier work this paper cites.
L. G. Valiant, “Robust logics,”
2000
Earlier work this paper cites.
L. Sweeney, “k-anonymity: A model for protecting privacy,”
2002
Earlier work this paper cites.
A. Russell and H. Wang, “How to fool an unbounded adversary with a short key,” in
2002
Earlier work this paper cites.
T. Weissman, E. Ordentlich, G. Seroussi, S. Verdu, and M. J. Weinberger, “Inequalities for the
2003
Earlier work this paper cites.
Y. Dodis and A. Smith, “Entropic security and the encryption of high entropy messages,” in
2005
Earlier work this paper cites.
A. Narayanan and V. Shmatikov, “Robust de-anonymization of large sparse datasets,” in
2008
Earlier work this paper cites.
A. Ben-Tal, L. El Ghaoui, and A. Nemirovski,
2009
Earlier work this paper cites.
G. Smith, “On the foundations of quantitative information flow,” in
2009
Earlier work this paper cites.
C. Braun, K. Chatzikokolakis, and C. Palamidessi, “Quantitative notions of leakage for one-try attacks,”
2009
Earlier work this paper cites.
J.-P. Aubin and H. Frankowska,
2009
Earlier work this paper cites.
D. Rebollo-Monedero, J. Forne, and J. Domingo-Ferrer, “From t-closeness-like privacy to postrandomization via information theory,”
2010
Earlier work this paper cites.
O. Shamir, S. Sabato, and N. Tishby, “Learning and generalization with the information bottleneck,”
2010
Earlier work this paper cites.
C. Dwork, “Differential privacy,” in
2011
Cited alongside, same era.
P. J. Huber, “Robust statistics,” in
2011
Cited alongside, same era.
G. Barthe and B. Kopf, “Information-theoretic bounds for differentially private mechanisms,” in
2011
Cited alongside, same era.
V. Y. Tan, A. Anandkumar, L. Tong, and A. S. Willsky, “A large-deviation analysis of the maximum-likelihood learning of Markov tree structures,”
2011
Cited alongside, same era.
J. M. Wicherts and M. Bakker, “Publish (your data) or (let the data) perish! Why not publish your data too?.”
2012
Cited alongside, same era.
F. P. Calmon and N. Fawaz, “Privacy against statistical inference,” in
2012
Cited alongside, same era.
S. Asoodeh, M. Diaz, F. Alajaji, and T. Linder, “Information extraction under privacy constraints,”
2016
Later among the works it cites.
Y. O. Basciftci, Y. Wang, and P. Ishwar, “On privacy-utility tradeoffs for constrained data release mechanisms,” in
2016
Later among the works it cites.
I. Issa, S. Kamath, and A. B. Wagner, “An operational measure of information leakage,” in
2016
Later among the works it cites.
Y. Wu and P. Yang, “Minimax rates of entropy estimation on large alphabets via best polynomial approximation,”
2016
Later among the works it cites.
M. Raginsky, “Strong data processing inequalities and
2016
Later among the works it cites.
J. Angwin, J. Larson, S. Mattu, and L. Kirchner, “Machine bias,”
2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
L. Sankar, S. R. Rajagopalan, and H. V. Poor, “Utility-privacy tradeoffs in databases: An information-theoretic approach,”
2013
Cited alongside, same era.
O. Tan, D. Gunduz, and H. V. Poor, “Increasing smart meter privacy through energy harvesting and storage devices,”
2013
Cited alongside, same era.
F. P. Calmon, M. Varia, M. Médard, M. M. Christiansen, K. R. Duffy, and S. Tessaro, “Bounds on inference,” in
2013
Cited alongside, same era.
S. I. Resnick,
2013
Cited alongside, same era.
J. C. Oxtoby,
2013
Cited alongside, same era.
P. Kairouz, S. Oh, and P. Viswanath, “Extremal mechanisms for local differential privacy,” in
2014
Cited alongside, same era.
Later among the works it cites.
D. Donoho, “50 years of data science,”
2017
Later among the works it cites.
H. Wang and F. P. Calmon, “An estimation-theoretic view of privacy,” in
2017
Later among the works it cites.
C. Huang, P. Kairouz, X. Chen, L. Sankar, and R. Rajagopal, “Context-aware generative adversarial privacy,”
2017
Later among the works it cites.
J. Liao, L. Sankar, F. P. Calmon, and V. Y. Tan, “Hypothesis testing under maximal leakage privacy constraints,” in
2017
Later among the works it cites.
M. Charikar, J. Steinhardt, and G. Valiant, “Learning from untrusted data,” in
2017
Later among the works it cites.
A. Xu and M. Raginsky, “Information-theoretic analysis of generalization capability of learning algorithms,” in
2017
Later among the works it cites.
F. P. Calmon, A. Makhdoumi, M. Médard, M. Varia, M. Christiansen, and K. R. Duffy, “Principal inertia components and applications,”
2017
Later among the works it cites.
Y. Polyanskiy and Y. Wu, “Lecture notes on information theory,”
2017
Later among the works it cites.
H. Wang, M. Diaz, F. P. Calmon, and L. Sankar, “The utility cost of robust privacy guarantees,” in
2018
Closest in time.
K. Granville, “Facebook and Cambridge Analytica: What you need to know as fallout widens,”
2018
Closest in time.
S. Asoodeh, M. Diaz, F. Alajaji, and T. Linder, “Estimation efficiency under privacy constraints,”
2018
Closest in time.
J. Liao, O. Kosut, L. Sankar, and F. P. Calmon, “Privacy under hard distortion constraints,”
2018
Closest in time.
J. Liao, O. Kosut, L. Sankar, and F. P. Calmon, “A tunable measure for information leakage,” in
2018
Closest in time.
I. Wagner and D. Eckhoff, “Technical privacy metrics: A systematic survey,”
2018
Closest in time.
C. T. Li and A. El Gamal, “Maximal correlation secrecy,”
2018
Closest in time.
I. Issa, A. B. Wagner, and S. Kamath, “An operational approach to information leakage,”
2018
Closest in time.
F. P. Calmon, Y. Polyanskiy, and Y. Wu, “Strong data processing inequalities for input constrained additive noise channels,”
2018
Closest in time.
H. Hsu, S. Asoodeh, S. Salamatian, and F. P. Calmon, “Generalizing bottleneck problems,” in
2018
Closest in time.
B. Rassouli and D. Gunduz, “Optimal utility-privacy trade-off with total variation distance as a privacy measure,”
2019
Closest in time.
2019
Closest in time.
B. Rassouli, F. E. Rosas, and D. Gunduz, “Data disclosure under perfect sample privacy,”
2019
Closest in time.
A. Nageswaran and P. Narayan, “Data privacy for a
2019
Closest in time.