参考文献

License: CC BY-NC-ND 4.0

  1. S. Arora, E. Hazan, and S. Kale. The multiplicative weights update method: A meta-algorithm and applications. Theory of Computing, 8(1):121–164, 2012.
  2. M.-F. Balcan, A. Blum, J. D. Hartline, and Y. Mansour. Mechanism design via machine learning. In Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on, pages 605–614. IEEE, 2005.
  3. A. Beimel, S. P. Kasiviswanathan, and K. Nissim. Bounds on the sample complexity for private learning and private data release. In Theory of Cryptography, pages 437–454. Springer, 2010.
  4. A. Beimel, K. Nissim, and U. Stemmer. Characterizing the sample complexity of private learners. In Proceedings of the Conference on Innovations in Theoretical Computer Science, pages 97–110. Association for Computing Machinery, 2013.
  5. A. Bhaskara, D. Dadush, R. Krishnaswamy, and K. Talwar. Unconditional differentially private mechanisms for linear queries. In H. J. Karloff and T. Pitassi, editors, Proceedings of the Symposium on Theory of Computing Conference, Symposium on Theory of Computing, New York, NY, USA, May 19–22, 2012, pages 1269–1284. 2012.
  6. A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: the SuLQ framework. In Chen Li, editor, Principles of Database Systems, pages 128–138. ACM, 2005.
  7. A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: the sulq framework. In Principles of Database Systems. 2005.
  8. A. Blum, K. Ligett, and A. Roth. A learning theory approach to noninteractive database privacy. In Cynthia Dwork, editor, Symposium on Theory of Computing, pages 609–618. Association for Computing Machinery, 2008.
  9. A. Blum and Y. Monsour. Learning, regret minimization, and equilibria, 2007.
  10. J. L. Casti. Five Golden Rules: Great Theories of 20th-Century Mathematics and Why They Matter. Wiley, 1996.
  11. T. H. Hubert Chan, E. Shi, and D. Song. Private and continual release of statistics. In Automata, Languages and Programming, pages 405–417. Springer, 2010.
  12. K. Chaudhuri and D. Hsu. Sample complexity bounds for differentially private learning. In Proceedings of the Annual Conference on Learning Theory (COLT 2011). 2011.
  13. K. Chaudhuri, C. Monteleoni, and A. D. Sarwate. Differentially private empirical risk minimization. Journal of machine learning research: JMLR, 12:1069, 2011.
  14. K. Chaudhuri, A. Sarwate, and K. Sinha. Near-optimal differentially private principal components. In Advances in Neural Information Processing Systems 25, pages 998–1006. 2012.
  15. Y. Chen, S. Chong, I. A. Kash, T. Moran, and S. P. Vadhan. Truthful mechanisms for agents that value privacy. Association for Computing Machinery Conference on Electronic Commerce, 2013.
  16. P. Dandekar, N. Fawaz, and S. Ioannidis. Privacy auctions for recommender systems. In Internet and Network Economics, pages 309–322. Springer, 2012.
  17. A. De. Lower bounds in differential privacy. In Theory of Cryptography Conference, pages 321–338. 2012.
  18. I. Dinur and K. Nissim. Revealing information while preserving privacy. In Proceedings of the Association for Computing Machinery SIGACTSIGMOD-SIGART Symposium on Principles of Database Systems, pages 202–210. 2003.
  19. J. C. Duchi, M. I. Jordan, and M. J. Wainwright. Local privacy and statistical minimax rates. arXiv preprint arXiv:1302.3203, 2013.
  20. C. Dwork. Differential privacy. In Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP)(2), pages 1–12. 2006.
  21. C. Dwork, K. Kenthapadi, F. McSherry, I. Mironov, and M. Naor. Our data, ourselves: Privacy via distributed noise generation. In EUROCRYPT, pages 486–503. 2006.
  22. C. Dwork and J. Lei. Differential privacy and robust statistics. In Proceedings of the 2009 International Association for Computing Machinery Symposium on Theory of Computing (STOC). 2009.
  23. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In Theory of Cryptography Conference ’06, pages 265–284. 2006.
  24. C. Dwork, F. McSherry, and K. Talwar. The price of privacy and the limits of lp decoding. In Proceedings of the Association for Computing Machinery Symposium on Theory of Computing, pages 85–94. 2007.
  25. C. Dwork and M. Naor. On the difficulties of disclosure prevention in statistical databases or the case for differential privacy. Journal of Privacy and Confidentiality, 2010.
  26. C. Dwork, M. Naor, T. Pitassi, and G. N. Rothblum. Differential privacy under continual observation. In Proceedings of the Association for Computing Machinery Symposium on Theory of Computing, pages 715–724. Association for Computing Machinery, 2010.
  27. C. Dwork, M. Naor, T. Pitassi, G. N. Rothblum, and Sergey Yekhanin. Pan-private streaming algorithms. In Proceedings of International Conference on Super Computing. 2010.
  28. C. Dwork, M. Naor, O. Reingold, G. N. Rothblum, and S. P. Vadhan. On the complexity of differentially private data release: Efficient algorithms and hardness results. In Symposium on Theory of Computing ’09, pages 381–390. 2009.
  29. C. Dwork, M. Naor, and S. Vadhan. The privacy of the analyst and the power of the state. In Foundations of Computer Science. 2012.
  30. C. Dwork, A. Nikolov, and K. Talwar. Efficient algorithms for privately releasing marginals via convex relaxations. In Proceedings of the Annual Symposium on Computational Geometry (SoCG). 2014.
  31. C. Dwork and K. Nissim. Privacy-preserving datamining on vertically partitioned databases. In Proceedings of Cryptology 2004, vol. 3152, pages 528–544. 2004.
  32. C. Dwork, G. N. Rothblum, and S. P. Vadhan. Boosting and differential privacy. In Foundations of Computer Science, pages 51–60. 2010.
  33. C. Dwork, K. Talwar, A. Thakurta, and L. Zhang. Analyze gauss: Optimal bounds for privacy-preserving pca. In Symposium on Theory of Computing. 2014.
  34. L. Fleischer and Y.-H. Lyu. Approximately optimal auctions for selling privacy when costs are correlated with data. In Association for Computing Machinery Conference on Electronic Commerce, pages 568–585. 2012.
  35. A. Ghosh and K. Ligett. Privacy and coordination: Computing on databases with endogenous participation. In Proceedings of the fourteenth ACM conference on Electronic commerce (EC), pages 543–560, 2013.
  36. A. Ghosh and A. Roth. Selling privacy at auction. In Association for Computing Machinery Conference on Electronic Commerce, pages 199– 208. 2011.
  37. A. Groce, J. Katz, and A. Yerukhimovich. Limits of computational differential privacy in the client/server setting. In Proceedings of the Theory of Cryptography Conference. 2011.
  38. A. Gupta, M. Hardt, A. Roth, and J. Ullman. Privately releasing conjunctions and the statistical query barrier. In Symposium on Theory of Computing ’11, pages 803–812. 2011.
  39. A. Gupta, A. Roth, and J. Ullman. Iterative constructions and private data release. In Theory of Cryptography Conference, pages 339–356. 2012.
  40. J. Håstad, R. Impagliazzo, L. Levin, and M. Luby. A pseudorandom generator from any one-way function. SIAM Journal of Computing, 28, 1999.
  41. M. Hardt, K. Ligett, and F. McSherry. A simple and practical algorithm for differentially private data release. In Advances in Neural Information Processing Systems 25, pages 2348–2356. 2012.
  42. M. Hardt and A. Roth. Beating randomized response on incoherent matrices. In Proceedings of the Symposium on Theory of Computing, pages 1255–1268. Association for Computing Machinery, 2012.
  43. M. Hardt and A. Roth. Beyond worst-case analysis in private singular vector computation. In Proceedings of the Symposium on Theory of Computing. 2013.
  44. M. Hardt and G. N. Rothblum. A multiplicative weights mechanism for privacy-preserving data analysis. In Foundations of Computer Science, pages 61–70. IEEE Computer Society, 2010.
  45. M. Hardt and K. Talwar. On the geometry of differential privacy. In Proceedings of the Association for Computing Machinery Symposium on Theory of Computing, pages 705–714. Association for Computing Machinery, 2010.
  46. N. Homer, S. Szelinger, M. Redman, D. Duggan, W. Tembe, J. Muehling, J. Pearson, D. Stephan, S. Nelson, and D. Craig. Resolving individuals contributing trace amounts of dna to highly complex mixtures using highdensity snp genotyping microarrays. PLoS Genet, 4, 2008.
  47. J. Hsu, Z. Huang, A. Roth, T. Roughgarden, and Z. S. Wu. Private matchings and allocations. arXiv preprint arXiv:1311.2828, 2013.
  48. J. Hsu, A. Roth, and J. Ullman. Differential privacy for the analyst via private equilibrium computation. In Proceedings of the Association for Computing Machinery Symposium on Theory of Computing (STOC), pages 341–350, 2013.
  49. Z. Huang and S. Kannan. The exponential mechanism for social welfare: Private, truthful, and nearly optimal. In IEEE Annual Symposium on the Foundations of Computer Science (FOCS), pages 140–149. 2012.
  50. P. Jain, P. Kothari, and A. Thakurta. Differentially private online learning. Journal of Machine Learning Research — Proceedings Track, 23:24.1–24.34, 2012.
  51. M. Kapralov and K. Talwar. On differentially private low rank approximation. In Sanjeev Khanna, editor, Symposium on Discrete Algorthims, pages 1395–1414. SIAM, 2013.
  52. S. P. Kasiviswanathan, H. K. Lee, Kobbi Nissim, S. Raskhodnikova, and A. Smith. What can we learn privately? SIAM Journal on Computing, 40(3):793–826, 2011.
  53. M.Kearns.Efficientnoise-tolerantlearningfromstatisticalqueries.Journal of the Association for Computing Machinery (JAssociation for Computing Machinery), 45(6):983–1006, 1998.
  54. M. Kearns, M. Pai, A. Roth, and J. Ullman. Mechanism design in large games: Incentives and privacy. In Proceedings of the 5th conference on Innovations in theoretical computer science (ITCS), 2014.
  55. D. Kifer, A. Smith, and A. Thakurta. Private convex empirical risk minimization and high-dimensional regression. Journal of Machine Learning Research, 1:41, 2012.
  56. K. Ligett and A. Roth. Take it or leave it: Running a survey when privacy comes at a cost. In Internet and Network Economics, pages 378–391. Springer, 2012.
  57. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. In Annual Symposium on Foundations of Computer Science, 1989, pages 256–261. IEEE, 1989.
  58. A. McGregor, I. Mironov, T. Pitassi, O. Reingold, K. Talwar, and S. P. Vadhan. The limits of two-party differential privacy. In Foundations of Computer Science, pages 81–90. IEEE Computer Society, 2010.
  59. F. McSherry. Privacy integrated queries (codebase). Available on Microsoft Research downloads website. See also the Proceedings of SIGMOD 2009.
  60. F. McSherry and K. Talwar. Mechanism design via differential privacy. In Foundations of Computer Science, pages 94–103. 2007.
  61. F. McSherry and K. Talwar. Mechanism design via differential privacy. In Foundations of Computer Science, pages 94–103. 2007.
  62. D. Mir, S. Muthukrishnan, A. Nikolov, and R. N. Wright. Pan-private algorithms via statistics on sketches. In Proceedings of the Association for Computing Machinery SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pages 37–48. Association for Computing Machinery, 2011.
  63. I. Mironov. On significance of the least significant bits for differential privacy. In T. Yu, G. Danezis, and V. D. Gligor, editors, Association for Computing Machinery Conference on Computer and Communications Security, pages 650–661. Association for Computing Machinery, 2012.
  64. I. Mironov, O. Pandey, O. Reingold, and S. P. Vadhan. Computational differential privacy. In Proceedings of CRYPTOLOGY, pages 126–142. 2009.
  65. A. Narayanan and V. Shmatikov. Robust de-anonymization of large sparse datasets (how to break anonymity of the netflix prize dataset). In Proceedings of IEEE Symposium on Security and Privacy. 2008.
  66. A. Nikolov, K. Talwar, and L. Zhang. The geometry of differential privacy: the sparse and approximate cases. Symposium on Theory of Computing, 2013.
  67. K. Nissim, C. Orlandi, and R. Smorodinsky. Privacy-aware mechanism design. In Association for Computing Machinery Conference on Electronic Commerce, pages 774–789. 2012.
  68. K. Nissim, S. Raskhodnikova, and A. Smith. Smooth sensitivity and sampling in private data analysis. In Proceedings of the Association for Computing Machinery Symposium on Theory of Computing, pages 75–84. 2007.
  69. K. Nissim, R. Smorodinsky, and M. Tennenholtz. Approximately optimal mechanism design via differential privacy. In Innovations in Theoretical Computer Science, pages 203–213. 2012.
  70. M.PaiandA.Roth.Privacyandmechanismdesign.SIGecomExchanges, 2013.
  71. R. Rogers and A. Roth. Asymptotically truthful equilibrium selection in large congestion games. arXiv preprint arXiv:1311.2625, 2013.
  72. A. Roth. Differential privacy and the fat-shattering dimension of linear queries. In Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, pages 683–695. Springer, 2010.
  73. A. Roth. Buying private data at auction: the sensitive surveyor’s problem. Association for Computing Machinery SIGecom Exchanges, 11(1):1– 8, 2012.
  74. A. Roth and T. Roughgarden. Interactive privacy via the median mechanism. In Symposium on Theory of Computing ’10, pages 765–774. 2010.
  75. A. Roth and G. Schoenebeck. Conducting truthful surveys, cheaply. In Proceedings of the ACM Conference on Electronic Commerce, pages 826– 843. 2012.
  76. B. I. P. Rubinstein, P. L. Bartlett, L. Huang, and N. Taft. Learning in a large function space: Privacy-preserving mechanisms for svm learning. arXiv preprint arXiv:0911.5708, 2009.
  77. R. Schapire. The boosting approach to machine learning: An overview. In D. D. Denison, M. H. Hansen, C. Holmes, B. Mallick, and B. Yu, editors, Nonlinear Estimation and Classification. Springer, 2003.
  78. R. Schapire and Y. Singer. Improved boosting algorithms using confidence-rated predictions. Machine Learning, 39:297–336, 1999.
  79. R. E. Schapire and Y. Freund. Boosting: Foundations and Algorithms. MIT Press, 2012.
  80. A. Smith and A. G. Thakurta. Differentially private feature selection via stability arguments, and the robustness of the lasso. In Proceedings of Conference on Learning Theory. 2013.
  81. L. Sweeney. Weaving technology and policy together to maintain confidentiality. Journal of Law, Medicines Ethics, 25:98–110, 1997.
  82. J. Ullman. Answering n{2+o(1)} counting queries with differential privacy is hard. In D. Boneh, T. Roughgarden, and J. Feigenbaum, editors, Symposium on Theory of Computing, pages 361–370. Association for Computing Machinery, 2013.
  83. L. G. Valiant. A theory of the learnable. Communications of the Association for Computing Machinery, 27(11):1134–1142, 1984.
  84. S. L. Warner. Randomized response: A survey technique for eliminating evasive answer bias. Journal of the American Statistical Association, 60(309):63–69, 1965.
  85. D. Xiao. Is privacy compatible with truthfulness? In Proceedings of the Conference on Innovations in Theoretical Computer Science, pages 67–86. 2013.