Privacy Against Brute-Force Inference Attacks

W. Huleihel, S. Salamatian, and M. Médard, “Guessing with limited memory,” in 2017 IEEE International Symposium on Information Theory (ISIT) , June 2017, pp. 2253–2257

Original

1902

Earlier work this paper cites.

J. L. Massey, “Guessing and entropy,” in Proceedings of 1994 IEEE International Symposium on Information Theory , June 1994, pp. 204–

1994

Earlier work this paper cites.

E. Arikan, “An inequality on guessing and its application to sequential decoding,” IEEE Transactions on Information Theory , vol. 42, no. 1, pp. 99–105, Jan 1996

1996

Earlier work this paper cites.

B. Jansen, J. De Jong, C. Roos, and T. Terlaky, “Sensitivity analysis in linear programming: just be careful!” European Journal of Operational Research , vol. 101, no. 1, pp. 15–28, 1997

1997

Earlier work this paper cites.

N. Merhav and E. Arikan, “The shannon cipher system with a guessing wiretapper,” IEEE Transactions on Information Theory , vol. 45, no. 6, pp. 1860–1866, 1999

1999

Earlier work this paper cites.

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

2002

Earlier work this paper cites.

C. Dwork, “Differential privacy,” in International Colloquium on Automata, Languages and Programming , 2006, pp. 1–12

2006

Earlier work this paper cites.

Y. Rachlin, K. Probst, and R. Ghani, “Maximizing privacy under data distortion constraints in noise perturbation methods,” in Privacy, security, and trust in KDD . Springer, 2009, pp. 92–110

2009

Cited alongside, same era.

M. K. Hanawal and R. Sundaresan, “Guessing revisited: A large deviations approach,” IEEE Transactions on Information Theory , vol. 57, no. 1, pp. 70–78, 2011

2011

Cited alongside, same era.

P. G. Kelley, S. Komanduri, M. L. Mazurek, R. Shay, T. Vidas, L. Bauer, N. Christin, L. F. Cranor, and J. Lopez, “Guess again (and again and again): Measuring password strength by simulating password-cracking algorithms,” in Security and Privacy (SP), 2012 IEEE Symposium on . IEEE, 2012, pp. 523–537

2012

Cited alongside, same era.

F. du Pin Calmon and N. Fawaz, “Privacy against statistical inference,” in Communication, Control, and Computing (Allerton), 2012 50th Annual Allerton Conference on . IEEE, 2012, pp. 1401–1408

2012

Cited alongside, same era.

M. M. Christiansen, K. R. Duffy, F. du Pin Calmon, and M. Médard, “Multi-user guesswork and brute force security,” IEEE Transactions on Information Theory , vol. 61, no. 12, pp. 6876–6886, 2015

2015

Later among the works it cites.

A. Beirami, R. Calderbank, K. Duffy, and M. Médard, “Quantifying computational security subject to source constraints, guesswork and inscrutability,” in Information Theory (ISIT), 2015 IEEE International Symposium on . IEEE, 2015, pp. 2757–2761

2015

Later among the works it cites.

B. Ur, S. M. Segreti, L. Bauer, N. Christin, L. F. Cranor, S. Komanduri, D. Kurilova, M. L. Mazurek, W. Melicher, and R. Shay, “Measuring real-world accuracies and biases in modeling password guessability.” in USENIX Security Symposium , 2015, pp. 463–481

2015

Later among the works it cites.

Y. Wang, Y. O. Basciftci, and P. Ishwar, “Privacy-utility tradeoffs under constrained data release mechanisms,” CoRR , vol. abs/1710.09295, 2017. [Online]. Available: http://arxiv.org/abs/1710.09295

Original