{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:25:31Z","timestamp":1750220731862,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T00:00:00Z","timestamp":1585526400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,3,30]]},"DOI":"10.1145\/3341105.3375781","type":"proceedings-article","created":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T12:13:52Z","timestamp":1585484032000},"page":"1308-1311","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["PEEPLL"],"prefix":"10.1145","author":[{"given":"Ephraim","family":"Zimmer","sequence":"first","affiliation":[{"name":"University of Hamburg, Hamburg, Germany"}]},{"given":"Christian","family":"Burkert","sequence":"additional","affiliation":[{"name":"University of Hamburg, Hamburg, Germany"}]},{"given":"Tom","family":"Petersen","sequence":"additional","affiliation":[{"name":"University of Hamburg, Hamburg, Germany"}]},{"given":"Hannes","family":"Federrath","sequence":"additional","affiliation":[{"name":"University of Hamburg, Hamburg, Germany"}]}],"member":"320","published-online":{"date-parts":[[2020,3,30]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"European Parliament. 2016. Regulation (EU) 2016\/679 (General Data Protection Regulation). Official Journal of the European Union L119.  European Parliament. 2016. Regulation (EU) 2016\/679 (General Data Protection Regulation). Official Journal of the European Union L119."},{"key":"e_1_3_2_1_2_1","unstructured":"C. Bettini etal 2008. How Anonymous Is k-Anonymous? Look at Your Quasi-ID. In Secure Data Management. Springer.  C. Bettini et al. 2008. How Anonymous Is k-Anonymous? Look at Your Quasi-ID . In Secure Data Management . Springer."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1748-720X.1997.tb01885.x"},{"key":"e_1_3_2_1_4_1","first-page":"6","article-title":"Broken promises of privacy: Responding to the surprising failure of anonymization","volume":"57","author":"Ohm P.","year":"2009","unstructured":"P. Ohm . 2009 . Broken promises of privacy: Responding to the surprising failure of anonymization . UCLA Law Review , 57 , 6 . HeinOnline. P. Ohm. 2009. Broken promises of privacy: Responding to the surprising failure of anonymization. UCLA Law Review, 57, 6. HeinOnline.","journal-title":"UCLA Law Review"},{"key":"e_1_3_2_1_5_1","unstructured":"A. Pfitzmann and M. Hansen. 2010. A terminology for talking about privacy by data minimization.  A. Pfitzmann and M. Hansen. 2010. A terminology for talking about privacy by data minimization ."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1136\/jamia.2009.002725"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"M. Douriez etal 2016. Anonymizing NYC Taxi Data: Does It Matter? In Data Science and Advanced Analytics (DSAA).  M. Douriez et al. 2016. Anonymizing NYC Taxi Data: Does It Matter? In Data Science and Advanced Analytics (DSAA) .","DOI":"10.1109\/DSAA.2016.21"},{"key":"e_1_3_2_1_8_1","unstructured":"S. Eckert and A. Dewes. 2017. Dark Data. Presentation at DEFCON 25.  S. Eckert and A. Dewes. 2017. Dark Data. Presentation at DEFCON 25 ."},{"key":"e_1_3_2_1_9_1","volume-title":"Conference on Computers, Privacy & Data protection, CPDP.","author":"G\u00fcrses S.","year":"2011","unstructured":"S. G\u00fcrses 2011 . Engineering Privacy by Design . Conference on Computers, Privacy & Data protection, CPDP. S. G\u00fcrses et al. 2011. Engineering Privacy by Design. Conference on Computers, Privacy & Data protection, CPDP."},{"key":"e_1_3_2_1_10_1","unstructured":"B. Jacobs. 2005. Select before you Collect. Ars Aequi 54. English slides available at www.cs.ru.nl\/B.Jacobs\/TALKS\/govcert05.pdf.  B. Jacobs. 2005. Select before you Collect. Ars Aequi 54. English slides available at www.cs.ru.nl\/B.Jacobs\/TALKS\/govcert05.pdf."},{"key":"e_1_3_2_1_11_1","volume-title":"SICHERHEIT","author":"Marx M.","year":"2018","unstructured":"M. Marx 2018 . Hashing of personally identifiable information is not sufficient . In SICHERHEIT 2018. H. Langweg et al., editors. GI e.V., Bonn. M. Marx et al. 2018. Hashing of personally identifiable information is not sufficient. In SICHERHEIT 2018. H. Langweg et al., editors. GI e.V., Bonn."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_13_1","unstructured":"E.-J. Goh. 2004. Secure indexes.  E.-J. Goh. 2004. Secure indexes ."},{"volume-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA '01)","author":"Naor M.","key":"e_1_3_2_1_14_1","unstructured":"M. Naor and B. Pinkas . 2001. Efficient oblivious transfer protocols . In ACM-SIAM Symposium on Discrete Algorithms (SODA '01) . M. Naor and B. Pinkas. 2001. Efficient oblivious transfer protocols. In ACM-SIAM Symposium on Discrete Algorithms (SODA '01)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"T. Chou and C. Orlandi. 2015. The simplest protocol for oblivious transfer. In Progress in Cryptology. Cham.  T. Chou and C. Orlandi. 2015. The simplest protocol for oblivious transfer . In Progress in Cryptology . Cham.","DOI":"10.1007\/978-3-319-22174-8_3"}],"event":{"name":"SAC '20: The 35th ACM\/SIGAPP Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Brno Czech Republic","acronym":"SAC '20"},"container-title":["Proceedings of the 35th Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341105.3375781","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341105.3375781","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:24Z","timestamp":1750199904000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341105.3375781"}},"subtitle":["privacy-enhanced event pseudonymisation with limited linkability"],"short-title":[],"issued":{"date-parts":[[2020,3,30]]},"references-count":15,"alternative-id":["10.1145\/3341105.3375781","10.1145\/3341105"],"URL":"https:\/\/doi.org\/10.1145\/3341105.3375781","relation":{},"subject":[],"published":{"date-parts":[[2020,3,30]]},"assertion":[{"value":"2020-03-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}