{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:11:03Z","timestamp":1755839463107,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031222948"},{"type":"electronic","value":"9783031222955"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22295-5_1","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"3-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the\u00a0Effectiveness of\u00a0Intersection Attacks in\u00a0Anonymous Microblogging"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0096-470X","authenticated-orcid":false,"given":"Sarah Abdelwahab","family":"Gaballah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6237-7378","authenticated-orcid":false,"given":"Lamya","family":"Abdullah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3001-0093","authenticated-orcid":false,"given":"Minh Tung","family":"Tran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4262-6613","authenticated-orcid":false,"given":"Ephraim","family":"Zimmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4713-5327","authenticated-orcid":false,"given":"Max","family":"M\u00fchlh\u00e4user","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, I., Pinkas, B., Yanai, A.: Blinder-scalable, robust anonymous committed broadcast. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 1233\u20131252 (2020)","DOI":"10.1145\/3372297.3417261"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/3-540-36467-6_9","volume-title":"Privacy Enhancing Technologies","author":"O Berthold","year":"2003","unstructured":"Berthold, O., Langos, H.: Dummy traffic against long term intersection attacks. In: Dingledine, R., Syverson, P. (eds.) PET 2002. LNCS, vol. 2482, pp. 110\u2013128. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36467-6_9"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, R., et al.: Talek: private group messaging with hidden access patterns. In: Annual Computer Security Applications Conference, pp. 84\u201399 (2020)","DOI":"10.1145\/3427228.3427231"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., et al.: Riposte: an anonymous messaging system handling millions of users. In: 2015 IEEE Symposium on Security and Privacy, pp. 321\u2013338. IEEE (2015)","DOI":"10.1109\/SP.2015.27"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Corrigan-Gibbs, H., Ford, B.: Dissent: accountable anonymous group messaging. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, pp. 340\u2013350 (2010)","DOI":"10.1145\/1866307.1866346"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-30114-1_21","volume-title":"Information Hiding","author":"G Danezis","year":"2004","unstructured":"Danezis, G., Serjantov, A.: Statistical disclosure or intersection attacks on anonymity systems. In: Fridrich, J. (ed.) IH 2004. LNCS, vol. 3200, pp. 293\u2013308. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30114-1_21"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-540-75551-7_3","volume-title":"Privacy Enhancing Technologies","author":"G Danezis","year":"2007","unstructured":"Danezis, G., Diaz, C., Troncoso, C.: Two-sided statistical disclosure attack. In: Borisov, N., Golle, P. (eds.) PET 2007. LNCS, vol. 4776, pp. 30\u201344. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75551-7_3"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.comcom.2015.11.004","volume":"76","author":"J Daubert","year":"2016","unstructured":"Daubert, J., et al.: Anonpubsub: anonymous publish-subscribe overlays. Comput. Commun. 76, 42\u201353 (2016)","journal-title":"Comput. Commun."},{"key":"1_CR9","unstructured":"Dixon, S.: Number of twitter users worldwide from 2019 to 2024. https:\/\/www.statista.com\/statistics\/303681\/twitter-users-worldwide\/ (2022)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Gaballah, S.A., et al.: 2PPS-publish\/subscribe with provable privacy. In: 2021 40th International Symposium on Reliable Distributed Systems (SRDS), pp. 198\u2013209. IEEE (2021)","DOI":"10.1109\/SRDS53918.2021.00028"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-68063-7_15","volume-title":"Security and Trust Management","author":"T Grube","year":"2017","unstructured":"Grube, T., Thummerer, M., Daubert, J., M\u00fchlh\u00e4user, M.: Cover traffic: a trade of anonymity and efficiency. In: Livraga, G., Mitchell, C. (eds.) STM 2017. LNCS, vol. 10547, pp. 213\u2013223. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68063-7_15"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Hayes, J., Troncoso, C., Danezis, G.: TASP: towards anonymity sets that persist. In: Proceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society, pp. 177\u2013180 (2016)","DOI":"10.1145\/2994620.2994635"},{"key":"1_CR13","unstructured":"Karissa, M., et al.: Truthy: enabling the study of online social networks. In: Proceedings 16th ACM Conference on Computer Supported Cooperative Work and Social Computing Companion (CSCW) (2013)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-36415-3_4","volume-title":"Information Hiding","author":"D Kedogan","year":"2003","unstructured":"Kedogan, D., Agrawal, D., Penz, S.: Limits of anonymity in open environments. In: Petitcolas, F.A.P. (ed.) IH 2002. LNCS, vol. 2578, pp. 53\u201369. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36415-3_4"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1515\/popets-2016-0008","volume":"2016","author":"A Kwon","year":"2016","unstructured":"Kwon, A., et al.: Riffle: an efficient communication system with strong anonymity. Proc. Priv. Enhancing Technol. 2016(2), 115\u2013134 (2016)","journal-title":"Proc. Priv. Enhancing Technol."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Kwon, A., et al.: Atom: horizontally scaling strong anonymity. In: Proceedings of the 26th Symposium on Operating Systems Principles, pp. 406\u2013422 (2017)","DOI":"10.1145\/3132747.3132755"},{"key":"1_CR17","unstructured":"Madani, S.: Improving security and efficiency of mix-based anonymous communication systems. PhD thesis, RMIT University (2015)"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Martiny, I., et al.: Improving signal\u2019s sealed sender. In: The Internet Society, NDSS (2021)","DOI":"10.14722\/ndss.2021.24180"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"McKelvey, K., et al.: Design and prototyping of a social media observatory. In: Proceedings of the 22nd International Conference on World Wide Web Companion, WWW 2013 Companion, pp. 1351\u20131358 (2013)","DOI":"10.1145\/2487788.2488174"},{"key":"1_CR20","unstructured":"Newman, Z., et al.: Spectrum: high-bandwidth anonymous broadcast with malicious security. Cryptol. ePrint Arch. (2021)"},{"key":"1_CR21","unstructured":"Pfitzmann, A., Hansen, M.: A terminology for talking about privacy by data minimization: anonymity, unlinkability, undetectability, unobservability, pseudonymity, and identity management (2010)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Piotrowska, A.M.: Studying the anonymity trilemma with a discrete-event mix network simulator. In: Proceedings of the 20th Workshop on Workshop on Privacy in the Electronic Society, pp. 39\u201344 (2021)","DOI":"10.1145\/3463676.3485614"},{"issue":"10","key":"1_CR23","doi-asserted-by":"publisher","first-page":"3787","DOI":"10.1007\/s11227-015-1524-7","volume":"72","author":"J Portela","year":"2016","unstructured":"Portela, J., et al.: Disclosing user relationships in email networks. J. Supercomput. 72(10), 3787\u20133800 (2016)","journal-title":"J. Supercomput."},{"key":"1_CR24","unstructured":"Thorbecke, C.: Facebook says government requests for user data have reached all-time high. https:\/\/abcnews.go.com\/Business\/facebook-government-requests-user-data-reached-time-high\/story?id=66981424 (2019)"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-70630-4_2","volume-title":"Privacy Enhancing Technologies","author":"C Troncoso","year":"2008","unstructured":"Troncoso, C., Gierlichs, B., Preneel, B., Verbauwhede, I.: Perfect matching disclosure attacks. In: Borisov, N., Goldberg, I. (eds.) PETS 2008. LNCS, vol. 5134, pp. 2\u201323. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70630-4_2"},{"issue":"21","key":"1_CR26","doi-asserted-by":"publisher","first-page":"29731","DOI":"10.1007\/s11042-018-6217-9","volume":"78","author":"AGS Trujillo","year":"2019","unstructured":"Trujillo, A.G.S., Orozco, A.L.S., Villalba, L.J.G., Kim, T.-H.: A traffic analysis attack to compute social network measures. Multimed. Tools Appl. 78(21), 29731\u201329745 (2019)","journal-title":"Multimed. Tools Appl."},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Wolinsky, D., et al.: Hang with your buddies to resist intersection attacks. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 1153\u20131166 (2013)","DOI":"10.1145\/2508859.2516740"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Xu, T., Chen, Y., Fu, X., Hui, P.: Twittering by cuckoo: decentralized and socio-aware online microblogging services. In: Proceedings of the ACM SIGCOMM 2010 Conference, pp. 473\u2013474 (2010)","DOI":"10.1145\/1851275.1851270"}],"container-title":["Lecture Notes in Computer Science","Secure IT Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22295-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:42:38Z","timestamp":1672540958000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22295-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031222948","9783031222955"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22295-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NordSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nordic Conference on Secure IT Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Reykjavic","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iceland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nordsec2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nordsec2022.ru.is\/","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":"85","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":"20","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":"0","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":"24% - 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":"3","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":"7","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)"}}]}}