{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:42:44Z","timestamp":1780994564926,"version":"3.54.1"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"ICFP","license":[{"start":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T00:00:00Z","timestamp":1503964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1065060 and CNS-1513694"],"award-info":[{"award-number":["CNS-1065060 and CNS-1513694"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2017,8,29]]},"abstract":"<jats:p>\n            Differential privacy is a widely studied theory for analyzing sensitive data with a strong privacy guarantee\u2014any change in an individual's data can have only a small statistical effect on the result\u2014and a growing number of programming languages now support differentially private data analysis. A common shortcoming of these languages is poor support for\n            <jats:italic>adaptivity<\/jats:italic>\n            . In practice, a data analyst rarely wants to run just one function over a sensitive database, nor even a predetermined sequence of functions with fixed privacy parameters; rather, she wants to engage in an interaction where, at each step, both the choice of the next function and its privacy parameters are informed by the results of prior functions. Existing languages support this scenario using a\n            <jats:italic>simple composition theorem<\/jats:italic>\n            , which often gives rather loose bounds on the actual privacy cost of composite functions, substantially reducing how much computation can be performed within a given privacy budget. The theory of differential privacy includes other theorems with much better bounds, but these have not yet been incorporated into programming languages.\n          <\/jats:p>\n          <jats:p>\n            We propose a novel framework for adaptive composition that is elegant, practical, and implementable. It consists of a reformulation based on typed functional programming of\n            <jats:italic>privacy filters<\/jats:italic>\n            , together with a concrete realization of this framework in the design and implementation of a new language, called\n            <jats:italic>Adaptive Fuzz<\/jats:italic>\n            . Adaptive Fuzz transplants the core static type system of Fuzz to the adaptive setting by wrapping the Fuzz typechecker and runtime system in an outer\n            <jats:italic>adaptive layer<\/jats:italic>\n            , allowing Fuzz programs to be conveniently constructed and typechecked on the fly. We describe an interpreter for Adaptive Fuzz and report results from two case studies demonstrating its effectiveness for implementing common statistical algorithms over real data sets.\n          <\/jats:p>","DOI":"10.1145\/3110254","type":"journal-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:19:41Z","timestamp":1504030781000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["A framework for adaptive differential privacy"],"prefix":"10.1145","volume":"1","author":[{"given":"Daniel","family":"Winograd-Cort","sequence":"first","affiliation":[{"name":"University of Pennsylvania, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andreas","family":"Haeberlen","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aaron","family":"Roth","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benjamin C.","family":"Pierce","sequence":"additional","affiliation":[{"name":"University of Pennsylvania, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,8,29]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335438"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.44"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2677000"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103670"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.56"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_29"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536466"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_2_2_9_1","first-page":"3","article-title":"The Algorithmic Foundations of Differential Privacy","volume":"9","author":"Dwork Cynthia","year":"2014","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.12"},{"key":"e_1_2_2_11_1","unstructured":"Hamid Ebadi and David Sands. 2015. Featherweight PINQ. CoRR abs\/1505.02642 (2015). http:\/\/arxiv .org\/abs\/1505.02642  Hamid Ebadi and David Sands. 2015. Featherweight PINQ. CoRR abs\/1505.02642 (2015). http:\/\/arxiv .org\/abs\/1505.02642"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775080"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429069.2429113"},{"key":"e_1_2_2_14_1","volume-title":"Theory and Practice of Differential Privacy.","author":"Gaboardi Marco"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401926"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/2028067.2028100"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2014.35"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487687"},{"key":"e_1_2_2_19_1","volume-title":"Proceedings of The 32nd International Conference on Machine Learning. 1376\u20131385","author":"Kairouz Peter","year":"2015"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.v6i1.634"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559861"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367856"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.1"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557090"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559850"},{"key":"e_1_2_2_26_1","unstructured":"Elinor Mills. 2006. AOL sued over Web search data release. (Sept. 2006). cnet http:\/\/www .cnet.com\/news\/aol-sued-overweb- search- data- release\/ .  Elinor Mills. 2006. AOL sued over Web search data release. (Sept. 2006). cnet http:\/\/www .cnet.com\/news\/aol-sued-overweb- search- data- release\/ ."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382264"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213876"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49096-9_7"},{"key":"e_1_2_2_30_1","volume-title":"Presented as part of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12)","author":"Narayan Arjun"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.33"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863568"},{"key":"e_1_2_2_33_1","unstructured":"Ryan M. Rogers Aaron Roth Jonathan Ullman and Salil P. Vadhan. 2016. Privacy Odometers and Filters: Pay-as-you-Go Composition. In Advances in Neural Information Processing Systems 29 D. D. Lee M. Sugiyama U. V. Luxburg I. Guyon and R. Garnett (Eds.). Curran Associates Inc. 1921\u20131929.  Ryan M. Rogers Aaron Roth Jonathan Ullman and Salil P. Vadhan. 2016. Privacy Odometers and Filters: Pay-as-you-Go Composition. In Advances in Neural Information Processing Systems 29 D. D. Lee M. Sugiyama U. V. Luxburg I. Guyon and R. Garnett (Eds.). Curran Associates Inc. 1921\u20131929."},{"key":"e_1_2_2_34_1","volume-title":"Proceedings of the 7th USENIX Conference on Networked Systems Design and Implementation (NSDI\u201910)","volume":"10","author":"Roy Indrajit","year":"2010"},{"key":"e_1_2_2_35_1","volume-title":"Secret, Lawsuit Claims. (Dec.","author":"Singel Ryan","year":"2009"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"e_1_2_2_37_1","first-page":"1","article-title":"A General Framework for Fast Stagewise Algorithms","volume":"16","author":"Tibshirani Ryan J.","year":"2015","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_2_2_38_1","unstructured":"UCI KDD Archive. 2016. 1990 US Census Data Set. (2016). Available from https:\/\/kdd .ics.uci.edu\/databases\/census1990\/ USCensus1990raw .html .  UCI KDD Archive. 2016. 1990 US Census Data Set. (2016). Available from https:\/\/kdd .ics.uci.edu\/databases\/census1990\/ USCensus1990raw .html ."},{"key":"e_1_2_2_39_1","unstructured":"Philip Wadler. 1990. Linear Types Can Change the World. In IFIP TC 2 Working Conference on Programming Concepts and Methods Sea of Galilee Israel. 546\u2013566.  Philip Wadler. 1990. Linear Types Can Change the World. In IFIP TC 2 Working Conference on Programming Concepts and Methods Sea of Galilee Israel. 546\u2013566."}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3110254","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3110254","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3110254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:38:44Z","timestamp":1750221524000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3110254"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,29]]},"references-count":39,"journal-issue":{"issue":"ICFP","published-print":{"date-parts":[[2017,8,29]]}},"alternative-id":["10.1145\/3110254"],"URL":"https:\/\/doi.org\/10.1145\/3110254","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,29]]},"assertion":[{"value":"2017-08-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}