{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T17:58:10Z","timestamp":1762019890033,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030396336"},{"type":"electronic","value":"9783030396343"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39634-3_9","type":"book-chapter","created":{"date-parts":[[2020,1,22]],"date-time":"2020-01-22T03:02:32Z","timestamp":1579662152000},"page":"86-98","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["RRTxFM: Probabilistic Counting for Differentially Private Statistics"],"prefix":"10.1007","author":[{"given":"Saskia","family":"Nu\u00f1ez von Voigt","sequence":"first","affiliation":[]},{"given":"Florian","family":"Tschorsch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,23]]},"reference":[{"key":"9_CR1","unstructured":"Abbatiello, A., Agarwal, D., Bersin, J., et al.: The rise of the social enterprise. In: 2018 Deloitte Global Human Capital Trends. Deloitte (2018)"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1515\/popets-2018-0010","volume":"2018","author":"M Alaggan","year":"2018","unstructured":"Alaggan, M., Cunche, M., Gambs, S.: Privacy-preserving Wi-Fi analytics. Proc. Priv. Enhancing Technol. 2018(2), 4\u201326 (2018)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-20810-7_15","volume-title":"Data and Applications Security and Privacy XXIX","author":"M Alaggan","year":"2015","unstructured":"Alaggan, M., Gambs, S., Matwin, S., Tuhin, M.: Sanitization of call detail records via differentially-private bloom filters. In: Samarati, P. (ed.) DBSec 2015. LNCS, vol. 9149, pp. 223\u2013230. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-20810-7_15"},{"key":"9_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-33627-0_27","volume-title":"PSD 2012","author":"G Bianchi","year":"2012","unstructured":"Bianchi, G., Bracciale, L., Loreti, P.: \u201cBetter than nothing\u201d privacy with bloom filters: to what extent? In: Domingo-Ferrer, J., Tinnirello, I. (eds.) PSD 2012. LNCS, vol. 7556, pp. 348\u2013363. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33627-0_27"},{"issue":"7","key":"9_CR5","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"9_CR6","first-page":"308","volume":"6","author":"RF Boruch","year":"1971","unstructured":"Boruch, R.F.: Assuring confidentiality of responses in social research: a note on strategies. Am. Sociol. 6, 308\u2013311 (1971)","journal-title":"Am. Sociol."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Cormode, G.: Count-min sketch. In: Encyclopedia of Database Systems, pp. 511\u2013516 (2009)","DOI":"10.1007\/978-0-387-39940-9_87"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Desfontaines, D., Lochbihler, A., Basin, D.A.: Cardinality estimators do not preserve privacy. CoRR (2018)","DOI":"10.2478\/popets-2019-0018"},{"key":"9_CR9","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). https:\/\/doi.org\/10.1007\/11681878_14"},{"issue":"3\u20134","key":"9_CR10","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1561\/0400000042","volume":"9","author":"C Dwork","year":"2014","unstructured":"Dwork, C., Roth, A.: The algorithmic foundations of differential privacy. Found. Trends Theor. Comput. Sci. 9(3\u20134), 211\u2013407 (2014). https:\/\/doi.org\/10.1561\/0400000042","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Erlingsson, \u00da., Pihur, V., Korolova, A.: Rappor: randomized aggregatable privacy-preserving ordinal response. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 1054\u20131067. ACM (2014)","DOI":"10.1145\/2660267.2660348"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Fan, L., Jin, H.: A practical framework for privacy-preserving data analytics. In: Proceedings of the 24th International Conference on World Wide Web, pp. 311\u2013321 (2015). https:\/\/doi.org\/10.1145\/2736277.2741122","DOI":"10.1145\/2736277.2741122"},{"key":"9_CR13","unstructured":"Fitz-Enz, J.: THE NEW HR ANALYTIC Predicting the Economic Value of Your Company\u2019s Human Capital Investments (2010)"},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2), 182\u2013209 (1985)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-40994-3_24","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"M Kamp","year":"2013","unstructured":"Kamp, M., Kopp, C., Mock, M., Boley, M., May, M.: Privacy-preserving mobility monitoring using sketches of stationary sensor readings. In: Blockeel, H., Kersting, K., Nijssen, S., \u017delezn\u00fd, F. (eds.) ECML PKDD 2013. LNCS (LNAI), vol. 8190, pp. 370\u2013386. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40994-3_24"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Lieven, P., Scheuermann, B.: High-speed per-flow traffic measurement with probabilistic multiplicity counting. In: INFOCOM, pp. 1253\u20131261 (2010)","DOI":"10.1109\/INFCOM.2010.5461921"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Lin, B., Wu, S., Tsou, Y., Huang, Y.: PPDCA: privacy-preserving crowdsensing data collection and analysis with randomized response. In: 2018 IEEE Wireless Communications and Networking Conference (WCNC), pp. 1\u20136 (2018). https:\/\/doi.org\/10.1109\/WCNC.2018.8377050","DOI":"10.1109\/WCNC.2018.8377050"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Narayanan, A., Shmatikov, V.: Robust de-anonymization of large sparse datasets. In: 2008 IEEE Symposium on Security and Privacy, SP 2008, pp. 111\u2013125. IEEE (2008)","DOI":"10.1109\/SP.2008.33"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Qin, Z., Yang, Y., Yu, T., Khalil, I., Xiao, X., Ren, K.: Heavy hitter estimation over set-valued data with local differential privacy. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 192\u2013203. ACM (2016)","DOI":"10.1145\/2976749.2978409"},{"key":"9_CR20","unstructured":"Quoc, D.L., Beck, M., Bhatotia, P., Chen, R., Fetzer, C., Strufe, T.: PrivApprox: privacy-preserving stream analytics. In: 2017 USENIX Annual Technical Conference, pp. 659\u2013672 (2017)"},{"key":"9_CR21","unstructured":"Sparka, H., Tschorsch, F., Scheuermann, B.: P2KMV: a privacy-preserving counting sketch for efficient and accurate set intersection cardinality estimations. Technical report 234 (2018)"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Stanojevic, R., Nabeel, M., Yu, T.: Distributed cardinality estimation of set operations with differential privacy. In: 2017 IEEE Symposium on Privacy-Aware Computing (PAC), pp. 37\u201348 (2017)","DOI":"10.1109\/PAC.2017.43"},{"issue":"14","key":"9_CR23","doi-asserted-by":"publisher","first-page":"2775","DOI":"10.1016\/j.comnet.2013.05.011","volume":"57","author":"F Tschorsch","year":"2013","unstructured":"Tschorsch, F., Scheuermann, B.: An algorithm for privacy-preserving distributed user statistics. Comput. Netw. 57(14), 2775\u20132787 (2013)","journal-title":"Comput. Netw."},{"issue":"309","key":"9_CR24","doi-asserted-by":"publisher","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."}],"container-title":["IFIP Advances in Information and Communication Technology","Digital Transformation for a Sustainable Society in the 21st Century"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39634-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,22]],"date-time":"2024-01-22T01:10:53Z","timestamp":1705885853000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-39634-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030396336","9783030396343"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39634-3_9","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"23 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"I3E","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on e-Business, e-Services and e-Society","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trondheim","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"i3e2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.i3e2019.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"138","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"I3E 2019 workshops (DTIS, TPSIE, 3(IT), and CROPS): 11 full papers and 4 short papers were carefully reviewed and selected from 33 submissions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}