{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:55:47Z","timestamp":1763499347687,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,11,12]],"date-time":"2021-11-12T00:00:00Z","timestamp":1636675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100008398","name":"Villum Fonden","doi-asserted-by":"publisher","award":["16582"],"award-info":[{"award-number":["16582"]}],"id":[{"id":"10.13039\/100008398","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484735","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:34Z","timestamp":1636805134000},"page":"1223-1236","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access"],"prefix":"10.1145","author":[{"given":"Martin","family":"Aum\u00fcller","sequence":"first","affiliation":[{"name":"IT University of Copenhagen, Copenhagen, Denmark"}]},{"given":"Christian Janos","family":"Lebeda","sequence":"additional","affiliation":[{"name":"Basic Algorithms Research Copenhagen & IT University of Copenhagen, Copenhagen, Denmark"}]},{"given":"Rasmus","family":"Pagh","sequence":"additional","affiliation":[{"name":"Basic Algorithms Research Copenhagen & University of Copenhagen, Copenhagen, Denmark"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Simple random walk. Unpublished manuscript","author":"Alm Sven Erick","year":"2002","unstructured":"Sven Erick Alm. 2002. Simple random walk. Unpublished manuscript (2002). http:\/\/www2.math.uu.se\/ sea\/kurser\/stokprocmn1\/slumpvandring_eng.pdf"},{"key":"e_1_3_2_2_2_1","article-title":"Differential Privacy on Finite Computers","volume":"9","author":"Balcer Victor","year":"2019","unstructured":"Victor Balcer and Salil P. Vadhan. 2019. Differential Privacy on Finite Computers. J. Priv. Confidentiality, Vol. 9, 2 (2019).","journal-title":"J. Priv. Confidentiality"},{"key":"e_1_3_2_2_3_1","article-title":"Simultaneous Private Learning of Multiple Concepts","volume":"20","author":"Bun Mark","year":"2019","unstructured":"Mark Bun, Kobbi Nissim, and Uri Stemmer. 2019. Simultaneous Private Learning of Multiple Concepts. J. Mach. Learn. Res., Vol. 20 (2019), 94:1--94:34.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"e_1_3_2_2_5_1","volume-title":"Tran","author":"Cormode Graham","year":"2012","unstructured":"Graham Cormode, Cecilia M. Procopiuc, Divesh Srivastava, and Thanh T. L. Tran. 2012. Differentially private summaries for sparse data. In ICDT. ACM, 299--311."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0873"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.v7i3.405"},{"key":"e_1_3_2_2_8_1","first-page":"3","article-title":"The Algorithmic Foundations of Differential Privacy","volume":"9","author":"Dwork Cynthia","year":"2014","unstructured":"Cynthia Dwork and Aaron Roth. 2014. The Algorithmic Foundations of Differential Privacy. Found. Trends Theor. Comput. Sci., Vol. 9, 3--4 (2014), 211--407.","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"e_1_3_2_2_9_1","volume-title":"Upper limit on the central binomial coefficient. https:\/\/mathoverflow.net\/questions\/133732\/upper-limit-on-the-central-binomial-coefficient. [Online","author":"Elkies Noam D.","year":"2021","unstructured":"Noam D. Elkies. 2013. Upper limit on the central binomial coefficient. https:\/\/mathoverflow.net\/questions\/133732\/upper-limit-on-the-central-binomial-coefficient. [Online; accessed 15-September-2021]."},{"key":"e_1_3_2_2_10_1","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"Graham Ronald L.","year":"1994","unstructured":"Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. 1994. Concrete Mathematics: A Foundation for Computer Science, 2nd Ed .Addison-Wesley.","edition":"2"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028575"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Moritz Hardt and Kunal Talwar. 2010. On the geometry of differential privacy. In STOC. ACM 705--714.","DOI":"10.1145\/1806689.1806786"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Aleksandra Korolova Krishnaram Kenthapadi Nina Mishra and Alexandros Ntoulas. 2009. Releasing search queries and clicks privately. In WWW. ACM 171--180.","DOI":"10.1145\/1526709.1526733"},{"key":"e_1_3_2_2_14_1","volume-title":"Pappas","author":"Koufogiannis Fragkiskos","year":"2015","unstructured":"Fragkiskos Koufogiannis, Shuo Han, and George J. Pappas. 2015. Optimality of the Laplace Mechanism in Differential Privacy. CoRR, Vol. abs\/1504.00065 (2015)."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1965.10480775"}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Virtual Event Republic of Korea","acronym":"CCS '21"},"container-title":["Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484735","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:49:08Z","timestamp":1763498948000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484735"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":15,"alternative-id":["10.1145\/3460120.3484735","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484735","relation":{},"subject":[],"published":{"date-parts":[[2021,11,12]]},"assertion":[{"value":"2021-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}