{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T13:34:35Z","timestamp":1648906475533},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,5,9]],"date-time":"2018-05-09T00:00:00Z","timestamp":1525824000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2018,10]]},"DOI":"10.1007\/s11235-018-0459-8","type":"journal-article","created":{"date-parts":[[2018,5,9]],"date-time":"2018-05-09T15:49:54Z","timestamp":1525880994000},"page":"223-235","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Age-based anonymity: a randomized routing approach to communication unobservability"],"prefix":"10.1007","volume":"69","author":[{"given":"Peyman","family":"Taher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alireza T.","family":"Boloorchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. H.","family":"Samadzadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,9]]},"reference":[{"issue":"2","key":"459_CR1","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1109\/SURV.2011.042011.00080","volume":"14","author":"D Kelly","year":"2012","unstructured":"Kelly, D., Raines, R., Baldwin, R., Grimaila, M., & Mullins, B. (2012). Exploring extant and emerging issues in anonymous networks: A taxonomy and survey of protocols and metrics. IEEE Communications Surveys & Tutorials, 14(2), 579\u2013606.","journal-title":"IEEE Communications Surveys & Tutorials"},{"issue":"2","key":"459_CR2","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D Chaum","year":"1981","unstructured":"Chaum, D. (1981). Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2), 84\u201388.","journal-title":"Communications of the ACM"},{"issue":"4","key":"459_CR3","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. (1998). Anonymous connections and onion routing. IEEE Journal of Selected Areas in Communications, 16(4), 482\u2013494.","journal-title":"IEEE Journal of Selected Areas in Communications"},{"issue":"1","key":"459_CR4","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. (1998). Crowds: Anonymity for web transactions. ACM Transactions on Information and System Security (TISSEC), 1(1), 66\u201392.","journal-title":"ACM Transactions on Information and System Security (TISSEC)"},{"key":"459_CR5","doi-asserted-by":"crossref","unstructured":"Freedman, M. J., & Morris, R. (2002). Tarzan: A peer-to-peer anonymizing network layer. In Proceedings of the 9th ACM conference on computer and communications security (CCS\u201902) (pp. 193\u2013206). Washington DC, USA.","DOI":"10.1145\/586110.586137"},{"key":"459_CR6","doi-asserted-by":"crossref","unstructured":"Il-Khatib, K., Korba, L., Song, R., & Yee, G. (2003). Secure dynamic distributed routing algorithm for ad hoc wireless networks. In Proceedings of the international conference on parallel processing workshops (ICPPW) (pp. 359\u2013366). Kaohsiung, Taiwan.","DOI":"10.1109\/ICPPW.2003.1240390"},{"key":"459_CR7","doi-asserted-by":"crossref","unstructured":"Kong, J., & Hong, X. (2003). ANODR: Anonymous on demand routing with untraceable routes for mobile adhoc networks. In Proceedings of the 4th ACM international symposium on mobile ad-hoc networking & computing (MobiHoc\u201903) (pp. 291\u2013302). Annapolis, MD.","DOI":"10.1145\/778415.778449"},{"key":"459_CR8","unstructured":"Jakobsson, M., Juels, A., & Rivest, R. (2002). Making mix nets robust for electronic voting by randomized partial checking. In Proceedings of the 11th USENIX security symposium (pp. 339\u2013353). Monterey, CA."},{"issue":"1","key":"459_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10207-010-0117-y","volume":"10","author":"K Peng","year":"2011","unstructured":"Peng, K., Dawson, E., & Bao, F. (2011). Modification and optimization of a shuffling scheme stronger security, formal analysis and higher efficiency. International Journal of Information Security, 10(1), 33\u201347.","journal-title":"International Journal of Information Security"},{"key":"459_CR10","unstructured":"Peng, K., & Zhang, Y. (2012). A secure mix network with an efficient validity verification. In Y. Xiang, M. Pathan, X. Tao, & H. Wang (Eds.), Internet and distributed computing systems (Vol. 7646, pp. 85\u201396). Lecture Notes in Computer Science Heidelberg: Springer."},{"issue":"9","key":"459_CR11","first-page":"7","volume":"4","author":"JA Boyan","year":"1997","unstructured":"Boyan, J. A. (1997). The anonymizer: Protecting user privacy on the web. Computer-Mediated Communication Magazine, 4(9), 7\u201313.","journal-title":"Computer-Mediated Communication Magazine"},{"key":"459_CR12","unstructured":"Berthold, O., Federrath, H., & K\u00f6psell, S. (2001). Web MIXes: A system for anonymous and unobservable internet access. In Proceedings of the international workshop on designing enhancing technologies: Design issues in anonymity and unobservability (pp. 115\u2013129) Berkeley, CA."},{"key":"459_CR13","doi-asserted-by":"crossref","unstructured":"Goldberg, I., Wagner, D., & Brewer, E. (1997). Privacy-enhancing technologies for the internet. In Proceedings of the 42nd IEEE spring COMPCON (computer conference) (pp. 103\u2013109). San Jose, CA.","DOI":"10.21236\/ADA385546"},{"key":"459_CR14","unstructured":"Borisov, N. (2005). Anonymous routing in structured peer-to-peer overlays. Ph.D. thesis, Computer Science Division. Electrical Engineering and Computer Science Department, University of California, Berkeley, CA."},{"key":"459_CR15","unstructured":"M\u00f6ller, U., Cottrell, L., Palfrader, P., & Sassaman, L. (2003). Mixmaster Protocol\u2014Version 2. Internet Engineering Task Force Internet Draft, \n                    http:\/\/www.abditum.com\/mixmaster-spec.txt\n                    \n                  , date created: July 2003. Accessed Feb 2010."},{"key":"459_CR16","doi-asserted-by":"crossref","unstructured":"Danezis, G., Dingledine, R., & Mathewson, N. (2003). Mixminion: Design of a type III anonymous remailer protocol. In Proceedings of the 2003 IEEE symposium on security and privacy (pp. 2\u201315). Berkeley, CA.","DOI":"10.1109\/SECPRI.2003.1199323"},{"key":"459_CR17","volume-title":"The official PGP user\u2019s guide","author":"PR Zimmermann","year":"1995","unstructured":"Zimmermann, P. R. (1995). The official PGP user\u2019s guide. Cambridge: The MIT Press."},{"key":"459_CR18","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., & Syverson, P. (2004). Tor: The second-generation onion router. In Proceedings of the 13th USENIX security symposium (pp. 303\u2013320). San Diego, CA.","DOI":"10.21236\/ADA465464"},{"issue":"3","key":"459_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2382448.2382452","volume":"15","author":"J Feigenbaum","year":"2012","unstructured":"Feigenbaum, J., Johnson, A., & Syverson, P. F. (2012). Probabilistic analysis of onion routing in a black-box model. ACM Transactions on Information and System Security, 15(3), 1\u201328.","journal-title":"ACM Transactions on Information and System Security"},{"key":"459_CR20","doi-asserted-by":"crossref","unstructured":"Johnson, A., & Syverson, P. (2009). More anonymous onion routing through trust. In Proceedings of computer security foundations symposium (IEEE CSF\u201909) (pp. 3\u201312). Zurich, Switzerland.","DOI":"10.1109\/CSF.2009.27"},{"key":"459_CR21","unstructured":"Danezis, G., Diaz, C., Troncoso, C., & Laurie, B. (2010). Drac: An architecture for anonymous low-volume communications. In M. J. Atallah & N. J. Hopper (Eds.), Privacy enhancing technologies-10th international symposium (Vol. 6205, pp. 202\u2013219). Lecture Notes in Computer Science Heidelberg: Springer."},{"key":"459_CR22","doi-asserted-by":"crossref","unstructured":"Johnson, A., Syverson, P., Dingledine, R., & Mathewson, N. (2011). Trust-based anonymous communication: Adversary models and routing algorithms. In Proceedings of the 18th ACM conference on computer and communication security (CCS\u201911), Chicago, IL (pp. 175\u2013186).","DOI":"10.1145\/2046707.2046729"},{"key":"459_CR23","doi-asserted-by":"crossref","unstructured":"Zhou, P., Luo, X., & Chang, R. K. C. (2013). More anonymity through trust degree in trust-based onion routing. In Keromytis, A., & Pietro, R. (Eds.), Security and privacy in communication networks, Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (Vol. 106, pp. 273\u2013291).","DOI":"10.1007\/978-3-642-36883-7_17"},{"key":"459_CR24","doi-asserted-by":"crossref","unstructured":"Backes, M., Kate, A., & Mohammadi, E. (2012). Ace: An efficient key-exchange for onion routing. In Proceedings of the 11th workshop on privacy in the electronic society (WPES\u201912) (pp. 55\u201364). Raleigh, NC.","DOI":"10.1145\/2381966.2381974"},{"key":"459_CR25","unstructured":"Pfitzmann, A., & Hansen, M. (2008). Anonymity, unlinkability, undetectability, unobservability, pseudonymity, and identity management\u2014a consolidated proposal for terminology. Draft, \n                    http:\/\/dud.inf.tu-dresden.de\/Anon_Terminology.shtml\n                    \n                  , Version 0.32. Date created: February 2008. Accessed Feb 2010."},{"key":"459_CR26","unstructured":"McQueen, J. B. (1996). Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability (Vol. 1, pp. 281\u2013297). Berkeley, CA."},{"issue":"8","key":"459_CR27","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"AK Jain","year":"2010","unstructured":"Jain, A. K. (2010). Data clustering: 50 years beyond K-means. Journal of Pattern Recognition, 31(8), 651\u2013666.","journal-title":"Journal of Pattern Recognition"},{"key":"459_CR28","doi-asserted-by":"crossref","unstructured":"Heinzelman, W. R., Chandrakasan, A., & Balakrishnan, H. (2000). Energy-efficient communication protocol for wireless microsensor networks. In Proceedings of the Hawaii international conference on system sciences (HICSS\u201900) (Vol. 2, pp. 1\u201310). Wailea Maui, HI.","DOI":"10.1109\/HICSS.2000.926982"},{"key":"459_CR29","doi-asserted-by":"crossref","unstructured":"Boloorchi, A. T., Samadzadeh, M. H., & Rahnavard, N. (2014). A new parallelism-capable clustering algorithm for wireless sensor networks. In 14th IEEE\/ACM international symposium on cluster, cloud and grid computing (CCGrid\u201914) (pp. 660\u2013669). Chicago, IL.","DOI":"10.1109\/CCGrid.2014.113"},{"key":"459_CR30","unstructured":"Postel, J., & Reynolds, J. (1998). A standard for transmission of IP datagrams over IEEE 802 networks. RFC-1042, Information Science Institution. \n                    http:\/\/tools.ietf.org\/html\/rfc1042\n                    \n                  . Date created: February 1988. Accessed Feb 2010."},{"issue":"11","key":"459_CR31","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0898-1221(92)90034-F","volume":"24","author":"GT Leavens","year":"1992","unstructured":"Leavens, G. T., & Vermeulen, M. (1992). 3x\u00a0+\u00a01 search programs. Computers and Mathematics with Applications, 24(11), 79\u201399.","journal-title":"Computers and Mathematics with Applications"},{"issue":"1","key":"459_CR32","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/00029890.1985.11971528","volume":"92","author":"JC Lagarias","year":"1985","unstructured":"Lagarias, J. C. (1985). The 3x + 1 problem and its generalizations. The American Mathematical Monthly, 92(1), 3\u201323.","journal-title":"The American Mathematical Monthly"},{"key":"459_CR33","unstructured":"NIST\u2014National Institute of Standards and Technology. (2008). Information Technology Laboratory, Secure Hash Standard (SHS), Federal Information Processing Standards, FIPS PUB 180-3, Gaithersburg, MD."}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-018-0459-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-018-0459-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-018-0459-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T23:16:49Z","timestamp":1557357409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-018-0459-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,9]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,10]]}},"alternative-id":["459"],"URL":"https:\/\/doi.org\/10.1007\/s11235-018-0459-8","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,9]]},"assertion":[{"value":"9 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}