{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:15:30Z","timestamp":1779174930803,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662536407","type":"print"},{"value":"9783662536414","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53641-4_24","type":"book-chapter","created":{"date-parts":[[2016,10,21]],"date-time":"2016-10-21T15:48:14Z","timestamp":1477064894000},"page":"635-658","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":344,"title":["Concentrated Differential Privacy: Simplifications, Extensions, and Lower Bounds"],"prefix":"10.1007","author":[{"given":"Mark","family":"Bun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Steinke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,22]]},"reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/2450142.2450148","volume":"60","author":"A Blum","year":"2013","unstructured":"Blum, A., Ligett, K., Roth, A.: A learning theory approach to noninteractive database privacy. J. ACM 60(2), 12 (2013)","journal-title":"J. ACM"},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-40328-6_26","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A Beimel","year":"2013","unstructured":"Beimel, A., Nissim, K., Stemmer, U.: Private learning and sanitization: pure vs. approximate differential privacy. In: Raghavendra, P., Raskhodnikova, S., Jansen, K., Rolim, J.D.P. (eds.) APPROX\/RANDOM -2013. LNCS, vol. 8096, pp. 363\u2013378. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40328-6_26"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Bun, M., Nissim, K., Stemmer, U.: Simultaneous private learning of multiple concepts. In: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, ITCS 2016, pp. 369\u2013380. ACM, New York (2016)","DOI":"10.1145\/2840728.2840747"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Bun, M., Ullman, J., Vadhan, S.P.: Fingerprinting codes and the price of approximate differential privacy. In: Symposium on Theory of Computing, STOC 2014, New York, NY, USA, 31 May - 03 June 2014, pp. 1\u201310 (2014)","DOI":"10.1145\/2591796.2591877"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-28914-9_18","volume-title":"Theory of Cryptography","author":"A De","year":"2012","unstructured":"De, A.: Lower bounds in differential privacy. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 321\u2013338. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-28914-9_18"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11761679_29","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"C Dwork","year":"2006","unstructured":"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\u2013503. Springer, Heidelberg (2006). doi: 10.1007\/11761679_29"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Dwork, C., Lei, J.: Differential privacy and robust statistics. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, 31 May - 2 June 2009, pp. 371\u2013380 (2009)","DOI":"10.1145\/1536414.1536466"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"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\u2013284. Springer, Heidelberg (2006). doi: 10.1007\/11681878_14"},{"key":"24_CR9","unstructured":"Dwork, C., Rothblum, C.: Concentrated differential privacy. CoRR, abs\/1603.01887 (2016)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Dwork, C., Rothblum, G.N., Vadhan, S.P.: Boosting and differential privacy. In: IEEE Symposium on Foundations of Computer Science (FOCS 2010), pp. 51\u201360. IEEE, 23\u201326 October 2010","DOI":"10.1109\/FOCS.2010.12"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Hardt, M., Talwar, K.: On the geometry of differential privacy. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, STOC 2010, pp. 705\u2013714, New York, NY, USA. ACM (2010)","DOI":"10.1145\/1806689.1806786"},{"key":"24_CR12","unstructured":"Kairouz, P., Oh, S., Viswanath, P.: The composition theorem for differential privacy. In: Proceedings of the 32nd International Conference on Machine Learning, ICML 2015, Lille, France, pp. 1376\u20131385, 6\u201311 July 2015"},{"key":"24_CR13","unstructured":"McGregor, A., Mironov, I., Pitassi, T., Reingold, O., Talwar, K., Vadhan, S.P.: The limits of two-party differential privacy. In: 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 23\u201326, 2010, Las Vegas, Nevada, USA, pp. 81\u201390, October 2010"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007, pp. 94\u2013103, October 2007","DOI":"10.1109\/FOCS.2007.66"},{"key":"24_CR15","first-page":"157","volume-title":"Theory of Cryptography","author":"Jack Murtagh","year":"2015","unstructured":"Murtagh, J., Vadhan, S.P.: The complexity of computing the optimal composition of differential privacy. In: Proceedings of Theory of Cryptography - 13th International Conference, TCC2016-A, Tel Aviv, Israel, 10-13 January 2016, Part I, pp. 157\u2013175 (2016)"},{"key":"24_CR16","unstructured":"R\u00e9nyi, A.: On measures of entropy, information. In: Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics, Probability: Contributions to the Theory of Statistics, vol. 1, pp. 547\u2013561. University of California Press (1961)"},{"key":"24_CR17","unstructured":"Steinke, T., Ullman, J.: Between pure and approximate differential privacy. CoRR, abs\/1501.06095 (2015)"},{"key":"24_CR18","unstructured":"Steinke, T., Ullman, J.: Interactive fingerprinting codes, the hardness of preventing false discovery. In: COLT (2015). http:\/\/arXiv.org\/abs\/1410.1228"},{"issue":"2","key":"24_CR19","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1346330.1346335","volume":"55","author":"G Tardos","year":"2008","unstructured":"Tardos, G.: Optimal probabilistic fingerprint codes. J. ACM 55(2), 10 (2008)","journal-title":"J. ACM"},{"key":"24_CR20","doi-asserted-by":"crossref","unstructured":"Ullman, J.: Answering n $$\\{$$ 2+ o (1) $$\\}$$ counting queries with differential privacy is hard. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, pp. 361\u2013370. ACM (2013)","DOI":"10.1145\/2488608.2488653"},{"issue":"7","key":"24_CR21","doi-asserted-by":"publisher","first-page":"3797","DOI":"10.1109\/TIT.2014.2320500","volume":"60","author":"T van Erven","year":"2014","unstructured":"van Erven, T., Harremos, P.: R\u00e9nyi divergence and kullback-leibler divergence. IEEE Trans. Inf. Theory 60(7), 3797\u20133820 (2014)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53641-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T23:14:36Z","timestamp":1657494876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53641-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662536407","9783662536414"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53641-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 October 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}