{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T02:40:57Z","timestamp":1783478457509,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T00:00:00Z","timestamp":1629158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["GRK2050"],"award-info":[{"award-number":["GRK2050"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,17]]},"DOI":"10.1145\/3465481.3465482","type":"proceedings-article","created":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T18:07:25Z","timestamp":1629137245000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Enabling Privacy-Preserving Rule Mining in Decentralized Social Networks"],"prefix":"10.1145","author":[{"given":"Aidmar","family":"Wainakh","sequence":"first","affiliation":[{"name":"Technical University Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Aleksej","family":"Strassheim","sequence":"additional","affiliation":[{"name":"Technical University Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tim","family":"Grube","sequence":"additional","affiliation":[{"name":"Technical University Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00f6rg","family":"Daubert","sequence":"additional","affiliation":[{"name":"Philipps-Universit\u00e4t Marburg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Max","family":"M\u00fchlh\u00e4user","sequence":"additional","affiliation":[{"name":"Technical University Darmstadt, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,8,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Approximating aggregate queries about web","author":"Bar-Yossef Ziv","unstructured":"Ziv Bar-Yossef, Alexander Berg, Steve Chien, Jittat Fakcharoenphol, and Dror Weitz. 2000. Approximating aggregate queries about web pages via random walks. In VLDB. 535\u2013544."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1988688.1988749"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12046-017-0743-4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514927"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11430919_59"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/AICCSA.2014.7073285"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1774088.1774216"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2003.09.001"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSNT.2014.86"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462078"},{"key":"e_1_3_2_1_11_1","volume-title":"Facebook to contact 87 million users affected by data breach. https:\/\/www.theguardian.com\/technology\/2018\/apr\/08\/facebook-to-contact-the-87-million-users-affected-by-data-breach. [Online","author":"Guardian The","year":"2018","unstructured":"The Guardian. 2018. Facebook to contact 87 million users affected by data breach. https:\/\/www.theguardian.com\/technology\/2018\/apr\/08\/facebook-to-contact-the-87-million-users-affected-by-data-breach. [Online; accessed 11-Dec-2018]."},{"key":"e_1_3_2_1_12_1","volume-title":"Mining frequent patterns without candidate generation. ACM sigmod record 29, 2","author":"Han Jiawei","year":"2000","unstructured":"Jiawei Han, Jian Pei, and Yiwen Yin. 2000. Mining frequent patterns without candidate generation. ACM sigmod record 29, 2 (2000), 1\u201312."},{"key":"e_1_3_2_1_13_1","unstructured":"Pili Hu and Wing\u00a0Cheong Lau. 2013. A survey and taxonomy of graph sampling. arXiv preprint arXiv:1308.5865(2013)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.45"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.4103\/0377-4929.94858"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1852658.1852664"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150479"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454008.1454027"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113345"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSE.2009.387"},{"key":"e_1_3_2_1_21_1","volume-title":"World\u2019s Biggest Data Breaches & Hacks. https:\/\/informationisbeautiful.net\/visualizations\/worlds-biggest-data-breaches-hacks\/. [Online","author":"McCandless David","year":"2019","unstructured":"David McCandless. 2019. World\u2019s Biggest Data Breaches & Hacks. https:\/\/informationisbeautiful.net\/visualizations\/worlds-biggest-data-breaches-hacks\/. [Online; accessed 02-Jan-2019]."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.2172\/4390578"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"e_1_3_2_1_24_1","volume-title":"A taxonomy of recommender agents on the internet. Artificial intelligence review 19, 4","author":"Montaner Miquel","year":"2003","unstructured":"Miquel Montaner, Beatriz L\u00f3pez, and Josep\u00a0Llu\u00eds De\u00a0La\u00a0Rosa. 2003. A taxonomy of recommender agents on the internet. Artificial intelligence review 19, 4 (2003), 285\u2013330."},{"key":"e_1_3_2_1_25_1","volume-title":"Efficient progressive sampling for association rules. In null","author":"Parthasarathy Srinivasan","unstructured":"Srinivasan Parthasarathy. 2002. Efficient progressive sampling for association rules. In null. IEEE, 354."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879192"},{"key":"e_1_3_2_1_27_1","volume-title":"Sampling and estimation in hidden populations using respondent-driven sampling. Sociological methodology 34, 1","author":"Salganik J","year":"2004","unstructured":"Matthew\u00a0J Salganik and Douglas\u00a0D Heckathorn. 2004. Sampling and estimation in hidden populations using respondent-driven sampling. Sociological methodology 34, 1 (2004), 193\u2013240."},{"key":"e_1_3_2_1_28_1","unstructured":"Maxwell Salzberg. 2010. Kickstarter Pitch. https:\/\/web.archive.org\/web\/20110814222702http:\/\/blog.joindiaspora.com\/2010\/04\/27\/kickstarter-pitch.html. https:\/\/web.archive.org\/web\/20110814222702http:\/\/blog.joindiaspora.com\/2010\/04\/27\/kickstarter-pitch.html Online accessed 21.03.2019."},{"key":"e_1_3_2_1_29_1","unstructured":"Richard\u00a0L Scheaffer William Mendenhall\u00a0III R\u00a0Lyman Ott and Kenneth\u00a0G Gerow. 2011. Elementary survey sampling. Cengage Learning."},{"key":"e_1_3_2_1_30_1","volume-title":"Electronic and Automation Control Conference (IAEAC). IEEE, 1725\u20131731","author":"Shi Xiujin","year":"2017","unstructured":"Xiujin Shi, Shaozong Chen, and Hui Yang. 2017. DFPS: Distributed FP-growth algorithm based on Spark. In 2017 IEEE 2nd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC). IEEE, 1725\u20131731."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.39"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.2001730"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.41"},{"key":"e_1_3_2_1_34_1","unstructured":"Hannu Toivonen. 1996. Sampling large databases for association rules. In VLDB Vol.\u00a096. 134\u2013145."},{"key":"e_1_3_2_1_35_1","unstructured":"Theja Tulabandhula Shailesh Vaya and Aritra Dhar. 2017. Privacy-preserving Targeted Advertising. arXiv preprint arXiv:1710.03275(2017)."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3347013"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM38437.2019.9013901"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851231"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCSW.2011.34"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICACI.2012.6463170"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2017.07.016"}],"event":{"name":"ARES 2021: The 16th International Conference on Availability, Reliability and Security","location":"Vienna Austria","acronym":"ARES 2021"},"container-title":["Proceedings of the 16th International Conference on Availability, Reliability and Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465481.3465482","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465481.3465482","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:28Z","timestamp":1750191448000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465481.3465482"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,17]]},"references-count":41,"alternative-id":["10.1145\/3465481.3465482","10.1145\/3465481"],"URL":"https:\/\/doi.org\/10.1145\/3465481.3465482","relation":{},"subject":[],"published":{"date-parts":[[2021,8,17]]},"assertion":[{"value":"2021-08-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}