A methodology for formalizing model-inversion attacks

Proceedings - IEEE Computer Security Foundations Symposium

Volumn 2016-August, Issue , 2016, Pages 355-370

  Wu, Xi ^a   Fredrikson, Matthew ^b   Jha, Somesh ^a   Naughton, Jeffrey F ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA; SECURITY SYSTEMS;

ADDITIONAL KNOWLEDGE; AMOUNT OF INFORMATION; COMPUTATIONAL POWER; FORMAL STUDIES; MACHINE LEARNING MODELS; MODEL INVERSION; SEQUENTIAL COMPOSITIONS; TRAINING DATA;

MACHINE LEARNING;

EID: 84985942536     PISSN: 19401434     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSF.2016.32     Document Type: Conference Paper

References (22)

1. C. Dwork, F. McSherry, K. Nissim, and A. Smith, "Calibrating noise to sensitivity in private data analysis, " in TCC, 2006, pp. 265-284.
2. C. Dwork, A. D. Smith, T. Steinke, J. Ullman, and S. P. Vadhan, "Robust traceability from trace amounts, " in IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October, 2015, 2015, pp. 650-669.
3. A. McGregor, I. Mironov, T. Pitassi, O. Reingold, K. Talwar, and S. P. Vadhan, "The limits of two-party differential privacy, " Electronic Colloquium on Computational Complexity (ECCC), vol. 18, p. 106, 2011.
4. I. Dinur and K. Nissim, "Revealing information while preserving privacy, " in Proceedings of the Twenty-Second ACM SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA, 2003, pp. 202-210.
5. S. P. Kasiviswanathan, M. Rudelson, and A. Smith, "The power of linear reconstruction attacks, " in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana, USA, January 6-8, 2013, 2013, pp. 1415-1433.
6. M. Fredrikson, E. Lantz, S. Jha, S. Lin, D. Page, and T. Ristenpart, "Privacy in pharmacogenetics: An end-to-end case study of personalized warfarin dosing, " in Proceedings of the 23rd USENIX Security Symposium, San Diego, CA, USA, August 20-22, 2014., 2014, pp. 17-32.
7. M. Fredrikson, S. Jha, and T. Ristenpart, "Model inversion attacks that exploit confidence information and basic countermeasures, " in Proceedings of the 22nd ACM conference on Computer and communications security, 2015.
8. M. Daneshi and J. Guo, "Image reconstruction based on local feature descriptors, " Dept. Elect. Eng., Stanford Univ., Stanford, CA, USA, Tech. Rep, 2011.
9. E. d'Angelo, L. Jacques, A. Alahi, and P. Vandergheynst, "From bits to images: Inversion of local binary descriptors, " CoRR, vol. abs/1211.1265, 2012.
10. H. Kato and T. Harada, "Image reconstruction from bag-ofvisual-words, " in 2014 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2014, Columbus, OH, USA, June 23-28, 2014, 2014, pp. 955-962.
11. R. O'Donnell, Analysis of Boolean Functions. Cambridge University Press, 2014.
12. C. Damm, S. Jukna, and J. Sgall, "Some bounds on multiparty communication complexity of pointer jumping, " Computational Complexity, vol. 7, no. 2, pp. 109-127, 1998.
13. A. Chakrabarti, "Lower bounds for multi-player pointer jumping, " in 22nd Annual IEEE Conference on Computational Complexity (CCC 2007), 13-16 June 2007, San Diego, California, USA, 2007, pp. 33-45.
14. M. Braverman, F. Ellen, R. Oshman, T. Pitassi, and V. Vaikuntanathan, "Tight bounds for set disjointness in the message passing model, " CoRR, vol. abs/1305.4696, 2013.
15. M. J. Fischer, N. A. Lynch, and M. Paterson, "Impossibility of distributed consensus with one faulty process, " J. ACM, vol. 32, no. 2, pp. 374-382, 1985.
16. R. M. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking, "Randomized rumor spreading, " in 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, 2000, pp. 565-574.
17. D. Kempe, A. Dobra, and J. Gehrke, "Gossip-based computation of aggregate information, " in 44th Symposium on Foundations of Computer Science (FOCS 2003), 11-14 October 2003, Cambridge, MA, USA, Proceedings, 2003, pp. 482-491.
18. A. Ganor and R. Raz, "Space pseudorandom generators by communication complexity lower bounds, " in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain, 2014, pp. 692-703.
19. O. Goldreich, The Foundations of Cryptography -Volume 1, Basic Techniques. Cambridge University Press, 2001.
20. -, The Foundations of Cryptography -Volume 2, Basic Applications. Cambridge University Press, 2004.
21. Y. Huang, J. Katz, and D. Evans, "Quid-pro-quo-tocols: Strengthening semi-honest protocols with dual execution, " in IEEE Symposium on Security and Privacy, SP 2012, 21-23 May 2012, San Francisco, California, USA, 2012, pp. 272-284.
22. D. Ron, R. Rubinfeld, M. Safra, A. Samorodnitsky, and O. Weinstein, "Approximating the influence of monotone boolean functions in o(n) query complexity, " TOCT, vol. 4, no. 4, p. 11, 2012.