{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T01:02:25Z","timestamp":1780448545842,"version":"3.54.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031069741","type":"print"},{"value":"9783031069758","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-06975-8_9","type":"book-chapter","created":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T19:03:42Z","timestamp":1654196622000},"page":"142-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Evaluation of\u00a0Circuit Lifetimes in\u00a0Tor"],"prefix":"10.1007","author":[{"given":"Kevin","family":"K\u00f6ster","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Marx","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anne","family":"Kunstmann","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hannes","family":"Federrath","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,3]]},"reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-39077-7_8","volume-title":"Privacy Enhancing Technologies","author":"M AlSabah","year":"2013","unstructured":"AlSabah, M., Bauer, K., Elahi, T., Goldberg, I.: The path less travelled: overcoming tor\u2019s bottlenecks with traffic splitting. In: De Cristofaro, E., Wright, M. (eds.) PETS 2013. LNCS, vol. 7981, pp. 143\u2013163. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39077-7_8"},{"key":"9_CR2","unstructured":"Diaz, C.: Anonymity metrics revisited. In: Dagstuhl Seminar Proceedings. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2006)"},{"key":"9_CR3","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"},{"key":"9_CR4","unstructured":"Google Inc., Let\u2019s Make the Web Faster - Google Code, 26 May 2010. https:\/\/web.archive.org\/web\/20120324082535\/https:\/\/code.google.com\/speed\/articles\/web-metrics.html. Accessed 13 Jan 2022"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Hanley, H., et al.: DPSelect: a differential privacy based guard relay selection algorithm for Tor. In: PoPETs 2019, no. 2 (2019)","DOI":"10.2478\/popets-2019-0025"},{"key":"9_CR6","unstructured":"Heaptrack. KDE Applications. https:\/\/apps.kde.org\/heaptrack\/. Accessed 13 Jan 2022"},{"key":"9_CR7","unstructured":"HTTP Archive: Page Weight (2021). https:\/\/archive.org\/reports\/page-weight. Accessed 06 Jan 2022"},{"issue":"17","key":"9_CR8","doi-asserted-by":"publisher","first-page":"2723","DOI":"10.1049\/iet-com.2018.5591","volume":"13","author":"M Imani","year":"2019","unstructured":"Imani, M., Amirabadi, M., Wright, M.: Modified relay selection and circuit selection for faster tor. IET Commun. 13(17), 2723\u20132734 (2019)","journal-title":"IET Commun."},{"key":"9_CR9","unstructured":"Jansen, R.: Shadow - the shadow simulator. https:\/\/shadow.github.io\/. Accessed 13 Jan 2022"},{"key":"9_CR10","unstructured":"Jansen, R.: Shadow\/Tornettools. shadow, 10 July 2021. https:\/\/github.com\/shadow\/tornettools. Accessed 13 Jan 2022"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Jansen, R., Hopper, N.: Shadow: running tor in a box for accurate and efficient experimentation (2012)","DOI":"10.21236\/ADA559181"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Jansen, R., Johnson, A.: Safely measuring tor. In: CCS, pp. 1553\u20131567. ACM (2016)","DOI":"10.1145\/2976749.2978310"},{"key":"9_CR13","unstructured":"Jansen, R., Tracey, J., Goldberg, I.: Once is never enough: foundations for sound statistical inference in tor network experimentation. arXiv preprint arXiv:2102.05196 (2021)"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Jansen, R., Traudt, M., Hopper, N.: Privacy-preserving dynamic learning of tor network traffic. In: CCS, pp. 1944\u20131961. ACM (2018). https:\/\/doi.org\/10.1145\/3243734.3243815","DOI":"10.1145\/3243734.3243815"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Johnson, A., et al.: Users get routed: traffic correlation on tor by realistic adversaries. In: CCS, pp. 337\u2013348. ACM (2013)","DOI":"10.1145\/2508859.2516651"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Kim, H., Lee, S., Kim, J.: Inferring browser activity and status through remote monitoring of storage usage. In: ACSAC, pp. 410\u2013421. ACM (2016). https:\/\/doi.org\/10.1145\/2991079.2991080","DOI":"10.1145\/2991079.2991080"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Kiran, K., et al.: Anonymity and performance analysis of stream isolation in tor network. In: ICCCNT, pp. 1\u20136. IEEE (2019)","DOI":"10.1109\/ICCCNT45670.2019.8944443"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Koch, R., Golling, M., Rodosek, G.D.: Disequilibrium: tor\u2019s exit node selection under the stereoscope. In: Trustcom\/BigDataSE\/ISPA, vol. 1, pp. 942\u2013949. IEEE (2015)","DOI":"10.1109\/Trustcom.2015.468"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Mani, A., et al.: Understanding tor usage with privacy-preserving measurement. In: IMC, pp. 175\u2013187 (2018)","DOI":"10.1145\/3278532.3278549"},{"key":"9_CR20","unstructured":"Perry, M., et al.: The design and implementation of the tor browser [DRAFT]. 15 June 2018. https:\/\/2019.www.torproject.org\/projects\/torbrowser\/design\/. Accessed 13 Jan 2022"},{"key":"9_CR21","unstructured":"Resource.h \u00ab Linux \u00ab Uapi \u00ab Include - Kernel\/Git\/Torvalds\/Linux.Git - Linux Kernel Source Tree. https:\/\/git.kernel.org\/pub\/scm\/linux\/kernel\/git\/torvalds\/linux.git\/tree\/include\/uapi\/linux\/resource.h#n66. Accessed 13 Jan 2022"},{"key":"9_CR22","unstructured":"Jansen, R.: OnionTrace. shadow, 6 October 2020. https:\/\/github.com\/shadow\/oniontrace. Accessed 13 Jan 2022"},{"key":"9_CR23","unstructured":"Jansen, R.: TGen. shadow, 6 October 2020. https:\/\/github.com\/shadow\/tgen. Accessed 13 Jan 2022"},{"key":"9_CR24","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"},{"issue":"3","key":"9_CR25","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379\u2013423 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Shen, S., Gao, J., Wu, A.: Weakness identification and flow analysis based on tor network. In: CNS, pp. 90\u201394. IEEE (2018)","DOI":"10.1145\/3290480.3290481"},{"key":"9_CR27","unstructured":"Sun, Y., et al.: RAPTOR: routing attacks on privacy in tor. In: Usenix Security, pp. 271\u2013286 (2015)"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Syverson, P., Dingledine, R., Mathewson, N.: Tor: the second-generation onion router, pp. 303\u2013320 (2004)","DOI":"10.21236\/ADA465464"},{"key":"9_CR29","unstructured":"The Tor Project. Welcome to Tor Metrics. https:\/\/metrics.torproject.org\/. Accessed 13 Jan 2022"},{"key":"9_CR30","unstructured":"Tor Project. Chutney - The Chutney Tool for Testing and Automating Tor Network Setup. https:\/\/gitweb.torproject.org\/chutney.git. Accessed 13 Jan 2022"},{"key":"9_CR31","unstructured":"Wacek, C., et al.: An empirical evaluation of relay selection in tor. In: NDSS (2013)"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Wang, T., Goldberg, I.: Improved website fingerprinting on tor. In: WPES, pp. 201\u2013212. ACM (2013)","DOI":"10.1145\/2517840.2517851"}],"container-title":["IFIP Advances in Information and Communication Technology","ICT Systems Security and Privacy Protection"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06975-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:05:45Z","timestamp":1780445145000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06975-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031069741","9783031069758"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06975-8_9","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"value":"1868-4238","type":"print"},{"value":"1868-422X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"3 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on ICT Systems Security and Privacy Protection","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"13 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sec2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ifipsec2022.compute.dtu.dk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"127","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":"29","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":"23% - 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":"4","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":"5","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}