{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T23:14:57Z","timestamp":1763507697882},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319428352"},{"type":"electronic","value":"9783319428369"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42836-9_23","type":"book-chapter","created":{"date-parts":[[2016,8,2]],"date-time":"2016-08-02T22:30:38Z","timestamp":1470177038000},"page":"250-261","source":"Crossref","is-referenced-by-count":19,"title":["Private Weighted Histogram Aggregation in Crowdsourcing"],"prefix":"10.1007","author":[{"given":"Shaowei","family":"Wang","sequence":"first","affiliation":[]},{"given":"Liusheng","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Pengzhan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Hou","family":"Deng","sequence":"additional","affiliation":[]},{"given":"Hongli","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,4]]},"reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/978-3-642-24178-9_9","volume-title":"Information Hiding","author":"G \u00c1cs","year":"2011","unstructured":"\u00c1cs, G., Castelluccia, C.: I have a DREAM! (DiffeRentially privatE smArt Metering). In: Filler, T., Pevn\u00fd, T., Craver, S., Ker, A. (eds.) IH 2011. LNCS, vol. 6958, pp. 118\u2013132. Springer, Heidelberg (2011)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Bassily, R., Smith, A.: Local, private, efficient protocols for succinct histograms. In: STOC. ACM (2015)","DOI":"10.1145\/2746539.2746632"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-642-32946-3_15","volume-title":"Financial Cryptography and Data Security","author":"T-HH Chan","year":"2012","unstructured":"Chan, T.-H.H., Shi, E., Song, D.: Privacy-preserving stream aggregation with fault tolerance. In: Keromytis, A.D. (ed.) FC 2012. LNCS, vol. 7397, pp. 200\u2013214. Springer, Heidelberg (2012)"},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.jss.2015.03.067","volume":"116","author":"D Christin","year":"2015","unstructured":"Christin, D.: Privacy in mobile participatory sensing: current trends and future challenges. J. Syst. Softw. 116, 57\u201368 (2015)","journal-title":"J. Syst. Softw."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Duchi, J.C., Jordan, M.I., Wainwright, M.J.: Local privacy and statistical minimax rates. In: FOCS. IEEE (2013)","DOI":"10.1109\/FOCS.2013.53"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 1\u201312. Springer, Heidelberg (2006)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Erlingsson, \u00da., Pihur, V., Korolova, A.: Rappor: randomized aggregatable privacy-preserving ordinal response. In: CCS. ACM (2014)","DOI":"10.1145\/2660267.2660348"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Fang, X., Gao, H., Li, J., Li, Y.: Approximate multiple count in wireless sensor networks. In: 2014 Proceedings IEEE INFOCOM. IEEE (2014)","DOI":"10.1109\/INFOCOM.2014.6848082"},{"key":"23_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/978-3-642-31594-7_39","volume-title":"Automata, Languages, and Programming","author":"J Hsu","year":"2012","unstructured":"Hsu, J., Khanna, S., Roth, A.: Distributed private heavy hitters. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 461\u2013472. Springer, Heidelberg (2012)"},{"issue":"3","key":"23_CR11","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1137\/090756090","volume":"40","author":"SP Kasiviswanathan","year":"2011","unstructured":"Kasiviswanathan, S.P., Lee, H.K., Nissim, K., Raskhodnikova, S., Smith, A.: What can we learn privately? SIAM J. Comput. 40(3), 793\u2013826 (2011)","journal-title":"SIAM J. Comput."},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"McSherry, F., Talwar, K.: Mechanism design via differential privacy. In: FOCS. IEEE (2007)","DOI":"10.1109\/FOCS.2007.66"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/978-3-642-03356-8_8","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"I Mironov","year":"2009","unstructured":"Mironov, I., Pandey, O., Reingold, O., Vadhan, S.: Computational differential privacy. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 126\u2013142. Springer, Heidelberg (2009)"},{"key":"23_CR14","unstructured":"Shi, E., Chan, T.H., Rieffel, E., Chow, R., Song, D.: Privacy-preserving aggregation of time-series data. In: NDSS (2011)"},{"issue":"309","key":"23_CR15","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1080\/01621459.1965.10480775","volume":"60","author":"SL Warner","year":"1965","unstructured":"Warner, S.L.: Randomized response: a survey technique for eliminating evasive answer bias. J. Am. Stat. Assoc. 60(309), 63\u201369 (1965)","journal-title":"J. Am. Stat. Assoc."},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Won, J., Ma, C.Y., Yau, D.K., Rao, N.S.: Proactive fault-tolerant aggregation protocol for privacy-assured smart metering. In: INFOCOM. IEEE (2014)","DOI":"10.1109\/INFOCOM.2014.6848230"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Yuen, M.C., King, I., Leung, K.S.: A survey of crowdsourcing systems. In: PASSAT\/SocialCom. IEEE (2011)","DOI":"10.1109\/PASSAT\/SocialCom.2011.203"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42836-9_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T22:57:54Z","timestamp":1568242674000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42836-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319428352","9783319428369"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42836-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}