{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T17:16:27Z","timestamp":1790874987008,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642315930","type":"print"},{"value":"9783642315947","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31594-7_39","type":"book-chapter","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T17:20:21Z","timestamp":1340385621000},"page":"461-472","source":"Crossref","is-referenced-by-count":56,"title":["Distributed Private Heavy Hitters"],"prefix":"10.1007","author":[{"given":"Justin","family":"Hsu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjeev","family":"Khanna","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aaron","family":"Roth","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: Proceedings of the 48th Annual Symposium on Foundations of Computer Science (2007)","DOI":"10.1109\/FOCS.2007.4389483"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Gilbert, A., Li, Y., Porat, E., Strauss, M.: Approximate sparse recovery: optimizing time and measurements. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 475\u2013484. ACM (2010)","DOI":"10.1145\/1806689.1806755"},{"key":"39_CR3","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.\u00a03876, pp. 265\u2013284. Springer, Heidelberg (2006)"},{"key":"39_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-79228-4_1","volume-title":"Theory and Applications of Models of Computation","author":"C. Dwork","year":"2008","unstructured":"Dwork, C.: Differential Privacy: A Survey of Results. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 1\u201319. Springer, Heidelberg (2008)"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Kasiviswanathan, S., Lee, H., Nissim, K., Raskhodnikova, S., Smith, A.: What Can We Learn Privately? In: IEEE 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, pp. 531\u2013540 (2008)","DOI":"10.1109\/FOCS.2008.27"},{"key":"39_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/978-3-540-85174-5_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"A. Beimel","year":"2008","unstructured":"Beimel, A., Nissim, K., Omri, E.: Distributed Private Data Analysis: Simultaneously Solving How and What. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 451\u2013468. Springer, Heidelberg (2008)"},{"key":"39_CR7","volume-title":"Proceedings of the 43rd annual ACM Symposium on the Theory of Computing","author":"A. Gupta","year":"2011","unstructured":"Gupta, A., Hardt, M., Roth, A., Ullman, J.: Privately Releasing Conjunctions and the Statistical Query Barrier. In: Proceedings of the 43rd annual ACM Symposium on the Theory of Computing. ACM, New York (2011)"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"McGregor, A., Mironov, I., Pitassi, T., Reingold, O., Talwar, K., Vadhan, S.: The limits of two-party differential privacy. In: Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 81\u201390. IEEE (2010)","DOI":"10.1109\/FOCS.2010.14"},{"key":"39_CR9","unstructured":"Dwork, C., Naor, M., Pitassi, T., Rothblum, G., Yekhanin, S.: Pan-private streaming algorithms. In: Proceedings of ICS (2010)"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Mir, D., Muthukrishnan, S., Nikolov, A., Wright, R.: Pan-private algorithms via statistics on sketches. In: Proceedings of the 30th Symposium on Principles of Database Systems of Data, pp. 37\u201348. ACM (2011)","DOI":"10.1145\/1989284.1989290"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Blum, A., Ligett, K., Roth, A.: A learning theory approach to non-interactive database privacy. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 609\u2013618. ACM (2008)","DOI":"10.1145\/1374376.1374464"},{"key":"39_CR12","unstructured":"Blum, A., Roth, A.: Fast private data release algorithms for sparse queries. CoRR, abs\/1111.6842 (2011)"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Dwork, C., McSherry, F., Talwar, K.: The price of privacy and the limits of LP decoding. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, p. 94. ACM (2007)","DOI":"10.1145\/1250790.1250804"},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Li, Y., Zhang, Z., Winslett, M., Yang, Y.: Compressive mechanism: Utilizing sparse representation in differential privacy. In: Proceedings of the 10th Annual ACM Workshop on Privacy in the Electronic Society, pp. 177\u2013182. ACM (2011)","DOI":"10.1145\/2046556.2046581"},{"key":"39_CR15","first-page":"1202","volume":"arXiv","author":"J. Hsu","year":"2012","unstructured":"Hsu, J., Khanna, S., Roth, A.: Distributed private heavy hitters. Arxiv preprint arXiv:1202.4910 (2012)","journal-title":"Arxiv preprint"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Dinur, I., Nissim, K.: Revealing information while preserving privacy. In: 22nd ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2003), pp. 202\u2013210 (2003)","DOI":"10.1145\/773153.773173"},{"key":"39_CR17","doi-asserted-by":"crossref","unstructured":"Beimel, A., Kasiviswanathan, S., Nissim, K.: Bounds on the sample complexity for private learning and private data release. Theory of Cryptography, 437\u2013454 (2010)","DOI":"10.1007\/978-3-642-11799-2_26"},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"Hardt, M., Talwar, K.: On the Geometry of Differential Privacy. In: The 42nd ACM Symposium on the Theory of Computing, STOC 2010 (2010)","DOI":"10.1145\/1806689.1806786"},{"key":"39_CR19","doi-asserted-by":"crossref","unstructured":"Gupta, A., Ligett, K., McSherry, F., Roth, A., Talwar, K.: Differentially Private Combinatorial Optimization. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (2010)","DOI":"10.1137\/1.9781611973075.90"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31594-7_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:15:03Z","timestamp":1620116103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31594-7_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315930","9783642315947"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31594-7_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}