Now showing items 1-4 of 4

    • Faster Algorithms for Privately Releasing Marginals 

      Thaler, Justin R; Ullman, Jonathan Robert; Vadhan, Salil P. (Springer Verlag, 2012)
      We study the problem of releasing k-way marginals of a database D ∈ {0,1}d)n, while preserving differential privacy. The an- swer to a k-way marginal query is the fraction of D’s records x ∈ {0, 1}d with a given value in ...
    • Fingerprinting codes and the price of approximate differential privacy 

      Bun, Mark Mar; Ullman, Jonathan; Vadhan, Salil P. (Association of Computing Machinery, 2014)
      We show new lower bounds on the sample complexity of (ε, δ)-differentially private algorithms that accurately answer large sets of counting queries. A counting query on a database D ∈ ({0, 1}d)n has the form "What fraction ...
    • Integrating Approaches to Privacy Across the Research Lifecycle: When Is Information Purely Public? 

      Gasser, Urs; O'Brien, David R.; Ullman, Jonathan; Altman, Micah; Bar-sinai, Michael; Nissim, Kobbi; Vadhan, Salil P.; Wojcik, Michael John; Wood, Alexandra B (Berkman Center for Internet & Society, 2015)
      On September 24-25, 2013, the Privacy Tools for Sharing Research Data project at Harvard University held a workshop titled "Integrating Approaches to Privacy across the Research Data Lifecycle." Over forty leading experts ...
    • Privacy and the Complexity of Simple Queries 

      Ullman, Jonathan Robert (2013-09-16)
      As both the scope and scale of data collection increases, an increasingly large amount of sensitive personal information is being analyzed. In this thesis, we study the feasibility of effectively carrying out such analyses ...