Mirror descent based database privacy

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7408 LNCS, Issue , 2012, Pages 579-590

  Jain, Prateek ^a   Thakurta, Abhradeep ^b  

^a MICROSOFT RESEARCH   (United States)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITE GRAPHS; CONCRETE APPLICATIONS; CONVEX OPTIMIZATION ALGORITHMS; DATA SETS; DATABASE CONSTRUCTION; ERROR BOUND; LOW-RANK MATRICES; PRIVACY PRESERVING; PRIVATE DATABASE;

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; ERROR ANALYSIS; MIRRORS;

QUERY LANGUAGES;

EID: 84865295538     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-32512-0_49     Document Type: Conference Paper

References (22)

1. Beck, A., Teboulle, M.: Mirror descent and nonlinear projected subgradient methods for convex optimization. Oper. Res. Lett. 31(3), 167-175 (2003)
2. Blum, A., Ligett, K., Roth, A.: A learning theory approach to non-interactive database privacy. In: STOC (2008)
3. Candes, E.J., Tao, T.: Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Transactions on Information Theory (2006)
4. Dinur, I., Dwork, C., Nissim, K.: Revealing information while preserving privacy, full version of [5] (2010) (in preparation)
5. Dinur, I., Nissim, K.: Revealing information while preserving privacy. In: PODS, pp. 202-210. ACM (2003)
6. Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our Data, Ourselves: Privacy Via Distributed Noise Generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 486-503. Springer, Heidelberg (2006)
7. Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating Noise to Sensitivity in Private Data Analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265-284. Springer, Heidelberg (2006)
8. Dwork, C., McSherry, F., Talwar, K.: The price of privacy and the limits of LP decoding. In: STOC, pp. 85-94. ACM (2007)
9. Dwork, C., Rothblum, G.N., Vadhan, S.P.: Boosting and differential privacy. In: FOCS (2010)
10. Frieze, A.M., Kannan, R.: A simple algorithm for constructing szemere'di's regularity partition. Electr. J. Comb. (1999)
11. Ganta, S.R., Kasiviswanathan, S.P., Smith, A.: Composition attacks and auxiliary information in data privacy. In: KDD 2008: Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 265-273. ACM (2008)
12. Gupta, A., Hardt, M., Roth, A., Ullman, J.: Privately releasing conjunctions and the statistical query barrier. In: STOC (2011)
13. Gupta, A., Roth, A., Ullman, J.: Iterative constructions and private data release. CoRR, abs/1107.3731 (2011)
14. Hardt, M., Ligett, K., McSherry, F.: A simple and practical algorithm for differentially private data release. CoRR, abs/1012.4763 (2010)
15. Hardt, M., Rothblum, G.N.: A multiplicative weights mechanism for privacy-preserving data analysis. In: FOCS (2010)
16. Jain, P., Thakurta, A.: Mirror descent based database privacy. Technical Report NAS-TR-0159-2012, Pennsylvania State University (April 2012)
17. Kakade, S.M., Shalev-Shwartz, S., Tewari, A.: On the duality of strong convexity and strong smoothness: Learning applications and matrix regularization. Informal Publication (2009)
18. Kasiviswanathan, S.P., Lee, H.K., Nissim, K., Raskhodnikova, S., Smith, A.: What can we learn privately? In: FOCS (2008)
19. Roth, A., Roughgarden, T.: Interactive privacy via the median mechanism. In: STOC (2010)
20. Srebro, N., Sridharan, K., Tewari, A.: On the universality of online mirror descent. CoRR, abs/1107.4080 (2011)
21. Vershynin, R.: Introduction to the non-asymptotic analysis of random matrices. CoRR, abs/1011.3027 (2010)
22. Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society, Series B 68, 49-67 (2007)