Fetching the paper…
Reading the bibliography…
Perfect data privacy seems to be in fundamental opposition to the economical and scientific opportunities associated with extensive data exchange.
M. Hellman and J. Raviv, “Probability of error, equivocation, and the chernoff bound,” IEEE Transactions on Information Theory , vol. 16, no. 4, pp. 368–372, 1970
1970
Earlier work this paper cites.
T. Dalenius, “Towards a methodology for statistical disclosure control,” statistik Tidskrift , vol. 15, no. 429-444, pp. 2–1, 1977
1977
Earlier work this paper cites.
K. G. Murty, Linear Programming . John Wiley and Sons, 1983
1983
Earlier work this paper cites.
M. Feder and N. Merhav, “Relations between entropy and error probability,” IEEE Transactions on Information Theory , vol. 40, no. 1, pp. 259–266, 1994
1994
Earlier work this paper cites.
D. Bertsimas and J. N. Tsitsiklis, Introduction to linear optimization . Athena Scientic, 1997
1997
Earlier work this paper cites.
C. Dwork, “Differential privacy,” in Automata, Languages and Programming , M. Bugliesi, B. Preneel, V. Sassone, and I. Wegener, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 1–12
2006
Earlier work this paper cites.
C. M. Bishop, Pattern Recognition and Machine Learning (Information Science and Statistics) . Berlin, Heidelberg: Springer-Verlag, 2006
2006
Earlier work this paper cites.
T. Li and N. Li, “On the tradeoff between privacy and utility in data publishing,” in Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining . ACM, 2009, pp. 517–526
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,” IEEE Trans. Knowl., Data Eng. , vol. 22, no. 11, pp. 1623–1636, Nov. 2010
2010
Earlier work this paper cites.
J. Lee and C. Clifton, “How much is enough? choosing ε \varepsilon for differential privacy,” in International Conference on Information Security . Springer, 2011, pp. 325–340
2011
Earlier work this paper cites.
J. Gehrke, E. Lui, and R. Pass, “Towards privacy for social networks: A zero-knowledge based definition of privacy,” in Theory of Cryptography Conference . Springer, 2011, pp. 432–449
2011
Earlier work this paper cites.
F. Calmon and N. Fawaz, “Privacy against statistical inference,” in 50th Annual Allerton Conference , Illinois, USA, Oct. 2012, pp. 1401–1407
2012
Cited alongside, same era.
J. Jacod and P. Protter, Probability essentials . Springer Science & Business Media, 2012
2012
Cited alongside, same era.
A. E. Gamal and Y.-H. Kim, Network Information Theory . Cambridge University Press, 2012
2012
Cited alongside, same era.
N. Li, W. Qardaji, D. Su, Y. Wu, and W. Yang, “Membership privacy: a unifying framework for privacy definitions,” in Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security . ACM, 2013, pp. 889–900
2013
Cited alongside, same era.
A. Gelman, H. S. Stern, J. B. Carlin, D. B. Dunson, A. Vehtari, and D. B. Rubin, Bayesian data analysis . Chapman and Hall/CRC, 2013
2013
Cited alongside, same era.
F. Calmon, A. Makhdoumi, and M. Médard, “Fundamental limits of perfect privacy,” in IEEE Int. Symp. Inf. Theory (ISIT) , 2015, pp. 1796–1800
2015
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 Information Theory and Applications Workshop (ITA) , Jan 2016, pp. 1–6
2016
Later among the works it cites.
F. Rosas, V. Ntranos, C. J. Ellison, S. Pollin, and M. Verhelst, “Understanding interdependency through complex information sharing,” Entropy , vol. 18, no. 2, p. 38, 2016
2016
Later among the works it cites.
I. Issa, S. Kamath, and A. B. Wagner, “An operational measure of information leakage,” in 2016 Annual Conference on Information Science and Systems (CISS) . IEEE, 2016, pp. 234–239
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. Dwork, A. Roth et al. , “The algorithmic foundations of differential privacy,” Foundations and Trends® in Theoretical Computer Science , vol. 9, no. 3–4, pp. 211–407, 2014
2014
Cited alongside, same era.
S. Shalev-Shwartz and S. Ben-David, Understanding machine learning: From theory to algorithms . Cambridge university press, 2014
2014
Cited alongside, same era.
A. Makhdoumi, S. Salamatian, N. Fawaz, and M. Médard, “From the information bottleneck to the privacy funnel,” in IEEE Information Theory Workshop (ITW) , 2014, pp. 501–505
2014
Cited alongside, same era.
S. Asoodeh, F. Alajaji, and T. Linder, “Notes on information-theoretic privacy,” in 52nd Annual Allerton Conference , Illinois, USA, Oct. 2014, pp. 1272–1278
2014
Cited alongside, same era.
D. Kifer and A. Machanavajjhala, “Pufferfish: A framework for mathematical privacy definitions,” ACM Transactions on Database Systems (TODS) , vol. 39, no. 1, p. 3, 2014
2014
Cited alongside, same era.
G. Georgiev. Gdpr compliance cost. [Online]. Available: https://www.gigacalculator.com/calculators/gdpr-compliance-cost-calculator.php
Cited in the paper.
2016
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
C. Cadwalladr and E. Graham-Harrison, “Revealed: 50 million facebook profiles harvested for cambridge analytica in major data breach,” The Guardian , vol. 17, 2018
2018
Later among the works it cites.
B. Rassouli and D. Gündüz, “Optimal utility-privacy trade-off with the total variation distance as the privacy measure,” in IEEE Information Theory Workshop (ITW), 2018 , accepted for publication
2018
Later among the works it cites.
B. Rassouli, F. Rosas, and D. Gündüz, “Latent feature disclosure under perfect sample privacy,” in 2018 IEEE International Workshop on Information Forensics and Security (WIFS) . IEEE, 2018, pp. 1–7
2018
Later among the works it cites.