{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:28:15Z","timestamp":1750220895302,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T00:00:00Z","timestamp":1573689600000},"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":[[2019,11,14]]},"DOI":"10.1145\/3360664.3360680","type":"proceedings-article","created":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T15:44:57Z","timestamp":1571845497000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Retrospective Tracking of Suspects in GDPR Conform Mobile Access Networks Datasets"],"prefix":"10.1145","author":[{"given":"Louis","family":"Tajan","sequence":"first","affiliation":[{"name":"Hochschule Offenburg, Offenburg, Germany"}]},{"given":"Dirk","family":"Westhoff","sequence":"additional","affiliation":[{"name":"Hochschule Offenburg, Offenburg, Germany"}]}],"member":"320","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"ARCEP. 2018. Barom\u00e8tre du Num\u00e9rique. https:\/\/www.arcep.fr\/uploads\/tx_gspublication\/barometre-du-numerique-2018_031218.pdf  ARCEP. 2018. Barom\u00e8tre du Num\u00e9rique. https:\/\/www.arcep.fr\/uploads\/tx_gspublication\/barometre-du-numerique-2018_031218.pdf"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00287-016-0964-7"},{"key":"e_1_3_2_1_4_1","volume-title":"International Conference on the Theory and Applications of Cryptographic Techniques","volume":"3027","author":"Freedman Michael J.","year":"2004","unstructured":"Michael J. Freedman , Kobbi Nissim , and Benny Pinkas . 2004 . Efficient Private Matching and Set Intersection. In Advances in Cryptology - EUROCRYPT 2004 , International Conference on the Theory and Applications of Cryptographic Techniques , Interlaken, Switzerland , May 2-6, 2004, Proceedings (Lecture Notes in Computer Science), Christian Cachin and Jan Camenisch (Eds.), Vol. 3027 . Springer, 1--19. Michael J. Freedman, Kobbi Nissim, and Benny Pinkas. 2004. Efficient Private Matching and Set Intersection. In Advances in Cryptology - EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2-6, 2004, Proceedings (Lecture Notes in Computer Science), Christian Cachin and Jan Camenisch (Eds.), Vol. 3027. Springer, 1--19."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi8030157"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Chris Jay Hoofnagle Bart van der Sloot and Frederik Zuiderveen Borgesius. 2018. The European Union General Data Protection Regulation: What It Is And What It Means. In UC Berkeley Public Law Research Paper.  Chris Jay Hoofnagle Bart van der Sloot and Frederik Zuiderveen Borgesius. 2018. The European Union General Data Protection Regulation: What It Is And What It Means. In UC Berkeley Public Law Research Paper.","DOI":"10.2139\/ssrn.3254511"},{"key":"e_1_3_2_1_7_1","volume-title":"Characterizing Location-based Mobile Tracking in Mobile Ad Networks. CoRR abs\/1903.09916","author":"Hu Boyang","year":"2019","unstructured":"Boyang Hu , Qicheng Lin , Yao Zheng , Qiben Yan , Matthew Troglia , and Qingyang Wang . 2019. Characterizing Location-based Mobile Tracking in Mobile Ad Networks. CoRR abs\/1903.09916 ( 2019 ). Boyang Hu, Qicheng Lin, Yao Zheng, Qiben Yan, Matthew Troglia, and Qingyang Wang. 2019. Characterizing Location-based Mobile Tracking in Mobile Ad Networks. CoRR abs\/1903.09916 (2019)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2414456.2414506"},{"key":"e_1_3_2_1_9_1","volume-title":"Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference","author":"Kissner Lea","year":"2005","unstructured":"Lea Kissner and Dawn Xiaodong Song . 2005. Privacy-Preserving Set Operations . In Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference , Santa Barbara, California, USA , August 14-18, 2005 , Proceedings (Lecture Notes in Computer Science), Victor Shoup (Ed.), Vol. 3621 . Springer , 241--257. Lea Kissner and Dawn Xiaodong Song. 2005. Privacy-Preserving Set Operations. In Advances in Cryptology - CRYPTO 2005: 25th Annual International Cryptology Conference, Santa Barbara, California, USA, August 14-18, 2005, Proceedings (Lecture Notes in Computer Science), Victor Shoup (Ed.), Vol. 3621. Springer, 241--257."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 2006 International Conference on Security & Management, SAM 2006","author":"Lai Pierre K. Y.","year":"2006","unstructured":"Pierre K. Y. Lai , Siu-Ming Yiu , K. P. Chow , C. F. Chong , and Lucas Chi Kwong Hui . 2006 . An Efficient Bloom Filter Based Solution for Multiparty Private Matching . In Proceedings of the 2006 International Conference on Security & Management, SAM 2006 , Las Vegas, Nevada, USA , June 26-29, 2006, Hamid R. Arabnia and Selim Aissi (Eds.). CSREA Press, 286--292. Pierre K. Y. Lai, Siu-Ming Yiu, K. P. Chow, C. F. Chong, and Lucas Chi Kwong Hui. 2006. An Efficient Bloom Filter Based Solution for Multiparty Private Matching. In Proceedings of the 2006 International Conference on Security & Management, SAM 2006, Las Vegas, Nevada, USA, June 26-29, 2006, Hamid R. Arabnia and Selim Aissi (Eds.). CSREA Press, 286--292."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2018.2889329"},{"key":"#cr-split#-e_1_3_2_1_12_1.1","doi-asserted-by":"crossref","unstructured":"Anup Kumar Maurya and V. N. Sastry. 2017. Secure and Efficient Authenticated Key Exchange Mechanism for Wireless Sensor Networks and Internet of Things Using Bloom Filter. In 3rd IEEE International Conference on Collaboration and Internet Computing CIC 2017 San Jose CA USA October 15-17 2017. IEEE Computer Society. https:\/\/doi.org\/10.1109\/CIC.2017.00032 10.1109\/CIC.2017.00032","DOI":"10.1109\/CIC.2017.00032"},{"key":"#cr-split#-e_1_3_2_1_12_1.2","doi-asserted-by":"crossref","unstructured":"Anup Kumar Maurya and V. N. Sastry. 2017. Secure and Efficient Authenticated Key Exchange Mechanism for Wireless Sensor Networks and Internet of Things Using Bloom Filter. In 3rd IEEE International Conference on Collaboration and Internet Computing CIC 2017 San Jose CA USA October 15-17 2017. IEEE Computer Society. https:\/\/doi.org\/10.1109\/CIC.2017.00032","DOI":"10.1109\/CIC.2017.00032"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.01.016"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICOIN.2017.7899458"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2009.4917787"}],"event":{"name":"CECC 2019: Central European Cybersecurity Conference","sponsor":["University of Maribor"],"location":"Munich Germany","acronym":"CECC 2019"},"container-title":["Proceedings of the Third Central European Cybersecurity Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3360664.3360680","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3360664.3360680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:36Z","timestamp":1750203876000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3360664.3360680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,14]]},"references-count":16,"alternative-id":["10.1145\/3360664.3360680","10.1145\/3360664"],"URL":"https:\/\/doi.org\/10.1145\/3360664.3360680","relation":{},"subject":[],"published":{"date-parts":[[2019,11,14]]},"assertion":[{"value":"2019-11-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}