{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T10:25:12Z","timestamp":1750501512668,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030900212"},{"type":"electronic","value":"9783030900229"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-90022-9_3","type":"book-chapter","created":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T08:06:08Z","timestamp":1635926768000},"page":"43-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Anonymous Short Communications over Social Networks"],"prefix":"10.1007","author":[{"given":"Francesco","family":"Buccafurri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincenzo","family":"De Angelis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria Francesca","family":"Idone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cecilia","family":"Labrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,11,4]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Beimel, A., Dolev, S.: Buses for anonymous message delivery. J. Cryptology 16(1), 25\u201339 (2003)","DOI":"10.1007\/s00145-002-0128-6"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-40956-4_10","volume-title":"Privacy Enhancing Technologies","author":"K Bennett","year":"2003","unstructured":"Bennett, K., Grothoff, C.: gap \u2013 practical anonymous networking. In: Dingledine, R. (ed.) PET 2003. LNCS, vol. 2760, pp. 141\u2013160. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-40956-4_10"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-319-78381-9_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"Z Brakerski","year":"2018","unstructured":"Brakerski, Z., Lombardi, A., Segev, G., Vaikuntanathan, V.: Anonymous IBE, leakage resilience and circular security from new assumptions. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 535\u2013564. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_20"},{"issue":"2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"DL Chaum","year":"1981","unstructured":"Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201390 (1981)","journal-title":"Commun. ACM"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Chen, C., Asoni, D.E., Perrig, A., Barrera, D., Danezis, G., Troncoso, C.: Taranet: traffic-analysis resistant anonymity at the network layer. In: 2018 IEEE European Symposium on Security and Privacy (EuroS&P), pp. 137\u2013152. IEEE (2018)","DOI":"10.1109\/EuroSP.2018.00018"},{"key":"3_CR6","unstructured":"Danezis, G., Diaz, C.: A survey of anonymous communication channels. Tech. rep., Technical Report MSR-TR-2008-35, Microsoft Research (2008)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-642-17455-1_22","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"A De Caro","year":"2010","unstructured":"De Caro, A., Iovino, V., Persiano, G.: Fully secure anonymous HIBE and secret-key anonymous IBE with short ciphertexts. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol. 6487, pp. 347\u2013366. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17455-1_22"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Morris, R.: Tarzan: a peer-to-peer anonymizing network layer. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 193\u2013206 (2002)","DOI":"10.1145\/586110.586137"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Hirt, A., Jacobson, M., Williamson, C.: Taxis: scalable strong anonymous communication. In: 2008 IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems, pp. 1\u201310. IEEE (2008)","DOI":"10.1109\/MASCOT.2008.4770566"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Kacimi, M., Ortolani, S., Crispo, B.: Anonymous opinion exchange over untrusted social networks. In: Proceedings of the Second ACM EuroSys Workshop on Social Network Systems, pp. 26\u201332 (2009)","DOI":"10.1145\/1578002.1578007"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10207-016-0318-0","volume":"16","author":"P Kotzanikolaou","year":"2017","unstructured":"Kotzanikolaou, P., Chatzisofroniou, G., Burmester, M.: Broadcast anonymous routing (bar): scalable real-time anonymous communication. Int. J. Inf. Secur. 16(3), 313\u2013326 (2017)","journal-title":"Int. J. Inf. Secur."},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1145\/2534169.2486002","volume":"43","author":"S Le Blond","year":"2013","unstructured":"Le Blond, S., Choffnes, D., Zhou, W., Druschel, P., Ballani, H., Francis, P.: Towards efficient traffic-analysis resistant anonymity networks. ACM SIGCOMM Comput. Commun. Rev. 43(4), 303\u2013314 (2013)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Li, N., Li, T., Venkatasubramanian, S.: t-closeness: privacy beyond k-anonymity and l-diversity. In: 2007 IEEE 23rd International Conference on Data Engineering, pp. 106\u2013115. IEEE (2007)","DOI":"10.1109\/ICDE.2007.367856"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Kifer, D., Gehrke, J., Venkitasubramaniam, M.: l-diversity: privacy beyond k-anonymity. ACM Trans. Knowl. Discovery Data (TKDD) 1(1), 3-es (2007)","DOI":"10.1145\/1217299.1217302"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Mislove, A., Oberoi, G., Post, A., Reis, C., Druschel, P., Wallach, D.S.: Ap3: cooperative, decentralized anonymous communication. In: Proceedings of the 11th Workshop on ACM SIGOPS European Workshop, pp. 30-es (2004)","DOI":"10.1145\/1133572.1133578"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Nosouhi, M.R., Yu, S., Sood, K., Grobler, M.: Hsdc-net: secure anonymous messaging in online social networks. In: 2019 18th IEEE International Conference On Trust, Security And Privacy In Computing and Communications\/13th IEEE International Conference On Big Data Science And Engineering (TrustCom\/BigDataSE), pp. 350\u2013357. IEEE (2019)","DOI":"10.1109\/TrustCom\/BigDataSE.2019.00054"},{"key":"3_CR17","unstructured":"Pfitzmann, A., Hansen, M.: A terminology for talking about privacy by data minimization: anonymity, unlinkability, undetectability, unobservability, pseudonymity, and identity management (2010)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Recordon, D., Reed, D.: Openid 2.0: a platform for user-centric identity management. In: Proceedings of the Second ACM Workshop on Digital Identity Management, pp. 11\u201316 (2006)","DOI":"10.1145\/1179529.1179532"},{"issue":"4","key":"3_CR19","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1109\/49.668972","volume":"16","author":"MG Reed","year":"1998","unstructured":"Reed, M.G., Syverson, P.F., Goldschlag, D.M.: Anonymous connections and onion routing. IEEE J. Sel. Areas Commun. 16(4), 482\u2013494 (1998)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"1","key":"3_CR20","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/290163.290168","volume":"1","author":"MK Reiter","year":"1998","unstructured":"Reiter, M.K., Rubin, A.D.: Crowds: anonymity for web transactions. ACM Trans. Inf. Syst. Secur. (TISSEC) 1(1), 66\u201392 (1998)","journal-title":"ACM Trans. Inf. Syst. Secur. (TISSEC)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-27809-2_24","volume-title":"Financial Cryptography","author":"M Rennhard","year":"2004","unstructured":"Rennhard, M., Plattner, B.: Practical anonymity for the masses with MorphMix. In: Juels, A. (ed.) FC 2004. LNCS, vol. 3110, pp. 233\u2013250. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27809-2_24"},{"issue":"3","key":"3_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3182658","volume":"51","author":"F Shirazi","year":"2018","unstructured":"Shirazi, F., Simeonovski, M., Asghar, M.R., Backes, M., Diaz, C.: A survey on routing in anonymous communication protocols. ACM Comput. Surv. (CSUR) 51(3), 1\u201339 (2018)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Von Ahn, L., Bortz, A., Hopper, N.J.: K-anonymous message transmission. In: Proceedings of the 10th ACM Conference on Computer and Communications Security, pp. 122\u2013130 (2003)","DOI":"10.1145\/948109.948128"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Wang, G., Wang, B., Wang, T., Nika, A., Zheng, H., Zhao, B.Y.: Whispers in the dark: analysis of an anonymous social network. In: Proceedings of the 2014 Conference on Internet Measurement Conference, pp. 137\u2013150 (2014)","DOI":"10.1145\/2663716.2663728"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Wang, Q., Borisov, N.: Octopus: a secure and anonymous dht lookup. In: 2012 IEEE 32nd International Conference on Distributed Computing Systems, pp. 325\u2013334 (2012)","DOI":"10.1109\/ICDCS.2012.78"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Wang, W., Motani, M., Srinivasan, V.: Dependent link padding algorithms for low latency anonymity systems. In: Proceedings of the 15th ACM Conference on Computer and Communications Security, pp. 323\u2013332 (2008)","DOI":"10.1145\/1455770.1455812"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Young, A.L., Yung, M.: The drunk motorcyclist protocol for anonymous communication. In: 2014 IEEE Conference on Communications and Network Security, pp. 157\u2013165. IEEE (2014)","DOI":"10.1109\/CNS.2014.6997482"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-90022-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T08:06:53Z","timestamp":1635926813000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-90022-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030900212","9783030900229"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-90022-9_3","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecureComm","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Privacy in Communication Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"securecomm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/securecomm.eai-conferences.org\/2021\/","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":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"143","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":"56","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":"39% - 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":"3","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)"}}]}}