{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T03:50:17Z","timestamp":1775620217377,"version":"3.50.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031243851","type":"print"},{"value":"9783031243868","type":"electronic"}],"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-24386-8_4","type":"book-chapter","created":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T16:18:49Z","timestamp":1674577129000},"page":"55-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["ACS: An Efficient Messaging System with\u00a0Strong Tracking-Resistance"],"prefix":"10.1007","author":[{"given":"Zhefeng","family":"Nan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changbo","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yafei","family":"Sang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangze","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,25]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Niaki, A.A.: Iclab: a global, longitudinal internet censorship measurement platform. In: 2020 IEEE Symposium on Security and Privacy (SP), pp. 135\u2013151. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00014"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Raman,R.S.: Measuring the deployment of network censorship filters at global scale. In: Network and Distributed Systems Security (NDSS) Symposium (2020)","DOI":"10.14722\/ndss.2020.23099"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Yadav, T.K., Sinha, A., Gosain, D., Sharma, P.K., Chakravarty, S.: Analyzing web censorship mechanisms in india Where the light gets. In: Proceedings of the Internet Measurement Conference, pp. 252\u2013264 (2018)","DOI":"10.1145\/3278532.3278555"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MSP.2018.1331018","volume":"16","author":"P Pearce","year":"2018","unstructured":"Pearce, P., Ensafi, R., Li, F., Feamster, N., Paxson, V.: Toward continual measurement of global network-level censorship. IEEE Security Privacy 16(1), 24\u201333 (2018)","journal-title":"IEEE Security Privacy"},{"key":"4_CR5","series-title":"Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-030-92635-9_24","volume-title":"Collaborative Computing: Networking, Applications and Worksharing","author":"C Tian","year":"2021","unstructured":"Tian, C., Zhang, Y., Yin, T.: Topology self-optimization for anti-tracking network via nodes distributed computing. In: Gao, H., Wang, X. (eds.) CollaborateCom 2021. LNICST, vol. 406, pp. 405\u2013419. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92635-9_24"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Johnson, A., Wacek, C., Jansen, R., Sherr, M., Syverson, P:. Users get routed: Traffic correlation on tor by realistic adversaries. In: Proceedings of the 2013 ACM SIGSAC conference on Computer and communications security, pp. 337\u2013348 (2013)","DOI":"10.1145\/2508859.2516651"},{"key":"4_CR7","unstructured":"Sun, Y.: $$\\{$$RAPTOR$$\\}$$: Routing attacks on privacy in tor. In: 24th $$\\{$$USENIX$$\\}$$ Security Symposium ($$\\{$$USENIX$$\\}$$ Security 15), pp. 271\u2013286 (2015)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Tian, C., Zhang, Y., Yin, T.: A feature-flux traffic camouflage method based on twin gaussian process. In: 2021 IEEE 20th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom), pp. 959\u2013966. IEEE (2021)","DOI":"10.1109\/TrustCom53373.2021.00134"},{"key":"4_CR9","unstructured":"Danezis, G., Dingledine, R., Mathewson, N.: Mixminion: Design of a type iii anonymous remailer protocol. In 2003 Symposium on Security and Privacy, 2003, pp. 2\u201315. IEEE (2003)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Borges, F., Buchmann, J., M\u00fchlh\u00e4user, M.:.Introducing asymmetric dc-nets. In: 2014 IEEE Conference on Communications and Network Security, pp. 508\u2013509, IEEE (2014)","DOI":"10.1109\/CNS.2014.6997528"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-540-24676-3_27","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"P Golle","year":"2004","unstructured":"Golle, P., Juels, A.: Dining cryptographers revisited. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 456\u2013473. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_27"},{"key":"4_CR12","unstructured":"Mittal, P., Olumofin, F.G., Troncoso, C., Borisov, N., Goldberg, I.: Pir-tor: Scalable anonymous communication using private information retrieval. In: USENIX Security Symposium, pp. 31\u201331 (2011)"},{"issue":"5","key":"4_CR13","doi-asserted-by":"publisher","first-page":"2174","DOI":"10.1109\/TNET.2018.2868054","volume":"26","author":"S Kim","year":"2018","unstructured":"Kim, S., Han, J., Ha, J., Kim, T., Han, D.: Sgx-tor: a secure and practical tor anonymity network with sgx enclaves. IEEE\/ACM Trans. Netw. 26(5), 2174\u20132187 (2018)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Blond, S.L., Choffnes, D., Caldwell, W., Druschel, P., Merritt, N.: Herd: A scalable, traffic analysis resistant anonymity network for voip systems. In: Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication, pp. 639\u2013652 (2015)","DOI":"10.1145\/2829988.2787491"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Chen, C., Asoni, D.E., Barrera, D., Danezis, G., Perrig, A.: Hornet: High-speed onion routing at the network layer. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 1441\u20131454 (2015)","DOI":"10.1145\/2810103.2813628"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Tian, C., Zhang, Y., Yin, T., Tuo, Y., Ge, R.: Achieving dynamic communication path for anti-tracking network. In: 2019 IEEE Global Communications Conference (GLOBECOM), pp. 1\u20136. IEEE (2019)","DOI":"10.1109\/GLOBECOM38437.2019.9013773"},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/TDSC.2018.2804394","volume":"17","author":"A Montieri","year":"2018","unstructured":"Montieri, A., Ciuonzo, D., Aceto, G., Pescap\u00e9, A.: Anonymity services tor, i2p, jondonym: classifying in the dark (web). IEEE Trans. Dependable Secure Comput. 17(3), 662\u2013675 (2018)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"4_CR18","unstructured":"Kwon, A., AlSabah, M., Lazar, D., Dacier, M., Devadas, S.: Circuit fingerprinting attacks: Passive deanonymization of tor hidden services. In: 24th $$\\{$$USENIX$$\\}$$ Security Symposium ($$\\{$$USENIX$$\\}$$ Security 15), pp. 287\u2013302 (2015)"},{"key":"4_CR19","unstructured":"Evans, N.S., Dingledine, R., Grothoff, C.: A practical congestion attack on tor using long paths. In: USENIX Security Symposium, pp. 33\u201350 (2009)"},{"key":"4_CR20","unstructured":"Winter, P., Ensafi, R., Loesing, K., Feamster, N.: Identifying and characterizing sybils in the tor network. In 25th $$\\{$$USENIX$$\\}$$ Security Symposium ($$\\{$$USENIX$$\\}$$ Security 16), pp. 1169\u20131185 (2016)"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Van Den Hooff, J., Lazar, D., Zaharia, M., Zeldovich, N.: Vuvuzela: Scalable private messaging resistant to traffic analysis. In: Proceedings of the 25th Symposium on Operating Systems Principles, pp. 137\u2013152 (2015)","DOI":"10.1145\/2815400.2815417"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Tyagi, N., Gilad, Y., Leung, D., Zaharia, M., Zeldovich, N.: Stadium: A distributed metadata-private messaging system. In: Proceedings of the 26th Symposium on Operating Systems Principles, pp. 423\u2013440 (2017)","DOI":"10.1145\/3132747.3132783"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-030-02641-7_18","volume-title":"Cryptology and Network Security","author":"N Gelernter","year":"2018","unstructured":"Gelernter, N., Herzberg, A., Leibowitz, H.: Two cents for strong anonymity: the anonymous post-office protocol. In: Capkun, S., Chow, S.S.M. (eds.) CANS 2017. LNCS, vol. 11261, pp. 390\u2013412. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02641-7_18"},{"key":"4_CR24","unstructured":"Piotrowska, A.M., Hayes, J., Elahi, T., Meiser, S., Danezis, G.: The loopix anonymity system. In: 26th $$\\{$$USENIX$$\\}$$ Security Symposium ($$\\{$$USENIX$$\\}$$ Security 17), pp. 1199\u20131216 (2017)"},{"issue":"2","key":"4_CR25","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1515\/popets-2016-0008","volume":"2016","author":"A Kwon","year":"2016","unstructured":"Kwon, A., Lazar, D., Devadas, S., Ford, B.: Riffle: an efficient communication system with strong anonymity. Proc. Privacy Enhanc. Technol. 2016(2), 115\u2013134 (2016)","journal-title":"Proc. Privacy Enhanc. Technol."},{"key":"4_CR26","doi-asserted-by":"crossref","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)","DOI":"10.1145\/3182658"},{"key":"4_CR27","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":"4_CR28","unstructured":"Wolinsky, D.I., Corrigan-Gibbs, H., Ford, B., Johnson, A.: Dissent in numbers: Making strong anonymity scale. In: 10th $$\\{$$USENIX$$\\}$$ Symposium on Operating Systems Design and Implementation ($$\\{$$OSDI$$\\}$$ 12), pp. 179\u2013182 (2012)"},{"issue":"3","key":"4_CR29","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."},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Kwon, A., Corrigan-Gibbs, H., Devadas, S., Ford, B.: 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":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-030-02641-7_18","volume-title":"Cryptology and Network Security","author":"N Gelernter","year":"2018","unstructured":"Gelernter, N., Herzberg, A., Leibowitz, H.: Two cents for strong anonymity: the anonymous post-office protocol. In: Capkun, S., Chow, S.S.M. (eds.) CANS 2017. LNCS, vol. 11261, pp. 390\u2013412. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02641-7_18"},{"key":"4_CR32","doi-asserted-by":"crossref","unstructured":"Paterson., Srinivasan, S.: On the relations between non-interactive key distribution, identity-based encryption and trapdoor discrete log groups. Designs, Codes Cryptograph. 52(2), 219\u2013241 (2009)","DOI":"10.1007\/s10623-009-9278-y"},{"key":"4_CR33","doi-asserted-by":"crossref","unstructured":"Chen, L., Cheng, Z., Smart, N.P.: Identity-based key agreement protocols from pairings. Int. J. Inform. Security 6(4), 213\u2013241 (2007)","DOI":"10.1007\/s10207-006-0011-9"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Wu, L., Zhang, Y., Raymond Choo, K.-K., He, D.: Efficient and secure identity-based encryption scheme with equality test in cloud computing. Future Gen. Comput. Syst. 73, 22\u201331 (2017)","DOI":"10.1016\/j.future.2017.03.007"},{"key":"4_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-319-11599-3_4","volume-title":"Secure IT Systems","author":"D Bogdanov","year":"2014","unstructured":"Bogdanov, D., Laur, S., Talviste, R.: A practical analysis of oblivious sorting algorithms for secure multi-party computation. In: Bernsmed, K., Fischer-H\u00fcbner, S. (eds.) NordSec 2014. LNCS, vol. 8788, pp. 59\u201374. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11599-3_4"},{"key":"4_CR36","unstructured":"Alexopoulos, N., Kiayias, A., Talviste, R., Zacharias, T.: Mcmix: Anonymous messaging via secure multiparty computation. In: 26th $$\\{$$USENIX$$\\}$$ Security Symposium ($$\\{$$USENIX$$\\}$$ Security 17), pp. 1217\u20131234 (2017)"},{"key":"4_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-36467-6_4","volume-title":"Privacy Enhancing Technologies","author":"A Serjantov","year":"2003","unstructured":"Serjantov, A., Danezis, G.: Towards an information theoretic metric for anonymity. In: Dingledine, R., Syverson, P. (eds.) PET 2002. LNCS, vol. 2482, pp. 41\u201353. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36467-6_4"},{"key":"4_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-36467-6_5","volume-title":"Privacy Enhancing Technologies","author":"C D\u00edaz","year":"2003","unstructured":"D\u00edaz, C., Seys, S., Claessens, J., Preneel, B.: Towards measuring anonymity. In: Dingledine, R., Syverson, P. (eds.) PET 2002. LNCS, vol. 2482, pp. 54\u201368. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36467-6_5"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Collaborative Computing: Networking, Applications and Worksharing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-24386-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,24]],"date-time":"2023-01-24T16:19:31Z","timestamp":1674577171000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-24386-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031243851","9783031243868"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-24386-8_4","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"value":"1867-8211","type":"print"},{"value":"1867-822X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CollaborateCom","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Collaborative Computing: Networking, Applications and Worksharing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"15 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"colcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/collaboratecom.eai-conferences.org\/2022","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":"Confyplus.eai.eu","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"171","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":"57","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":"33% - 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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}