{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,30]],"date-time":"2024-11-30T05:22:04Z","timestamp":1732944124542,"version":"3.30.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"11-12","license":[{"start":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T00:00:00Z","timestamp":1710288000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T00:00:00Z","timestamp":1710288000000},"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":["Ann. Telecommun."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s12243-024-01017-5","type":"journal-article","created":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T08:32:32Z","timestamp":1710318752000},"page":"745-762","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A deeper look at Ariadne: a privacy-preserving network layer protocol"],"prefix":"10.1007","volume":"79","author":[{"given":"Antoine","family":"Fressancourt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi","family":"Iannone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mael","family":"Kerichard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,13]]},"reference":[{"key":"1017_CR1","doi-asserted-by":"publisher","unstructured":"Fressancourt A, Iannone L (2023) Ariadne: a privacy-preserving network layer protocol. In: 2023 7th cyber security in networking conference (CSNet). pp 46\u201352. https:\/\/doi.org\/10.1109\/CSNet59123.2023.10339734","DOI":"10.1109\/CSNet59123.2023.10339734"},{"key":"1017_CR2","doi-asserted-by":"publisher","unstructured":"Farrell S, Tschofenig H (2014) Pervasive monitoring is an attack. RFC Editor . https:\/\/doi.org\/10.17487\/RFC7258, https:\/\/www.rfc-editor.org\/info\/rfc7258","DOI":"10.17487\/RFC7258"},{"key":"1017_CR3","unstructured":"Regulation (EU) 2016\/679 of the European Parliament and of the Council (2016). https:\/\/eur-lex.europa.eu\/eli\/reg\/2016\/679\/oj"},{"key":"1017_CR4","unstructured":"Building a more private web: a path towards making third party cookies obsolete (2020). https:\/\/blog.chromium.org\/2020\/01\/building-more-private-web-path-towards.html"},{"key":"1017_CR5","unstructured":"iCloud Private Relay Overview (2021). https:\/\/www.apple.com\/privacy\/docs\/iCloud_Private_Relay_Overview_Dec2021.PDF"},{"key":"1017_CR6","doi-asserted-by":"publisher","unstructured":"Goldschlag DM, Reed MG, Syverson PF (1996) Hiding routing information. In: International workshop on information hiding. Springer, pp 137\u2013150. https:\/\/doi.org\/10.1007\/3-540-61996-8_37","DOI":"10.1007\/3-540-61996-8_37"},{"key":"1017_CR7","doi-asserted-by":"publisher","unstructured":"Danezis G, Goldberg I (2009) Sphinx: a compact and provably secure mix format. In: 2009 30th IEEE symposium on security and privacy. IEEE, pp 269\u2013282. https:\/\/doi.org\/10.1109\/SP.2009.15","DOI":"10.1109\/SP.2009.15"},{"key":"1017_CR8","doi-asserted-by":"publisher","unstructured":"Dingledine R, Mathewson N, Syverson P (2004) Tor: the second-generation onion router. In: Proceedings of the 13th conference on USENIX security symposium - vol 13. SSYM\u201904. USENIX Association, USA, pp 21. https:\/\/doi.org\/10.5555\/1251375.1251396. https:\/\/www.usenix.org\/conference\/13th-usenix-security-symposium\/tor-second-generation-onion-router","DOI":"10.5555\/1251375.1251396"},{"key":"1017_CR9","doi-asserted-by":"publisher","unstructured":"Kuhn C, Beck M, Strufe T (2020) Breaking and (partially) fixing provably secure onion routing. In: 2020 IEEE symposium on security and privacy (SP). IEEE, pp 168\u2013185. https:\/\/doi.org\/10.1109\/SP40000.2020.00039","DOI":"10.1109\/SP40000.2020.00039"},{"key":"1017_CR10","doi-asserted-by":"publisher","unstructured":"Kuhn C, Hofheinz D, Rupp A, Strufe T (2021) Onion routing with replies. In: Tibouchi M, Wang H (eds) Advances in cryptology \u2013 ASIACRYPT 2021. Springer, Cham, pp 573\u2013604. https:\/\/doi.org\/10.1007\/978-3-030-92075-3_20","DOI":"10.1007\/978-3-030-92075-3_20"},{"key":"1017_CR11","doi-asserted-by":"publisher","unstructured":"Freire ESV, Hofheinz D, Kiltz E, Paterson KG (2013) Non-interactive key exchange. In: Kurosawa K, Hanaoka G (eds) Public-key cryptography \u2013 PKC 2013. Springer, Berlin, Heidelberg, pp 254\u2013271. https:\/\/doi.org\/10.1007\/978-3-642-36362-7_17","DOI":"10.1007\/978-3-642-36362-7_17"},{"key":"1017_CR12","doi-asserted-by":"publisher","unstructured":"Shirazi F, Simeonovski M, Asghar MR, Backes M, Diaz C (2018) A survey on routing in anonymous communication protocols. ACM Comput Surv 51(3). https:\/\/doi.org\/10.1145\/3182658","DOI":"10.1145\/3182658"},{"issue":"2","key":"1017_CR13","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"DL Chaum","year":"1981","unstructured":"Chaum DL (1981) Untraceable electronic mail, return addresses, and digital pseudonyms. Commun ACM 24(2):84\u201390. https:\/\/doi.org\/10.1145\/358549.358563","journal-title":"Commun ACM"},{"key":"1017_CR14","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1515\/popets-2017-0007","volume":"1","author":"C Chen","year":"2017","unstructured":"Chen C, Perrig A (2017) PHI: path-hidden lightweight anonymity protocol at network layer. Proc Priv Enhancing Technol 1:100\u2013117. https:\/\/doi.org\/10.1515\/popets-2017-0007","journal-title":"Proc Priv Enhancing Technol"},{"key":"1017_CR15","doi-asserted-by":"publisher","unstructured":"Chen C, Asoni DE, Perrig A, Barrera D, Danezis G, Troncoso C (2018) TARANET: traffic-analysis resistant anonymity at the network layer. In: 2018 IEEE European symposium on security and privacy (EuroS &P). IEEE, pp 137\u2013152. https:\/\/doi.org\/10.1109\/EuroSP.2018.00018","DOI":"10.1109\/EuroSP.2018.00018"},{"key":"1017_CR16","doi-asserted-by":"publisher","unstructured":"Sankey J, Wright M (2014) Dovetail: stronger anonymity in next-generation internet routing. In: De\u00a0Cristofaro E, Murdoch SJ (eds) Privacy enhancing technologies. Springer, Cham, pp 283\u2013303. https:\/\/doi.org\/10.1007\/978-3-319-08506-7_15","DOI":"10.1007\/978-3-319-08506-7_15"},{"key":"1017_CR17","doi-asserted-by":"publisher","unstructured":"Hsiao H-C, Kim TH-J, Perrig A, Yamada A, Nelson SC, Gruteser M, Meng W (2012) LAP: lightweight anonymity and privacy. In: 2012 IEEE symposium on security and privacy. IEEE, pp 506\u2013520. https:\/\/doi.org\/10.1109\/SP.2012.37","DOI":"10.1109\/SP.2012.37"},{"key":"1017_CR18","doi-asserted-by":"publisher","unstructured":"Chen C, Asoni DE, Barrera D, Danezis G, Perrig A (2015) HORNET: high-speed onion routing at the network layer. In: Proceedings of the 22nd ACM SIGSAC conference on computer and communications security. CCS \u201915. Association for Computing Machinery, New York, USA, pp 1441\u20131454. https:\/\/doi.org\/10.1145\/2810103.2813628","DOI":"10.1145\/2810103.2813628"},{"key":"1017_CR19","doi-asserted-by":"publisher","unstructured":"Johnson A, Wacek C, Jansen R, Sherr M, Syverson P (2013) Users get routed: traffic correlation on Tor by realistic adversaries. In: Proceedings of the 2013 ACM SIGSAC conference on computer & communications security. CCS \u201913. Association for Computing Machinery, New York, USA, pp 337\u2013348. https:\/\/doi.org\/10.1145\/2508859.2516651","DOI":"10.1145\/2508859.2516651"},{"key":"1017_CR20","doi-asserted-by":"publisher","unstructured":"Basyoni L, Fetais N, Erbad A, Mohamed A, Guizani M (2020) Traffic analysis attacks on Tor: a survey. In: 2020 IEEE international conference on informatics, IoT, and enabling technologies (ICIoT). IEEE, pp 183\u2013188. https:\/\/doi.org\/10.1109\/ICIoT48696.2020.9089497","DOI":"10.1109\/ICIoT48696.2020.9089497"},{"key":"1017_CR21","doi-asserted-by":"publisher","unstructured":"Chan J, Rogaway P (2019) Anonymous AE. In: Galbraith SD, Moriai S (eds) Advances in cryptology \u2013 ASIACRYPT 2019. Springer, Cham, pp 183\u2013208. https:\/\/doi.org\/10.1007\/978-3-030-34621-8_7","DOI":"10.1007\/978-3-030-34621-8_7"},{"key":"1017_CR22","doi-asserted-by":"publisher","unstructured":"Camenisch J, Lysyanskaya A (2005) A formal treatment of onion routing. In: Shoup V (ed) Advances in cryptology \u2013 CRYPTO 2005. Springer, Berlin, Heidelberg, pp 169\u2013187. https:\/\/doi.org\/10.1007\/11535218_11","DOI":"10.1007\/11535218_11"},{"key":"1017_CR23","doi-asserted-by":"publisher","unstructured":"Kuhn C, Beck M, Schiffner S, Jorswieck E, Strufe T (2019) On privacy notions in anonymous communication 2:105\u2013125. https:\/\/doi.org\/10.2478\/popets-2019-0022","DOI":"10.2478\/popets-2019-0022"},{"key":"1017_CR24","unstructured":"Banking - Personal Identification Number Management and Security - Part 1: PIN Protection Principles and Techniques for Online PIN Verification in ATM and POS Systems (2003)"},{"key":"1017_CR25","doi-asserted-by":"publisher","unstructured":"Brier E, Peyrin T (2010) A forward-secure symmetric-key derivation protocol. In: Abe M (ed) Advances in cryptology - ASIACRYPT 2010. Springer, Berlin, Heidelberg, pp 250\u2013267. https:\/\/doi.org\/10.1007\/978-3-642-17373-8_15","DOI":"10.1007\/978-3-642-17373-8_15"},{"key":"1017_CR26","doi-asserted-by":"publisher","unstructured":"Krawczyk H (2010) Cryptographic extraction and key derivation: the HKDF scheme. In: Rabin T (ed) Advances in cryptology \u2013 CRYPTO 2010. Springer, Berlin, Heidelberg, pp 631\u2013648. https:\/\/doi.org\/10.1007\/978-3-642-14623-7_34","DOI":"10.1007\/978-3-642-14623-7_34"},{"key":"1017_CR27","doi-asserted-by":"publisher","unstructured":"Kushilevitz E, Ostrovsky R (1997) Replication is not needed: single database, computationally-private information retrieval. In: Proceedings 38th annual symposium on foundations of computer science. pp 364\u2013373. https:\/\/doi.org\/10.1109\/SFCS.1997.646125","DOI":"10.1109\/SFCS.1997.646125"},{"key":"1017_CR28","doi-asserted-by":"publisher","unstructured":"Beato F, Halunen K, Mennink B (2016) Improving the Sphinx mix network. In: Foresti S, Persiano G (eds) Cryptology and network security. Springer, Cham, pp 681\u2013691. https:\/\/doi.org\/10.1007\/978-3-319-48965-0_46","DOI":"10.1007\/978-3-319-48965-0_46"},{"key":"1017_CR29","doi-asserted-by":"publisher","unstructured":"Filsfils C, Dukes D, Previdi S, Leddy J, Matsushima S, Voyer D (2020) IPv6 Segment Routing Header (SRH). RFC Editor. https:\/\/doi.org\/10.17487\/RFC8754, https:\/\/www.rfc-editor.org\/info\/rfc8754","DOI":"10.17487\/RFC8754"},{"key":"1017_CR30","doi-asserted-by":"publisher","unstructured":"Fenner B (2006) Experimental Values In IPv4, IPv6, ICMPv4, ICMPv6, UDP, and TCP Headers. RFC Editor. https:\/\/doi.org\/10.17487\/RFC4727, https:\/\/www.rfc-editor.org\/info\/rfc4727","DOI":"10.17487\/RFC4727"},{"key":"1017_CR31","doi-asserted-by":"publisher","unstructured":"L\u00e9as R, Iurman J, Vyncke E, Donnet B (2022) Measuring IPv6 extension headers survivability with James. In: Proceedings of the 22nd ACM internet measurement conference. IMC \u201922. Association for Computing Machinery, New York, USA, pp 746\u2013747. https:\/\/doi.org\/10.1145\/3517745.3563019","DOI":"10.1145\/3517745.3563019"},{"key":"1017_CR32","doi-asserted-by":"publisher","unstructured":"Gross J, Ganga I, Sridhar T (2020) Geneve: generic network virtualization encapsulation. RFC Editor. https:\/\/doi.org\/10.17487\/RFC8926, https:\/\/www.rfc-editor.org\/info\/rfc8926","DOI":"10.17487\/RFC8926"},{"key":"1017_CR33","doi-asserted-by":"publisher","unstructured":"Farinacci D, Fuller V, Meyer D, Lewis D, Cabellos-Aparicio A (2022) The locator\/ID separation protocol (LISP). RFC Editor. https:\/\/doi.org\/10.17487\/RFC9300, https:\/\/www.rfc-editor.org\/info\/rfc9300","DOI":"10.17487\/RFC9300"},{"key":"1017_CR34","doi-asserted-by":"publisher","unstructured":"Boneh D (1998) The decision Diffie-Hellman problem. In: Buhler JP (ed) Algorithmic number theory. Springer, Berlin, Heidelberg, pp 48\u201363. https:\/\/doi.org\/10.1007\/BFb0054851","DOI":"10.1007\/BFb0054851"}],"container-title":["Annals of Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-024-01017-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12243-024-01017-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-024-01017-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T23:03:35Z","timestamp":1732921415000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12243-024-01017-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,13]]},"references-count":34,"journal-issue":{"issue":"11-12","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1017"],"URL":"https:\/\/doi.org\/10.1007\/s12243-024-01017-5","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"type":"print","value":"0003-4347"},{"type":"electronic","value":"1958-9395"}],"subject":[],"published":{"date-parts":[[2024,3,13]]},"assertion":[{"value":"1 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}}]}}