The complexity of computing the optimal composition of differential privacy

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

Volumn 9562, Issue , 2016, Pages 157-175

  Murtagh, Jack ^a   Vadhan, Salil ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Composition; Computational complexity; Differential privacy

Indexed keywords

APPROXIMATION ALGORITHMS; CHEMICAL ANALYSIS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; POLYNOMIAL APPROXIMATION;

ARBITRARY ACCURACY; COMPOSITION THEOREM; DIFFERENTIAL PRIVACIES; KNAPSACK PROBLEMS; OPTIMAL BOUNDS; OPTIMAL COMPOSITION; P-COMPLETE; POLYNOMIAL-TIME;

DYNAMIC PROGRAMMING;

EID: 84952690453     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-49096-9_7     Document Type: Conference Paper

References (11)

1. R: an open-source application for sharing, discovering and preserving data. D-lib Mag. 17(1), 2 (2011).
2. 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).
3. 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).
4. Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci. 9(3-4), 211-407 (2013).
5. Dwork, C., Rothblum, G. N., Vadhan, S.: Boosting and differential privacy. In: 51st IEEE Symposium on Foundations of Computer Science, pp. 51-60. IEEE (2010).
6. Dyer, M.: Approximate counting by dynamic programming. In: 35th ACM Symposium on Theory of Computing, pp. 693-699. ACM (2003).
7. Ehrgott, M.: Approximation algorithms for combinatorial multicriteria optimization problems. Int. Trans. Oper. Res. 7(1), 5-31 (2000).
8. King, G.: An introduction to the dataverse network as an infrastructure for data sharing. Sociol. Methods Res. 36(2), 173-199 (2007).
9. Kairouz, P., Oh, S., Viswanath. P.: The composition theorem for differential privacy. In: 32nd International Conference onMachine Learning, pp. 1376-1385 (2015).
10. Murtagh, J., Vadhan, S.: The Complexity of Computing the Optimal Composition of Differential Privacy (2015). http://arxiv. org/abs/1507. 03113.
11. Warner, S. L.: Randomized response: a survey technique for eliminating evasive answer bias. J. Am. Stat. Assoc. 60(309), 63-69 (1965).