Fetching the paper…
Reading the bibliography…
We investigate the problem of estimating a random variable $Y\in \mathcal{Y}$ under a privacy constraint dictated by another random variable $X\in \mathcal{X}$, where estimation efficiency and privacy are assessed in terms of two different loss functions.
H. O. Hirschfeld, “A connection between correlation and contingency,” Cambridge Philosophical Soc. , vol. 31, pp. 520–524, 1935
1935
Earlier work this paper cites.
H. Gebelein, “Das statistische problem der korrelation als variations- und eigenwert-problem und sein zusammenhang mit der ausgleichungsrechnung,” Zeitschrift f ur angew. Math. und Mech. , no. 21, pp. 364–379, 1941
1941
Earlier work this paper cites.
O. Sarmanov, “The maximum correlation coefficient (nonsymmetric case),” Dokl. Akad. Nauk SSSR , vol. 120, no. 4, pp. 715–718, 1958
1958
Earlier work this paper cites.
A. Rényi, “On measures of dependence,” Acta Mathematica Academiae Scientiarum Hungarica , vol. 10, no. 3, pp. 441–451, 1959
1959
Earlier work this paper cites.
R. Sibson, “Information radius,” Z. Wahrscheinlichkeitsth. Verw. Geb. , vol. 14, pp. 149–161, 1969
1969
Earlier work this paper cites.
H. Witsenhausen and A. Wyner, “A conditional entropy bound for a pair of discrete random variables,” IEEE Trans. Inf. Theory , vol. 21, no. 5, pp. 493–501, Sep. 1975
1975
Earlier work this paper cites.
S. Arimoto, “Information measures and capacity of order α \alpha for discrete memoryless channels,” in Topics in Information Theory, Coll. Math. Soc. J. Bolyai (I. Csiszár and P. Elias Eds.) , vol. 16. North-Holland, Amsterdam, 1977, pp. 41–52
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,” IEEE Trans. Inf. Theory , vol. 29, no. 6, pp. 918–923, Nov. 1983
1983
Earlier work this paper cites.
T. Berger and R. Yeung, “Multiterminal source encoding with encoder breakdown,” IEEE Trans. Inf. Theory , vol. 35, no. 2, pp. 237–244, March 1989
1989
Earlier work this paper cites.
S. Asoodeh, F. Alajaji, and T. Linder, “Privacy-aware MMSE estimation,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , July 2016, pp. 1989–1993
1993
Earlier work this paper cites.
J. L. Massey, “Guessing and entropy,” in Proc. IEEE Int. Symp. Inf. Theory , June 1994, pp. 204–205
1994
Earlier work this paper cites.
I. Csiszár, “Generalized cutoff rates and Rényi’s information measures,” IEEE Trans. Inf. Theory , vol. 41, no. 1, pp. 26–34, Jan. 1995
1995
Earlier work this paper cites.
N. Tishby, F. C. Pereira, and W. Bialek, “The information bottleneck method,” in Proc. of Allerton Conf. Comm. Control and Compiting , 1999, pp. 368–377
1999
Earlier work this paper cites.
A. V. Evfimievski, J. Gehrke, and R. Srikant, “Limiting privacy breaches in privacy preserving data mining,” in Proc. of the Twenty-Second Symposium on Principles of Database Systems , 2003, pp. 211–222
2003
Earlier work this paper cites.
W. Bryc, A. Dembo, and A. Kagan, “On the maximum correlation coefficient,” Theory Probab. Appl. , vol. 49, no. 1, pp. 132–138, Mar. 2005
2005
Earlier work this paper cites.
C. Dwork, “Differential privacy: a survey of results,” Lecture Notes in Computer Science, Theory and Applications of Models of Computation, , no. 4978, pp. 1–19, 2008
2008
Cited alongside, same era.
G. Smith, “On the foundations of quantitative information flow,” in Proc. of the 12th Int. Conf. on Foundations of Software Science and Computational Structures , ser. FOSSACS ’09. Berlin, Heidelberg: Springer-Verlag, 2009
2009
Cited alongside, same era.
C. Braun, K. Chatzikokolakis, and C. Palamidessi, “Quantitative notions of leakage for one-try attacks,” Electronic Notes in Theoretical Computer Science , vol. 249, pp. 75 – 91, 2009
2009
Cited alongside, same era.
G. Barthe and B. Kopf, “Information-theoretic bounds for differentially private mechanisms,” in Proc. IEEE 24th Computer Security Foundations Symposium , June 2011, pp. 191–204
2011
Cited alongside, same era.
S. Asoodeh, F. Alajaji, and T. Linder, “Notes on information-theoretic privacy,” in Proc. 52nd Annual Allerton Conference on Communication, Control, and Computing , Sept. 2014, pp. 1272–1278
2014
Later among the works it cites.
J. C. Duchi, M. I. Jordan, and M. J. Wainwright, “Privacy aware learning,” Journal of the Association for Computing Machinery (ACM) , vol. 61, no. 6, Dec. 2014
2014
Later among the works it cites.
S. Verdú, “ α \alpha -mutual information,” in Proc. Information Theory and Applications Workshop (ITA), 2015 , Feb. 2015, pp. 1–6
2015
Later among the works it cites.
F. P. Calmon, A. Makhdoumi, and M. Médard, “Fundamental limits of perfect privacy,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , 2015, pp. 1796–1800
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems . Cambridge University Press, 2011
2011
Cited alongside, same era.
W. Kang and S. Ulukus, “A new data processing inequality and its applications in distributed source and channel coding,” IEEE Trans. Inf. Theory , vol. 57, no. 1, pp. 56–69, Jan. 2011
2011
Cited alongside, same era.
D. Guo, Y. Wu, S. Shamai, and S. Verdú, “Estimation in Gaussian noise: properties of the minimum mean-square error,” IEEE Trans. Inf. Theory , vol. 57, no. 4, pp. 2371–2385, April 2011
2011
Cited alongside, same era.
2012
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 Proc. 51st Annual Allerton Conference on Communication, Control, and Computing , Oct 2013, pp. 567–574
2013
Cited alongside, same era.
A. Makhdoumi and N. Fawaz, “Privacy-utility tradeoff under statistical uncertainty,” in Proc. 51st Allerton Conference on Communication, Control, and Computing , Oct 2013, pp. 1627–1634
2013
Cited alongside, same era.
L. Sankar, S. Rajagopalan, and H. Poor, “Utility-privacy tradeoffs in databases: An information-theoretic approach,” IEEE Trans. Inform. Forensics Security, , vol. 8, no. 6, pp. 838–852, June 2013
2013
Cited alongside, same era.
L. Sankar, S. R. Rajagopalan, and S. Mohajer, “Smart meter privacy: A theoretical framework,” IEEE Trans. on Smart Grid , vol. 4, no. 2, pp. 837–846, June 2013
2013
Cited alongside, same era.
2015
Later among the works it cites.
F. P. Calmon, “Information-theoretic metrics for security and privacy,” Ph.D. dissertation, MIT, Sep. 2015
2015
Later among the works it cites.
I. Issa, S. Kamath, and A. B. Wagner, “An operational measure of information leakage,” in Proc. Annual Conference on Information Science and Systems (CISS) , March 2016, pp. 234–239
2016
Later among the works it cites.
S. Asoodeh, M. Diaz, F. Alajaji, and T. Linder, “Privacy-aware guessing efficiency,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , June 2017
2017
Closest in time.
S. Asoodeh, “Information and estimation theoretic approaches to data privacy,” Ph.D. dissertation, Queen’s University, May 2017
2017
Closest in time.
F. P. Calmon, A. Makhdoumi, M. Médard, M. Varia, M. Christiansen, and K. R. Duffy, “Principal inertia components and applications,” IEEE Trans. Inf. Theory , vol. 63, no. 8, pp. 5011–5038, May 2017
2017
Closest in time.
J. Liao, L. Sankar, F. P. Calmon, and V. Y. Tan, “Hypothesis testing under maximal leakage privacy constraints,” in Proc. IEEE Int. Sym. on Inf. Theory (ISIT) , June 2017
2017
Closest in time.
2018
Closest in time.
J. Liao, L. Sankar, V. Y. Tan, and F. P. Calmon, “Hypothesis testing under mutual information privacy constraints in the high privacy regime,” IEEE Trans. Inf. Forensics Security , vol. 13, no. 4, pp. 1058–1071, April 2018
2018
Closest in time.
S. Asoodeh, M. Diaz, F. Alajaji, and T. Linder, “Information extraction under privacy constraints,” Information , vol. 7, 2016. [Online]. Available: http://www.mdpi.com/2078-2489/7/1/15
2078
Closest in time.